COMP-251: Data Structures and Algorithms

 

Winter 2013

 

Lecture contents and suggested readings, to be filled in as we go along:

 

Topics not covered in the texts are italicized.

 

Lecture 1 (8 Jan. 2013):

            Discussion of syllabus

            Big surprises in theoretical computer science

            Information theoretic lower bounds on sorting