Tentative (subject to change, please check regularly)
Lecture | Date | Topic | Reading | Project | Slides | Study Questions |
1 | T, 8/27 | Welcome / Intro | Syllabus, Programming Guidelines | Lecture1 | ||
2 | F, 8/30 | Abstraction / OOP | Chapter 1, Appendix B | #1 Posted | Lecture2 | |
3 | T, 9/3 | Intro to Inheritance / Abstract Data Types / Templates | C++ Interlude 1 | Lecture3 | ADT_InhQ | |
4 | F, 9/6 | -//- | #1 DUE #2 Posted | |||
5 | T, 9/10 | Array-Based Implementation | Chapter 3 | Lecture5 | ArrayBag_SQ | |
6 | F, 9/13 | Link-based Implementation | C++ Interlude 2 (Pointers), pointers and references tutorial, Chapter 4 | #2 DUE #3 Posted | Lecture6 | LinkedChain_SQ |
7 | T, 9/17 | -//- | ||||
8 | F, 9/20 | Lists + Exceptions | Chapters 8/9 + C++ Interlude 3 | Lecture8 | List_SQ | |
9 | T, 9/24 | -//- | Lecture8-cont-Exceptions | |||
10 | F, 9/27 | Polymorphism | C++ Interlude 2 (Polymorphism) | #3 DUE #4 Posted | Lecture9 | Poly_SQ |
X | T, 10/1 | NO LECTURE | ||||
11 | F, 10/4 | -//- | ||||
X | T, 10/8 | NO LECTURE | ||||
12 | F, 10/11 | Recursion | Chapter 2 | #4 DUE | Lecture12 | Recursion_SQ |
13 | T, 10/15 | More Recursion | Chapter 5 | Lecture13 | ||
X | F, 10/18 | Midterm Exam | ||||
14 | T, 10/22 | Algorithm Efficiency | Chapter 10 | #5 Posted | Lecture14 | AlgoEff_SQ |
15 | F, 10/25 | Searching and Sorting Algorithms and their Efficiency | Chapter 11 | Lecture15 | Sorting_SQ | |
16 | T, 10/29 | -//- | ||||
17 | F, 11/1 | Stack | Chapter 6 | #5 DUE #6 posted | Lecture17 | Stack_SQ |
18 | T, 11/5 | Stack Implementation | Chapter 7 C++ Interlude 8 | Lecture18 | ||
19 | F, 11/8 | Queue | Chapter 13 | #6 DUE #7 Posted | Lecture 19 | Queue_SQ |
20 | T, 11/12 | Queue Implementation | Chapter 14 | Lecture 20 | ||
21 | F, 11/15 | Trees | Chapter 15 | Lecture21 | ||
22 | T, 11/19 | -//- | #7 DUE #8 Posted | |||
23 | F, 11/22 | Managed Pointers + Tree Implementation | Interlude 4 + Chapter 16 | L23_MP L23-TreeImpl | Tree_SQ | |
24 | T, 11/26 | -//- | ||||
X | F, 11/29 | NO LECTURE | ||||
25 | T, 12/3 | -//- | #8 DUE #9 Posted | |||
26 | F, 12/6 | Special Topic Heaps (a very quick overview) | Lecture26 | |||
27 | T, 12/10 | Final Review | #9 DUE | Review | ||
X | T, 12/17 9am-11am | FINAL EXAM |