Analysis of Algorithms

Students study the mathematical and empirical analysis of algorithms. Various searching and sorting techniques are examined. Benchmarking, the efficiency of algorithms, and comparative studies are emphasized as well as the current AP computer science case study. All the objectives of the MCPS AP curriculum are studied, with a greater degree of rigor and sophistication.  

Analysis of Algorithms Unit Outline

Unit 1: Measuring Efficiency 

• P vs NP vs NP Complete

• Asymptotic Analysis

• Big Oh

• Best Case / Worse Case / Average Case

• Heuristics

• Boyer Moore Majority Vote

Unit 2: Hashing 

• Hash Sets

• Hash Maps

• Cryptographic Hashing

• Stack

• Queue

• Open Addressing

• Separate Chaining

Unit 3: Unweighted Graph 

• Unweighted Graph

• Directed / Undirected Graph

• Connectivity

• Graph Cycles

• Centrality

• Topological Short

• Bipartite

• Shortest Path

Unit 4: Weighted Graph 

• Dijistra's

• Bellman Ford

Unit 5: Binary Trees 

• Data Compression

• Huffman Algorithm

• Shannon Algorithm

• AVL Trees

• 2-4 Tree

• Read Black Tree

Unit 6: Quantum Computing