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