CS 165 - Project in Algorithms and Data Structures
Spring 2021 [now on canvas -- this page is depricated]

Announcement(s):

• Since this is a laboratory course, there is no final exam, as per University policy.

Course Syllabus.

Projects.

Course Notes.

Tentative Reading Schedule:

• Week 1: McGeoch, chapters 1-2.
• Week 2: McGeoch, chapter 3.
• Week 3: McGeoch, chapter 4.
• Week 4: A Theoretician's Guide to the Experimental Analysis of Algorithms, by David Johnson
• Week 5: McGeoch, chapter 5.
• Week 6: McGeoch, chapter 6.
• Week 7: McGeoch, chapter 7.
• Week 8: Efficient generation of large random networks, by Batagelj and Brandes.
• Week 9: Review online notes.
• Week 10: Review online notes.