TENTATIVE SCHEDULE
Honors Basic Algorithms, Fall 2000, Yap

Use this for your important reading preparation for lectures.
Chapter references are for the textbook of Goodrich and Tamassia.
This tentative schedule may be subject to change!
WEEK DATE TOPIC READING, REMARKS
1 Sep 6 Introduction First class; Chap.1
2 Sep 11, 13 Java Chap.1, 2
3 Sep 18, 20 Analysis Chap.3
4 Sep 25, 27 Linear Structures Chap.4,5
5 Oct 2, 4 Trees Chap.6
6 Oct 9, 11 Priority Queues Chap.7
7 Oct 16, 18 Dictionaries Chap.8
8 Oct 23, 25 MIDTERM; Search Trees (I) Chap.9
9 Oct 30, Nov 1 Search Trees (II) Chap.9
10 Nov 6, 8 Sorting Chap.10
11 Nov 13, 15 Sorting and Selection Chap.10
12 Nov 20, 22 Text Processing Chap.11
13 Nov 27, 29 Graphs (I) Chap.12
14 Dec 4, 6 Graphs (II) Chap.12
15 Dec 11, 13 Special Advanced Topic; Review Last Class on 13th
16 Dec 18 FINAL EXAM