A tentative calendar of lecture topics, textbook readings, and exam times follows. Note
that it is subject to change, and all changes will be made available here. Only the most
earth-shaking changes will also be announced in lecture and/or section.
Numbers in parentheses indicate the chapters/sections of the required textbook that are
relevant to the lecture material. Students are expected to have read the textbook before
attending class.
| Week # |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
| 1 |
March 30: Overview,
Intro to C++ (1.1-1.5, Appendix B) |
|
April 1: Streams
(Appendix C) |
|
April 3: Modules (Ch
2) |
| 2 |
April 6: Data
Abstraction (1.1-1.5) and Intro. to Classes (3.1-3.2) |
|
April 8: Data
Abstraction: Class Constructors (3.3) |
HW#1 due Quiz #1 |
April 10: Data
Abstraction: Overloading (3.6) |
| 3 |
April 13: ADTs:
Arrays, Records, Lists (4.1-4.4) |
|
April 15: ADTs: Stacks
and Queues (4.5-4.6) |
|
April 17: Dynamic
Memory (Ch 7) |
| 4 |
April 20: Dynamic
Memory |
|
April 22: Dynamic
Memory |
HW#2 due |
April 24: MIDTERM
EXAM #1 |
| 5 |
April 27: Recursion
(Ch 6) |
|
April 29: Linked Lists
(Ch 8) |
|
May 1: Linked Lists |
| 6 |
May 4: Linked Lists |
|
May 6: OO Design (Ch
10,11) |
HW#3 due |
May 8: OO Design |
| 7 |
May 11: OO Design |
|
May 13: Algorithm
Efficiency (Ch12.1-12.3, 12.5) |
|
May 15: MIDTERM
EXAM #2 |
| 8 |
May 18: Algorithm
Efficiency |
|
May 20: Searching and
Sorting (Ch 12.4,12.7-12.9) |
HW#4 due |
May 22: Searching and
Sorting |
| 9 |
May 25: No classes (Memorial Day) |
|
May 27: Trees (Ch 13) |
|
May 29: Trees |
| 10 |
June 1: Trees |
|
June 3: Hashing (Ch
12.6) |
HW#5 due |
June 5 (Last day of classes):
Special Topics |
| 11 |
|
TUESDAY
June 9 FINAL EXAM
2:30 pm |
|
|
|