Syllabus



1


Date
Lecture Assign Readings


29-31 Aug Introduction
Java Review:
  • Exceptions
  • Data Types
  • Inheritance
  • Generic Methods
Problem Set 1 out
Sahni* Chap 1



5-7 Sept
More Java and
Performance Analysis
Problem Set 1 Due
Problem Set 2 Out
Sahni Chap 1, 2



10-14 Sept Asymptotics Review and
Performance measurement

Problem Set 2 Due
Problem Set 3 Out



17-21 Sept Binary Tree review
Problem Set 3 Due
Problem Set 4 Out
Sahni chap 12




24-28 Sept Union/Find
Problem Set 4 Due
Problem Set 5 Out
Sahni chap 12.9.2



1-5 Oct Review:
Exam 1
Fast Union/Find
Review Heaps
Leftist trees
Problem Set 5 Due
Exam 1, Thursday, 4 October
Sahni chap 12.9.2, 13, 13.5



8-12 Oct Leftist Trees
Review Binary Search Trees
Problem Set 6 Out
Sahni chap 13.5, 15



18 Oct Fall Break
No problem set



15-17 Oct Balanced Search Trees:
B-Trees
Problem Set 6 Due
Problem Set 7 Out
Sahni chap 16.4



22-26 Oct Balanced Search Trees (cont.)
Problem Set 7 Due
Problem Set 8 Out
Sahni chap 6.4



29 Oct
-2 Nov
Graphs
Problem Set 8 Due
Problem Set 9 Out
Sahni chap 17.1-17.7



5-9 Nov Graph searching
Exam Review
Problem Set 9 Due
Exam 2, 9 November
Sahni chap 17.8-17.9



12-16 Nov Greedy Method
Problem Set 10 Out
Sahni chap 18



26-30 Nov Greedy Method applications
Problem Set 10 Due
Problem Set 11 Out
Sahni chap 18.3



3-7 Dec
Divide and Conquer
or Dynamic Programming
Problem Set 11 Due
Problem Set 12 Out
Sahni chap 19
or Sahni chap 20



10-14 Dec
Paper presentations
Problem Set 12 Due



Monday 17 Dec
10:30AM in Wm 310
Final Exam


* Sahni: Data Structures, Algorithms, and Applications in Java, Sartaj Sahni, McGraw-Hill, 2000.



Last Modified: 26 September 2001


THIS PAGE MAINTAINED BY:


John Barr, Ithaca College