Schedule

Please note that the schedule is tentative and is subject to changes announced in class

Reading Schedule

Date Topic Reading
Tue 01/31IntroductionChap 1
Thu 02/02Memory & ProcessesChap 2
Tue 02/07Project 1 
Thu 02/09Linked Lists vs Arrays3.1 - 3.2
Tue 02/14Running TimesChapter 4
Thu 02/16STL Stacks & QueuesChapter 5, 6
Tue 02/21Circular Queues3.4
Thu 02/23Project 2 
Tue 02/28TreesChapter 7
Thu 03/02Binary Search Trees10.1
Tue 03/07AVL Trees10.2
Thu 03/09AVL Trees 
Tue 03/14Midterm Review 
Thu 03/16Midterm Review 
Tue 03/21Spring Break 
Thu 03/23Spring Break 
Tue 03/28Project 3 out 
Thu 03/30Red-Black Trees10.5
Tue 04/04Red-Black Trees 
Thu 04/06HeapsChapter 8
Tue 04/11More Heaps 
Thu 04/13Project 4 
Tue 04/18Skew Heaps 
Thu 04/20Hash Tables9.1-9.2
Tue 04/25Exam 2 Review 
Thu 04/27Exam 2 
Tue 05/02Project 5 
Thu 05/04Sorting11.1-11.3
Tue 05/09Skip Lists9.4
Thu 05/11Disjoing Sets11.4
Tue 05/16Final Exam Review