|
CS 127: Data Structures |
|
||||
|
Schedule: Subject To Change |
|
||||
|
|
|||||
|
This schedule is optimistic (aggressive?). It will likely slip throughout the term. |
|
||||
|
|
|||||
|
Day of Term |
Day of Week |
Date |
Topics |
Readings in Koffman & Wolfgang |
|
|
1 |
Monday |
9/12 |
Introduction |
Chapter 1.2 |
|
|
2 |
Wednesday |
9/14 |
Inheritance, interfaces, graphical programming |
Chapter 1.3, Chapters 3.1-3.4 |
|
|
3 |
Friday |
9/16 |
Inheritance, interfaces, graphical programming, efficiency of algorithms |
Chapters 3.1-3.4, Chapter 2.8 |
|
|
4 |
Monday |
9/19 |
Efficiency of algorithms |
Chapter 2.8 |
|
|
5 |
Wednesday |
9/21 |
Efficiency of algorithms, lists |
Chapter 2.8, Chapter 4 |
|
|
6 |
Friday |
9/23 |
Lists |
Chapter 4 |
|
|
7 |
Monday |
9/26 |
Lists |
Chapter 4 |
|
|
8 |
Wednesday |
9/28 |
Stacks |
Chapter 5 |
|
|
9 |
Friday |
9/30 |
Queues |
Chapter 6 |
|
|
10 |
Monday |
10/3 |
Recursion / searching |
Chapter 7 |
|
|
11 |
Wednesday |
10/5 |
Searching / backtracking |
Chapter 7 |
|
|
12 |
Friday |
10/7 |
Lab: using a debugger |
Chapters 2.5-2.7 |
|
|
13 |
Monday |
10/10 |
Slack / Review / Sets and maps |
Chapters 9.1-9.2 |
|
|
14 |
Wednesday |
10/12 |
Exam 1 |
|
|
|
15 |
Friday |
10/14 |
Trees and traversal |
Chapters 8.1-8.2 |
|
|
|
Monday |
10/17 |
BREAK |
|
|
|
16 |
Wednesday |
10/19 |
Binary search trees |
Chapters 8.3-8.4 |
|
|
17 |
Friday |
10/21 |
Heaps and priority queues |
Chapter 8.5 |
|
|
18 |
Monday |
10/24 |
Hash tables |
Chapters 9.3-9.4 |
|
|
19 |
Wednesday |
10/26 |
Hash tables |
Chapters 9.3-9.4 |
|
|
20 |
Friday |
10/28 |
Hash tables, sorting |
Chapter 10 |
|
|
21 |
Monday |
10/31 |
Sorting |
Chapter 10 |
|
|
22 |
Wednesday |
11/2 |
Sorting |
Chapter 10 |
|
|
23 |
Friday |
11/4 |
Sorting |
Chapter 10 |
|
|
24 |
Monday |
11/7 |
AVL Trees |
Chapters 11.1-11.2 |
|
|
25 |
Wednesday |
11/9 |
Graphs |
Chapters 12.1-12.2 |
|
|
26 |
Friday |
11/11 |
Implementing graphs |
Chapter 12.3 |
|
|
27 |
Monday |
11/14 |
Traversing graphs |
Chapter 12.4 |
|
|
28 |
Wednesday |
11/16 |
Exam 2 |
|
|
|
Assignment due |
Monday |
11/21 |
Final assignment due at 5 pm |
|
|
Possible additional topics if time:
Huffman trees� (chapter 8.6)
B-trees (chapter 11.5)
graph algorithms (chapters 12.5-12.6)