Week |
Day |
Topic(s) |
Readings |
Comments |
Quizzes |
Week 1 |
03/11/2013 |
Introduction & Course Logistics |
1.1, 1.2, page 40 |
||
03/12/2013 |
Representative Problems in Sorting and Searching |
2.1, 9.1 |
|||
03/14/2013 |
Introduction to Algorithm Analysis |
2.2 |
|||
03/15/2013 |
Called Off (Instructor out of town) |
||||
Week 2 |
03/18/2013 |
Order of Growth: Big O, Omega Ω, and Theta Θ | 3.1 |
|
|
03/19/2013 |
Divide and Conquer, Merge sort, Quick sort | 2.3, 4.0 |
|||
03/21/2013 |
Recurrences and Master Theorem | 4.3, 4.4 |
|
||
03/22/2013 |
Quick sort -Part 2 | 7.1, 7.2 |
|
||
Week 3 |
03/25/2013 |
Summary on Recurrences, Heapsort & Priority Queues | 6.1--> 6.5 | ||
03/26/2013 |
Priority Queues, Binary Search Trees |
12.1 --> 12.3 |
Quiz 1 | ||
03/28/2013 |
BST-part2 |
12.1 --> 12.3 | |||
03/29/2013 |
Revision for Midterm exam |
||||
Week 4 |
04/01/2013 |
Midterm I |
|||
04/02/2013 |
Greedy Algorithms -- Part 1(Activity-Selection) |
16.1, 16.2 |
|||
04/04/2013 |
Greedy Algorithms -- Part 2 (Huffman Coding) | 16.3 |
|||
04/05/2013 |
Graph Algorithms I: Structures & Breadth First Search (BFS) |
22.1, 22.2 |
|||
Week 5 |
04/08/2013 |
Graph Algorithms II: Depth First Search (DFS) & Applications of BFS and DFS | 22.3, 22.4 |
||
04/09/2013 |
Graph Algorithms III: Minimum Spanning Trees | 23, 23.2 |
|||
04/11/2013 |
Graph Algorithms IV: Shortest Path | 24, 24.2, 24.3 |
Quiz 2 | ||
04/12/2013 |
Revision for Midterm exam | ||||
Week 6 |
04/15/2013 |
Break (Patriots Day) |
|||
04/16/2013 |
Midterm II | ||||
04/18/2013 |
Break (Project Presentation Day) |
||||
04/19/2013 |
Dynamic Programming -- Part 1 |
15.1 |
|||
Week 7 |
04/22/2013 |
Dynamic Programming -- Part 2 | 15.3 |
||
04/23/2013 |
Hash Tables |
15.4, 11.1-->11.3 |
|||
04/25/2013 |
NP Problem |
34.1, 34.2 |
Quiz 3 |
||
04/26/2031 |
Revision for Final exam | ||||
Week
8 |
04/29/2013 |
Final Exam |
|||
04/30/2013 |