| Wk |
Day |
Date |
Required
Reading,
Childs |
Reading
Quiz |
Lecture Topics
(MW 7:00-9:50pm) |
Assignments |
Points |
| 1 |
M
W
Su |
23-Jan
25-Jan
29-Jan |
Ch.1 |
Quiz 1* |
0. C++ Basics
1. Structs and Classes |
|
3* |
| 2 |
M
W
Su |
30-Jan
1-Feb
5-Feb |
Ch.2 |
Quiz 2* |
2. Overloaded Operators
Templates and Abstraction |
Lab 1 due |
6*
50 |
| 3 |
M
W
Su |
6-Feb
8-Feb
12-Feb |
Ch.3 |
Quiz 3 |
3. The const Modifier
Constructors |
Lab 2 due |
6
50 |
| 4 |
M
W
Su |
13-Feb
15-Feb
19-Feb |
Ch.4
Ch.5 |
Quiz 4
Quiz 5 |
4. Dynamic Arrays
5/6. An Array Class |
Lab 3 due |
6
6
50 |
| 5 |
M
W
Su |
20-Feb
22-Feb
26-Feb |
Ch.6.1 |
Quiz 6 |
H O L I D A Y
5/6. An Array Class (cont) |
Lab 4 due |
4
50 |
| 6 |
M
W
Su |
27-Feb
29-Feb
4-Mar |
Ch.7 |
Quiz 7 |
7. Storing Data in Data Structures" |
Lab 5 due |
4
50 |
| 7 |
M
W
Su |
5-Mar
7-Mar
11-Mar |
Ch.8 |
Quiz 8 |
8. Stacks and Queues" |
Lab 6 due |
6
50 |
| 8 |
M
W
Su |
12-Mar
14-Mar
18-Mar |
Ch.9 |
Quiz 9 |
9. Big Oh and Algorithm Efficiency" |
Lab 7 due |
7
50 |
| 9 |
M
W
Su |
19-Mar
21-Mar
25-Mar |
Ch.10 |
Quiz 10 |
Midterm Exam topics 1-9
10. Linked List Implementations |
Lab 8 due |
50
8
50 |
| 10 |
M
W
Su |
26-Mar
28-Mar
1-Apr |
Ch.11 |
Quiz 11 |
11. Hash Tables and Maps" |
Lab 9 due |
8
50 |
| 11 |
M
W |
2-Apr
4-Apr |
|
|
H O L I D A Y
H O L I D A Y |
|
|
| 12 |
M
W
Su |
9-Apr
11-Apr
15-Apr |
|
|
11. Hash Tables and Maps (cont)" |
Lab 10 due |
50 |
| 13 |
M
W
Su |
16-Apr
18-Apr
22-Apr |
Ch.12 |
Quiz 12 |
12. Priority Queues
Trees and Heaps |
Lab 11 due |
8
50 |
| 14 |
M
W
Su |
23-Apr
25-Apr
29-Apr |
Ch.13
Ch.14 |
Quiz 13
Quiz 14 |
13. Recursion
14. Sorting Algorithms |
Lab 12 due |
8
8
50 |
| 15 |
M
W
Su |
30-Apr
2-May
6-May |
|
|
"" |
Lab 13 due |
50 |
| 16 |
M
W
Su |
7-May
9-May
13-May |
Ch.15.1-2 |
Quiz 15 |
15. Trees" |
Lab 14 due |
8
50 |
| 17 |
M
W
Su |
14-May
16-May
20-May |
Ch.15.3-4 |
Quiz 16 |
Graphs" |
Lab 15 due |
4
50 |
| 18 |
M
W
Th |
21-May
23-May
24-May |
|
|
Final Exam (7-9pm)
Free lab period
All Late Work Due (noon) |
Project due |
50 + 50 |