CS 2604 Calendar -- Fall 2004

Note:  This is a tentative schedule.  Topics and dates are subject to change.

Topic
Drozdek Course Notes
Estimated Date




Introduction and Review
1.1 - 1.9
Math Review
Aug 24 - 26




Linear Structures



General Lists
3.1 - 3.3
Linear Structures
Aug 26 - 31
Stacks and Queues
4.1 - 4.3
Linear Structures
Aug 31 - Sep 2
Skip Lists
3.4
Skip Lists
Sep 2




Algorithm Analysis

Algorithm Analysis Sep 7
Asymptotics
2.1 - 2.8
Asymptotics
Sep 9




Binary Trees



Binary Trees
6.1 - 6.2
Binary Trees
Sep 14
BSTs
6.3 - 6.6
Binary Search Trees
Sep 14 - 16
Balanced Trees (splaying)
6.8

Sep 16
AVL Trees
6.7.2
AVL Trees
Sep 21




Midterm Exam -- In-Class, September 23




Heaps
6.9
Heaps
Sep 28




Sorting I

Sorting

Insertion Sort
9.1

Sep 30
Theortical Bounds
9.2

Sep 30
Shell Sort
9.3.1

Oct 5
HeapSort
9.3.2

Oct 5 - 7




Secondary Storage

Secondary Storage

Physical Characteristics


Oct 7
Access Times


Oct 12
Buffer Pools


Oct 12 - 14
Binary File I/O

Binary File I/O
Oct 14 - 19
External Sorting

External Sorting
Oct 19




Sorting II

Sorting

MergeSort
9.3.4
Oct 21
QuickSort
9.3.3

Oct 26
RadixSort
9.3.5

Oct 28




Indexing



Linear Indices
3.6

Nov 2
Hashing
10.1 - 10.4
Hashing
Nov 4
B Trees
7.1.1
Tree Indexing Nov 9
B+ Trees
7.1.3 Tree Indexing Nov 9 - 11
Red-Black Trees

Tree Indexing Nov 11




General Trees

General Trees
Nov 16
Graphs

Graphs

Representation Schemes
8.1

Nov 18
Traversal Algorithms
8.2

Nov 30
Shortest Path
8.3

Dec 2
Minimal Spanning Trees
8.5.2

Dec 2




Review / Last Day of Class


Dec 7




Final Exam, Room TBA, December 13, 7:00pm - 9:00pm






Main/Announcements  |  Quizzes  |  Homeworks  |  Programming Projects  |  Calendar/Notes  |  Koofers