Here is a list of topics (with textbook chapters) that may 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) June 8/15

--Augmenting data structures (chapter 14) June 15

--Hash Tables (chapter 11) June 22

--Amortized analysis (chapter 17) June 29/July 13

--Graph algorithms (chapter 22) July 20

--Minimum cost spanning trees (chapter 23)  July 27/Aug 3

--Priority queues (chapter 6) July 27

--Union-find data structures (chapter 21) Aug 3