Course Schedule

Unit 1: Fundamental Concepts & Binary Search Trees

Week Topics Text Assignments
08/31 Course Introduction
Arrays, Linked Lists, and Recursion
Ch. 3 (08/27) Project 0 Assigned
09/07 Labor Day
Stacks & Queues
Ch. 5 (09/08) Project 1 Assigned
09/14 Asymptotic Analysis Ch. 4 (09/15) Project 0 Due
(09/14) HW 1 Assigned
09/21 Trees and Binary Search Trees Ch. 7, 10.1 (09/23) HW 1 Due
09/28 AVL Trees 10.2 (09/29) Project 1 Due
(09/29) Project 2 Assigned

10/05 Red-Black Trees
AA Trees
10.5
Wikipedia
(10/05) HW 2 Asigned
10/12 Midterm Exam Review
Exam
(10/12) HW 2 Due

Midterm Exam #1: Wednesday, October 14

Unit 2: More Trees, Heaps, & Hashing

Week Topics Text Assignments
10/19 More Red-Black Trees
Splay Trees
10.4
10.3
(10/20) Project 2 Due
(10/20) Project 3 Assigned
10/26 Binary Heaps
8.1-8.3
(10/26) HW 3 Assigned
11/02 Leftist Heaps
Pairing Heaps
Leftist Heap
Pairing Heap
(11/02) HW 3 Due
11/09 Hash Tables 9.2 (11/10) Project 3 Due
(11/10) Project 4 Assigned
(11/09) HW 4 Assigned
11/16 Range Queries
Kd-Trees
Midterm Exam Review
(11/16) HW 4 Due

Midterm Exam #2: Wednesday, November 25

Unit 3: Advanced Topics

Week Topics Text Assignments
11/23 Midterm Exam
Sorting
11/30 Graphs and Graph Algorithms Ch 13 (12/01) Project 4 Due
(11/30) HW 5 Assigned
12/7 Final Exam Review (5/11) HW 5 Due

Final Exam: Friday December 11, 1:00-3:00 PM