Description
Core material for Computer Science degree candidates. Discussion of representative algorithms and data structures encountered in applications.
Martin Farach-Colton, Michael Fredman, Bahman Kalantari, Shan Muthukrishnan, William Steiger, Endre Szemeredi
Credits: 3
Category: A
Prerequisites: Familiarity with Prim and Kruskal minimum spanning tree algorithms and Dijkstra shortest path algorithm.
Semesters Offered:Spring and fall
Topics: Worst case, average case, and amortized analysis. Data structures: search trees, hash tables, heaps, Fibonacci heaps, union-find. Algorithms: string matching, sorting and ordering statistics, graph algorithms. NP-completeness.
Expected Work: 6-7 homework assignments. There is a midterm and final examination.
