CS 2604 Calendar - Fall 2000
This is a tentative schedule.
All dates and times are subject to change; such changes may be announced
in class, via email, or posted to the web. Students are responsible for
all information provided to them in these ways. This means that students
must regularly check the CS 2604 homepage for announcements, check their
email, and attend class.
| Lecture
Topic |
Reading
Assignment |
Projected Date |
|
Kruse |
Notes |
|
| Introduction & Review |
|
C00 |
Aug 21, 23 |
|
|
|
|
| Linear Structures |
|
|
|
|
General Lists |
C4: 112-126 |
|
Aug 25 |
|
Stacks |
C4: 127-140 |
C01 |
Aug 28 |
|
Queues |
|
|
Aug 28 |
|
|
|
|
| Algorithm Analysis |
|
|
|
|
Definitions and Examples |
|
C02 |
Aug 30, Sept 1 |
|
|
|
|
| Asymptotics |
|
|
|
|
Definitions and Theorems |
C7: 302-314 |
C03 |
Sept1, Sept 3 |
|
|
|
|
| Trees |
|
|
|
|
Binary Trees |
C10: 429-443 |
C04 |
|
|
BSTs |
C10: 444-472 |
C05 |
|
|
Balanced Trees |
C10: 473-514 |
C06 |
|
|
Heaps |
C8: 363-364 |
C07 |
|
|
|
|
|
| Sorting |
|
C08 |
|
|
Insertion Sort |
C8: 318-328 |
|
|
|
Theoretical Bounds |
C8: 336-338 |
|
|
|
Shell Sort |
C8: 333-335 |
|
|
|
HeapSort |
C8: 363-371 |
|
|
|
MergeSort |
C8: 344-351 |
|
|
|
QuickSort |
C8: 352-362 |
|
|
|
Radix Sort |
C9: 391-396 |
|
|
|
|
|
|
| Secondary Storage |
|
C09 |
|
|
Physical Characteristics |
|
|
|
|
Access Times |
|
|
|
|
Buffer Pools |
|
|
|
|
|
|
|
| Midterm Test |
|
|
|
|
|
|
|
| Indexing I |
|
Caa |
|
|
Linear Indices |
C9: 380-386 |
|
|
|
Hashing |
C9: 397-410 |
|
|
|
Inverted Files |
C9: 386-388 |
|
|
|
|
|
|
| External Sorting |
|
|
|
|
|
|
|
| Graphs |
|
Cbb |
|
|
Representation Schemes |
C12: 569-574 |
|
|
|
Traversal Algorithms |
C12: 575-582 |
|
|
|
Shortest Path |
C12: 583-586 |
|
|
|
Minimal Spanning Trees |
C12: 587-593 |
|
|
|
Prim's Algorithm |
|
|
|
|
Kruskal's Algorithm |
|
|
|
|
|
|
|
| Indexing II |
|
Ccc |
|
|
B trees |
C11: 535-555 |
|
|
|
B+ trees |
|
|
|
|
Red-Black Trees |
C11: 556-565 |
|
|
|
|
|
|
| Final Exam |
|
|
December 8 |