|
|
Disclaimer: This schedule is is just a loose approximation. Only two promises: We'll announce changes in class and keep the Web as up-to-date as possible. Check back often for updates.
|
|
|
|
|
|
16 · First day of classes
· Intro
|
17· OO Methodology
|
18· Java By Comparison
|
19· Vectors and Wrappers
|
20· Recitation
|
|
21· No class (Kesden at faculty retreat)
|
22· Singly Linked Lists
|
25· Doubly linked lists
|
26· Queues and Stacks
|
27· Applications of Stacks
|
|
30· Memorial Day (No class)
|
|
|
|
|
|
|
|
|
|
|
|
|
1· Exam #1
|
2· Recursion
· Recursion removal
|
3· Recursive problem solving
|
4· Sorting
|
|
7· Alg. Analysis
· Big-O
|
8· Trees
· Heaps
|
9· Binary Search Trees (BSTs)
|
10· Applications of BSTs
|
11· Expression trees
· Traversals
· Pre,Post,In,Level
|
|
14· Graphs
· Adj. List
· Adj. Matrix
|
15· Exam 2
|
16· Spanning Trees
· Breadth-first search (BFS)
· Depth-first search (DFS)
|
17· Minimum spanning trees
· Prim's Alg.
· Krusgal's Alg
|
18· Unweighted shortest path
· Dijkstra's Alg.
· Union-Find
· Topological sort
|
|
21· Bucket Sort
· Open address hashing
· Closed address hashing
· Collision resolution
|
22· Applications of hashing
|
23· Exam 3
|
24· Review
· FCEs
|
25· Final Exam
|
|
28 |
29· Grades due
|
30 |
|
|