Sep. |
5 |
Introduction |
|
|
7 |
Data Structures and Algorithms (Chapter 1)
|
|
|
12 |
Mathematical Preliminaries (Chapter 2)
|
|
|
14 |
Mathematical Preliminaries 2 (Chapter 2)
|
Homework 1 out |
|
19 |
Algorithm Analysis (Chapter 3)
|
|
|
21 |
Algorithm Analysis 2 (Chapter 3)
|
Homework 2 out |
|
26 |
Lists, Stacks, and Queues (Chapter 4)
|
|
|
28 |
Lists, Stacks, and Queues 2 (Chapter 4)
|
Programming 1 out |
Oct. |
3 |
Lists, Stacks, and Queues 3 (Chapter 4): use last lecture's slide
|
Homework 3 out |
|
5 |
Binary Trees (Chapter 5)
|
|
|
10 |
Binary Trees 2 (Chapter 5)
|
Programming 2 out |
|
12 |
Binary Trees 3 (Chapter 5)
|
|
|
17 |
Binary Trees 4 (Chapter 5)
|
Homework 4 out |
|
19 |
Non-Binary Trees (Chapter 6)
|
|
|
24,26 |
Midterm
|
|
|
31 |
Non-Binary Trees 2 (Chapter 6)
|
Homework 5 out; Programming 3 out |
Nov. |
2 |
Internal Sorting (Chapter 7)
|
|
|
7 |
Internal Sorting 2 (Chapter 7)
|
|
|
9 |
Internal Sorting 3 (Chapter 7)
|
|
|
14 |
Internal Sorting 4 (Chapter 7)
|
Homework 6 out; Programming 4 out |
|
16 |
Searching (Chapter 9)
|
|
|
21 |
Searching 2 (Chapter 9)
|
|
|
23 |
Searching 3 (Chapter 9)
|
Homework 7 out |
|
28 |
Graphs (Chapter 11)
|
Programming 5 out |
|
30 |
Graphs 2 (Chapter 11)
|
|
Dec. |
5 |
Graphs 3 (Chapter 11)
|
Homework 8 out |
|
7 |
Conclusion
|
|
|
12, 14 |
Final
|
|