READING GUIDE

We plan to cover most of the chapters of the Baase/van Gelder Textbook. The book has lots of information, but we can only focus on some key topics in each chapter.


MATERIAL SINCE THE MIDTERM:

I indicate an importance number in parenthesis after each section. The code is

0=skip, 1=read lightly, 2=read, 3=must know.
  1. Chap.6, Dynamic Sets:
    6.1 (1), 6.2 (1), 6.3 (1), 6.4 (0), 6.5 (3), 6.6 (3), 6.7 (0).
  2. Chap.7, Graphs:
    7.1 (1), 7.2 (3), 7.3 (1), 7.4 (3), 7.5 (2), 7.6 (2), 7.7 (0).
  3. Chap.8, Graph Optimization:
    8.1 (1), 8.2 (3), 8.3 (3), 8.4 (0).
  4. Chap.9, Transitive closure and all-pairs shortest paths:
    9.1 (1), 9.2 (2), 9.3 (3), 9.4 (3), 9.5 (0), 9.6 (0).
  5. Chap.10, Dynamic Programming:
    10.1 (1), 10.2 (1), 10.3 (0), 10.4 (3), 10.5 (0), 10.6 (0).
  6. Chap.11, String Matching:
    11.1 (1), 11.2 (1), 11.3 (3), 11.4 (0), 11.5 (0).