Fall 2010

Data Structures and Algorithms II

Listed in: Computer Science, as COSC-30


Catherine C. McGeoch (Section 01)


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.

Requisite: Computer Science 12 and 20. Fall semester. Professor C. McGeoch.


2013-14: Offered in Fall 2013
Other years: Offered in Fall 2007, Fall 2008, Fall 2009, Fall 2010, Fall 2011, Fall 2012, Fall 2014
Submitted by Catherine C. McGeoch on Wednesday, 8/25/2010, at 12:13 PM


The required text for this course is the one by Cormen et. al that you used in CS20.


Taking Notes