Listed in: Computer Science, as COSC-30
This course continues the exploration of data structures and algorithms that is begun in Computer Science 20. Topics include balanced search trees, amortized algorithms, graph data structures and algorithms, greedy algorithms, dynamic programming algorithms, NP completeness, and case studies in algorithm design.
This course will be offered in the fall semester each year, beginning in 2009-10. It is part of the new Computer Science 20/30 sequence and will not be open to students who have taken Computer Science 21 or 31.
Requisite: Computer Science 12 and 20. Fall semester. Professor L. McGeoch.