Topics

This is the nominal topics list for the course.

Date Topic Reading
Thu 9/1 Introduction Chap 1
Tue 9/6 Memory & Processes Chap 2
Thu 9/8 Linked Lists vs Arrays 3.1 - 3.2
Tue 9/13 Project 1 out
Thu 9/15 Running Times Chapter 4
Tue 9/20 STL Stacks & Queues Chapter 5, 6
Thu 9/22 Circular Queues 3.4
Tue 9/27 Trees Chapter 7
Thu 9/29 Binary Search Trees 10.1
Tue 10/4 Project 2 out
Thu 10/6 AVL Trees 10.2
Tue 10/11 Exam 1 Review
Thu 10/13 Exam 1
Tue 10/18 Project 3 out
Thu 10/20 Red-Black Trees 10.5
Tue 10/25 Red-Black Trees
Thu 10/27 Heaps Chapter 8
Tue 11/1 Project 4 out
Thu 11/3 Leftist Heaps Handout
Tue 11/8 Hash Tables 9.1-9.2
Thu 11/10 Hash Tables
Tue 11/15 Exam 2 review, Project 5 out
Thu 11/17 Exam 2
Tue 11/22 Skip Lists 9.4
Thu 11/24 Thanksgiving
Tue 11/29 Sorting 11.1-11.3
Thu 12/1 Disjoint Sets 11.4
Tue 12/6 TBD
Thu 12/8 TBD
Tue 12/13 Final Exam Review