IMPORTANT NOTE: The following schedule represents my current best guess concerning due dates (and everything else). I am providing this information to give you a general idea of the pace and timing of the class. THESE DATES MAY CHANGE. Please don't depend on this schedule in purchasing airline tickets or making other irrevocable scheduling decisions without consulting me first.

Refresh this page often as it changes often.


DAY CLASS READING Assign. Out Assign. Due
M1 Introduction, Syllabus, review Appendix A and B Chapter 1 HW0
HW1

W1 Algorithms, Complexity, Efficiency HW2
F1 Finish Chapter 1 CH 2.1-2.2 HW0, HW1
M2 No Class (MLK Day)
W2 Insertion Sort Chapter 2.1
Invariants Handout
HW3 HW1
F2 Merge Sort Chapter 2.2 and 2.3 Project 1
MiniLab 1
HW 3 HW2
M3 TBA


W3 Asymptotic Notation Chapter 3
HW3 (new)
F3 Solving recurrences by substitution


M4 Master Theorem for Recurrences CH 4 HW 4
HW 2
W4 Finish:
Master Theorem
Substitution
Sample Exam 1
Key
topics
F4 Heap Sort
Quick Sort
CH 6
Ch 7

M5 Quick Sort
PARTITION
Chapter 7
HW5

W5 Quick Sort
Midterm Review



F5 No class - Mid quarter break

M6 In class Midterm

HW4 due
W6 Greedy Algorithms
Optimality Revisited
Chapter 16.1 and 16.2 MiniLab 2 Change Machine HW5
F6 Huffman Codes Chapter 16.3

M7 Dynamic Programming
Rod Cutting
Chapter 15.1 and 15.3 MiniLab 3
W7 Longest Common Subsequence Chapter 15.4 MiniLab 4 MiniLab2
F7 Fractional Knapsack
0/1 Knapsack
Knapsack Problem Knapsack Project 2
M8 Knapsack revisited
LCS revisited

HW 6
MiniLab3
W8 Graph Algorithms and Computers
Exam II review
MiniLab3 HW7
F8 Exam II
M9 Graph Theory and Algorithms Project 3
MiniLab4
W9 Storing graphs
BFS
Spanning Trees


HW6
F9 DFS
Topological Sorts

Chapter 22.1-22.4

HW7
M10 Minimum Spanning Trees
(Prim's and Kruscal's)
Shortest Paths(Dijkstra and Bellman-Ford)
Chapter 23 and 24

W10 Time Complexity
P, co-P, NP, co-NP, NP-hard, NPC

F10 Review for Final Course Review
All work due
S11 11:30 am to 2:00 pm
Final Exam