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 3
IntroductionReadings: Syllabus, Chapter 1
Jan 5
Functions in C++Readings: Chapter 2, Chapter 7
Jan 7
Strings in C++Readings: Chapter 3, Chapter 4.1 - 4.3
-
Assignment 0.
due Jan 7
- 2
Jan 10
Containers, Part IReadings: Chapter 5.1
Jan 12
Containers, Part IIReadings: Chapter 5.2 - 5.3
Jan 14
Containers, Part IIIReadings: Chapter 5.4 - 5.5
-
Section 1.
Assignment 1.
due Jan 14
- 3
Jan 17
No ClassJan 19
Thinking Recursively, Part IReadings: Chapter 8.1, Chapter 8.4
Jan 21
Thinking Recursively, Part IIReadings: Chapter 8.2, Chapter 8.3
-
Section 2.
Assignment 2.
due Jan 21
- 4
Jan 24
Thinking Recursively, Part IIIJan 26
Thinking Recursively, Part IVReadings: Chapter 9.1 - 9.2
Jan 28
Thinking Recursively, Part V-
Section 3.
Assignment 3.
due Jan 28
- 5
Jan 31
Big-O NotationReadings: Chapter 10.1 - 10.2, Guide to Big-O Notation
Feb 2
Searching and Sorting, Part IReadings: Chapter 10.1 - 10.2
Feb 4
Searching and Sorting, Part IIReadings: Chapter 10.3 - 10.5
-
Section 4.
Assignment 4.
due Feb 4
- 6
Feb 7
Designing AbstractionsFeb 9
Implementing Abstractions, Part IReadings: Chapter 6
Feb 11
Implementing Abstractions, Part IIReadings: Chapter 11, Chapter 12.1
-
Section 5.
Assignment 5.
due Feb 11
- 7
Feb 14
Hashing, Part IReadings: Chapter 15
Feb 16
Applied EthicsFeb 18
Hashing, Part II-
Section 6.
Assignment 6.
due Feb 18
- 8
Feb 21
No ClassFeb 23
Linked Lists, Part IReadings: Chapter 13
Feb 25
Linked Lists, Part II-
Section 7.
Assignment 7.
due Feb 25
- 9
Feb 28
Binary Search Trees, Part IReadings: Chapter 16.1 - 16.2
Mar 2
Binary Search Trees, Part IIReadings: Chapter 16.3 - 16.4
Mar 4
Beyond Data Structures-
Section 8.
Assignment 8.
due Mar 4
- 10
Mar 7
GraphsReadings: Chapter 18
Mar 9
Minimum Spanning TreesMar 11
Where to Go From Here-
Section 9.
Assignment 9.
due Mar 11