Week # Lecture #s Descriptions
Handouts/Homework
| 15 | - 28
- 27
- Final Review
- Exam Review and New Material
| 14 | - xx
- 26
- NO CLASS
- Exam #3
- NO CLASS
- Exam #3
| 13 | - 25
- 24
- Review
- Pattern Matching
- Exam Review
- HW Due, 11.2 (pseudocode), 11.5, 11.6, 11.7,
11.10, 11.15
| 12 | - 23
- 22
- Pattern Matching
- No class - Ramsey out sick
- HW #4
- No class - Ramsey out sick
| 11 | - 21
- 20
- Exam Review
- Exam 2
- For extra credit on exam #2: implement Exam2, problem #9 dynamically
- Exam 2 (New Material begins on Class 11, section 8.3)
| 10 | - 19
- 18
- Exam Review
- Words into Lines - Dynamic Programming
- Exam Review
- Project Due Today!, 10.5 (471-474)
| 9 | - 17
- 16
- Dynamic Programming, All Pairs Shortest Paths
- Recursion, Dynamic Programming
- 9.4 (433-435)
- 10.1, 10.2 (456-457), 10.6 (474-475)
| 8 | - xx
- 15
- Break
- Reachability Matrix, Warshall's
- Break
- 9.3 (430-433)
| 7 | - 14
- 13
- Transitive Closure, Reachability
- MST Review
- 9.1,9.2 (425-430)
- HW #3... Data Files Instructions - same as last time, but now with graphxx.txt files
| 6 | - 12
- 11
- Exam #1
- Kruskal, Dijkstra, Review
-
- 8.3 (403-411)
| 5 | - 10
- 9
- Minimum Spannnig Trees, Prim's Algorithm, Kruskal's
- Topological Ordering, Critical Path
- 8.1,8.2,8.4 (387-492,412-415)
- 7.4 (351-357)
| 4 | - 8
- 7
- Depth First Search, Topological Ordering
- Graphs - Definitions, DFS, BFS
- 7.4 (336-354)
- 7.1-7.4 (313-350,364-365)
| 3 | - 6
- 5
- Assignment
- Radix Sort, Assignment
- HW#2
- 4.11 (201-220) HW #2... Data Files Instructions
| 2 | - 4
- 3
- Mergesort, Heapsort, Shell Sort
- Insertion (and Selection), Divide/Conquer, Quicksort
- 4.5-4.10 (171-200)
- 4.1-4.4 (150-170)
| 1 | - 2
- 1
- Searching, Sorting - Implementation
- Analysis of Algorithms. Big Oh, Theta, Omega. Avg vs. Worst
- (Chapter 1) 1.24, 1.25, 1.27, 1.36, 1.41, 1.43 (whole page)
- Syllabus
| |
|
| |
|
| |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | |
| | | | | | | | | | | | | | | |