Data Structures and Algorithms II
CS 2631 (Winter 2011)
Course Syllabus

Topics, dates, text readings:
In all cases involving Java, also consult Sun Java Tutorials and the Java API. Dates for starting topics are approximate, and will be updated.
Inheritance, Abstract Classes and Interfaces, Generics: Jan 5
Goodrich and Tamassia 2.1-2.5; Bailey Ch 4, 7
Iterators: Jan 14
Goodrich and Tamassia 6.1-6.4; Bailey Ch 8
User interfaces: GUI's: Jan 21
Course notes; Sun Java Tutorial
n lg n sorts: heapsort and quicksort ; analysis of comparison sorts; other sorts: Feb 2
Goodrich and Tamassia 8.1-8.3, 11.2-3; Bailey 6.5,6.6
Map Structures and Hashing: Feb 14
Goodrich and Tamassia 9.1-19.5; Bailey 15.1-15.5
Balanced tree algorithms: AVL and RB: March 4
Goodrich and Tamassia 10.2-10.5; Bailey 14.7
Data Compression and Tries: March 18
Goodrich and Tamassia 12.3-5; Bailey 12.8
More graph algorithms: March 25
Goodrich and Tamassia 13.6; Bailey 16.4
Threads and Concurrency: April 1
See references on Moodle