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