This is a preview of our planned schedule. We will update this schedule as we go. This page should faithfully describe the past, but it won't always accurately predict the future.
- 1
Jan 9
IntroductionReadings: Syllabus, Chapter 1
Jan 11
Getting Started in C++Readings: Chapter 2, Chapter 3, Chapter 4.1 - 4.3
Jan 13
Getting Started with RecursionReadings: Chapter 7
-
Assignment 0.
due Jan 13
- 2
Jan 16
Containers, Part IReadings: Chapter 5.1
Jan 18
Containers, Part IIReadings: Chapter 5.4 - 5.5
Jan 20
Containers, Part IIIReadings: Chapter 5.2 - 5.3
-
Section 1.
Assignment 1.
due Jan 20
- 3
Jan 23
Thinking Recursively, Part IReadings: Chapter 8.1, Chapter 8.4
Jan 25
Thinking Recursively, Part IIReadings: Chapter 8.2, Chapter 8.3
Jan 27
Thinking Recursively, Part III-
Section 2.
Assignment 2.
due Jan 27
- 4
Jan 30
Thinking Recursively, Part IVReadings: Chapter 9.1 - 9.2
Feb 1
Thinking Recursively, Part VFeb 3
Big-O NotationReadings: Chapter 10.1 - 10.2, Guide to Big-O Notation
-
Section 3.
Assignment 3.
due Feb 3
- 5
Feb 6
Searching and Sorting, Part IReadings: Chapter 10.1 - 10.2
Feb 8
Searching and Sorting, Part IIReadings: Chapter 10.3 - 10.5
Feb 10
Designing Abstractions-
Section 4.
Assignment 4.
due Feb 10
- 6
Feb 13
No ClassFeb 15
Implementing Abstractions, Part IFeb 17
Implementing Abstractions, Part IIReadings: Chapter 11, Chapter 12.1
-
Section 5.
- 7
Feb 20
No ClassFeb 22
Hashing, Part IFeb 24
Hashing, Part II-
Section 6.
Assignment 5.
due Feb 24
- 8
Feb 27
Linked Lists, Part IReadings: Chapter 13
Mar 1
Linked Lists, Part IIReadings: Chapter 13
Mar 3
Binary Search Trees, Part IReadings: Chapter 16.1 - 16.2
-
Section 7.
Assignment 6.
due Mar 3
- 9
Mar 6
Applied EthicsMar 8
Binary Search Trees, Part IIReadings: Chapter 16.1 - 16.2
Mar 10
Beyond Data StructuresReadings: Guide to Huffman Coding
-
Section 8.
Assignment 7.
due Mar 10
- 10
Mar 13
GraphsReadings: Chapter 18
Mar 15
Minimum Spanning TreesMar 17
Where to Go From Here-
Section 9.
Assignment 8.
due Mar 17