Here is a list of topics (with textbook chapters) that will be covered
in lecture.  Additional topics may be covered in tutorial.

--You should be familiar with the material in chapters 1-4.  It will not
be covered in lecture.

--Analysis of algorithms (chapter 5)

--Quicksort (chapter 7)

--Binary search trees (chapters 12 and 13)

--Augmenting data structures (chapter 14)

--Hash Tables (chapter 11)

--Amortized analysis (chapter 17)

--Priority queues (chapter 6)

--Union-find data structures (chapter 21)

--Graph algorithms (chapter 22)

--Minimum cost spanning trees (chapter 23)

--Decision tree lower bounds (chapter 8)