Week | Date | Description |
Material
|
W02 | 09/03/2019 | Lecture 01: Syllabus, Course Overview and Introduction |
|
W02 | 09/05/2019 | Lecture 02: Back to the Basics |
|
W03 | 09/10/2019 | Lecture 03: Object Oriented Programming Lecture 04: Composition and Inheritance |
|
W03 | 09/12/2019 | Lecture 05: Bags Lecture 06: Bags Implementation |
|
W04 | 09/17/2019 | Lecture 07: Exceptions | |
W04 | 09/19/2019 | Lecture 08: A Bag ImplementationThat Links Data | |
W05 | 09/24/2019 | Lecture 09: The Efficiency of Algorithms | |
W05 | 09/26/2019 | Lecture 10: Stacks | |
W06 | 10/01/2019 |
Lecture 11: Stack Implementations Lecture 12: More About Exceptions |
|
W06 | 10/03/2019 | Lecture 13: Queues, Deques, and Priority Queues | |
W07 | 10/07/2019 | Lecture 14: Queues, Deques, and Priority Queues | |
W07 | 10/10/2019 | Lecture 15: Recursion | |
W08 | 10/15/2019 | Lecture 16: List Lecture 17: A List Implementation That Uses an Array |
|
W09 | 10/22/2019 | Lecture 18: A List Implementation That Links Data | |
W09 | 10/24/2019 | Midterm |
|
W10 | 10/29/2019 | Lecture 19: Iterators | |
W10 | 10/31/2019 | Lecture 21: Problem Solving with Recursion & Lecture 22:Generics |
|
W11 | 11/05/2019 | Lecture 23: An introduction to sorting | |
W11 | 11/07/2019 | Lecture 24: Faster Sorting | |
W12 | 11/12/2019 | Lecture 25: Tree | |
W12 | 11/14/2019 | Quiz 2 |
|
W13 | 11/19/2019 | Lecture 25: Tree | |
W13 | 11/21/2019 | Lecture 26: Tree Implementations & Lecture 27: BST Implementation | |
W14 | 12/03/2019 | Lecture 28: Balanced Search Trees |