CS 127: Data Structures, Fall 2004 |
|
||||
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/13 |
Introduction |
|
|
2 |
Wednesday |
9/15 |
Inheritance, interfaces, graphical programming |
Chapter 1.4, Chapters 3.1-3.4 |
|
3 |
Friday |
9/17 |
Inheritance, interfaces, graphical programming, efficiency of algorithms |
Chapters 3.1-3.4, Chapter 2.8 |
|
4 |
Monday |
9/20 |
Efficiency of algorithms |
Chapter 2.8 |
|
5 |
Wednesday |
9/22 |
Efficiency of algorithms, lists |
Chapter 2.8, Chapter 4 |
|
6 |
Friday |
9/24 |
Lists |
Chapter 4 |
|
7 |
Monday |
9/27 |
Lists |
Chapter 4 |
|
8 |
Wednesday |
9/29 |
Stacks |
Chapters 5 |
|
9 |
Friday |
10/1 |
Queues |
Chapter 6 |
|
10 |
Monday |
10/4 |
Recursion / searching |
Chapter 7 |
|
11 |
Wednesday |
10/6 |
Searching / backtracking |
Chapter 7 |
|
12 |
Friday |
10/8 |
Lab: using a debugger |
|
|
13 |
Monday |
10/11 |
Slack / Review / Sets and maps |
Chapters 9.1-9.2 |
|
14 |
Wednesday |
10/13 |
Exam 1 |
|
|
15 |
Friday |
10/15 |
Trees and traversal |
Chapters 8.1-8.2 |
|
|
Monday |
10/18 |
BREAK |
|
|
16 |
Wednesday |
10/20 |
Binary search trees |
Chapter 8.3-8.4 |
|
17 |
Friday |
10/22 |
Heaps and priority queues |
Chapter 8.5 |
|
18 |
Monday |
10/25 |
Hash tables |
Chapters 9.3-9.4 |
|
19 |
Wednesday |
10/27 |
Hash tables |
Chapters 9.3-9.4 |
|
20 |
Friday |
10/29 |
Hash tables, sorting |
Chapter 10 |
|
21 |
Monday |
11/1 |
Sorting |
Chapter 10 |
|
22 |
Wednesday |
11/3 |
Sorting |
Chapter 10 |
|
23 |
Friday |
11/5 |
Sorting |
Chapter 10 |
|
24 |
Monday |
11/8 |
AVL Trees |
Chapter 11.1-11.2 |
|
25 |
Wednesday |
11/10 |
Graphs |
Chapters 12.1-12.2 |
|
26 |
Friday |
11/12 |
Implementing graphs |
Chapter 12.3 |
|
27 |
Monday |
11/15 |
Traversing graphs |
Chapter 12.4 |
|
28 |
Wednesday |
11/17 |
Exam 2 |
|
|
Project due |
Monday |
11/22 |
Final project due at 5 pm |
|
|