TENTATIVE SCHEDULE
Basic Algorithms, Spring 2001, Yap

Use this for your important reading preparation for lectures.
Chapter references are for the textbook of Baase and Van Gelder
This tentative schedule may be subject to change!
WEEK DATE TOPIC READING, REMARKS
1 Jan 22 Introduction; Background to Analysis First class is Jan 16; Read Chap.1
2 Jan 29 Basic Data Structures Chap. 2
3 Feb 5 Recursion and Induction Chap. 3
4 Feb 12 Sorting and Selection Chap. 4 and 5
5 Feb 19 Dynamic Sets Chap 6; MONDAY is President's Day, NYU Holiday
6 Feb 26 Dynamic Sets Chap. 6
7 Mar 5 Graph Traversal Chap 7; Midterm is Wed 5 (NOT Wed 7).
8 Mar 12 Spring Recess  
9 Mar 19 Graph Algorithms Chap. 7 and 8; Guest Lectures
10 Mar 26 Shortest Paths Chap. 9
11 Apr 2 Dynamic Programming Chap. 10
12 Apr 9 String Matching Chap. 11
13 Apr 16 Polynomials and Matrices Chap. 12
14 Apr 23 NP-Completeness Chap. 13
15 Apr 30 Special Advanced Topic; Review Chap. 14; MONDAY 30th is Last Class; May 2 is FINAL EXAM