Date |
Assignment |
Reading |
Subject |
Jan. 28 |
|
|
Administrivia, syllabus, textbook, software, program
standards,... |
Jan. 30 |
HW1 |
A1-A40 |
C++ review |
Feb. 4 |
|
A40-A74 |
C++ review |
Feb. 6 |
|
pp. 3-25 |
Software engineering, record-keeping, and
abstraction |
Feb. 8 |
Deadline to add courses |
Feb. 11 |
HW1 due |
pp. 25-47 |
Modularity, modifiability, usability, fail-safety,
style, debugging |
Feb. 13 |
HW2 |
pp. 53-77 |
Recursion |
Feb. 18 |
|
pp. 78-103 |
More recursion |
Feb. 20 |
|
pp. 112-131 |
Abstract data types |
Feb. 22 |
Deadline to drop
courses |
Feb. 25 |
HW2 due; HW3 |
pp. 131-157 |
Interface vs. implementation |
Feb. 27 |
|
pp. 163-172 |
Pointers and addresses |
Mar. 4 |
|
|
Pointers and dynamic allocation |
Mar. 6 |
|
|
Pointers and arrays |
Mar. 11 |
HW3 due; HW4 |
pp. 376-396 |
Inheritance and polymorphism |
Mar. 13 |
|
|
Programming with polymorphism |
Mar. 18 |
|
pp. 172-195 |
Pointer-based linked lists |
Mar. 20 |
HW5 |
pp. 195-206 |
More on pointer-based linked lists |
Mar. 25-29 |
Spring break: no
classes |
Apr. 1 |
|
pp. 206-218 |
Variations on pointer-based linked lists |
Apr. 1 |
Deadline to withdraw from
courses |
Apr. 3 |
HW4 due |
Coding exercise: versions 1-5 |
Coding, if-else, struct, print method, askUser method |
Apr. 8 |
|
Coding exercise: versions 6, 7, 7-1/4, 7-1/2 |
overloading << operator, array of structs, array of pointers to structs, constructor |
Apr. 10 |
HW5 due |
Coding exercise: versions 7-1/2, 7-3/4, 8, 9 |
constructor, pseudo-constructor, olderThan method, private instance variables |
Apr. 15 |
|
Coding exercise: versions 9-10 |
private instance vars, access methods, PersonList |
Apr. 17 |
|
Coding exercise: versions 10-12 |
PersonList, variable-sized arrays |
Apr. 19 |
HW2 re-work due |
Apr. 22 |
HW3 re-work due; HW6 |
pp. 218-223 |
The Standard Template Library and iterators |
Apr. 24 |
|
pp. 238-243 |
Backtracking and recursion |
Apr. 26 |
HW4 re-work due |
Apr. 29 |
HW5 re-work due |
pp. 273-283, 331-335 |
Stacks and Queues |
May 1 |
|
pp. 433-445 |
What is Efficiency? Analysis of Algorithms |
May 6 |
HW6 due |
pp. 445-474 |
Sorting Algorithms |
May 8 |
|
|
Catch up and review |
May 13 |
Final exam, 3:30-5:30 |