Algorithms and Data Structures II

1.5 credits · Undergraduate

Intermediate algorithm design and analysis. Divide-and-conquer algorithm design, including advanced sorting and selection. Advanced data structures, such as weighted graphs and disjoint set forests. Dynamic programming and greedy heuristic algorithms applied to weighted graph problems. Optimization problems, including maximum flow problems on networks. Hashing schemes and the impact of randomization. Introduction to the classes P and NP and the concept of NP-completeness.