TENTATIVE SCHEDULE
Basic Algorithms, V22.0310.003, Fall 1999, Yap

Chapter references are for the textbook of Clifford A. Shaffer.
WEEK DATE TOPIC READING, REMARKS
1 Sep 8 Introduction HW1 assigned.
Chap.1
2 Sep 13, 15 Mathematical Preliminaries Chap.2, 3 (+Appendix); Hw 1
3 Sep 20, 22 Algorithm Analysis Chap.3 (+14);
4 Sep 27, 29 Lists/Stacks/Queues Chap.4 + Appendix;
5 Oct 4, 6 Binary Trees Chap.5;
6 Oct 11, 13 General Trees Chap.6; Columbus Day 11th
7 Oct 18, 20 Graphs Chap.7
8 Oct 25, 27 MIDTERM; Graphs Chap.7
9 Nov 1, 3 Internal Sorting Chap.8
10 Nov 8, 10 External Sorting Chap.9; DROP DATE Nov 8
11 Nov 15, 17 Searching Chap.10
12 Nov 22, 24 Indexing Chap.11
13 Nov 29, Dec 1 Advanced List Chap.12
14 Dec 6, 8 Advanced Trees Chap.13
15 Dec 13 NP-Completeness Chap.14; Last Class
16 Dec 20 FINAL EXAM