Week |
Day |
Topic(s) |
Readings |
Comments |
Quizzes |
Week 1 |
03/13/2017 |
Introduction & Course Logistics |
1.1, 1.2, page 40 |
||
03/14/2017 |
Cancelled (Weather Condition) |
||||
03/16/2017 |
Representative Problems in Sorting and Searching | 2.1 & 9.1 |
|||
03/17/2017 |
Introduction to Algorithm Analysis | 2.2 |
|||
Week 2 |
03/20/2017 |
Order of Growth: Big O, Omega Ω, and Theta Θ | 3.1 |
|
|
03/21/2017 |
Divide and Conquer, Merge sort, Quick sort | 2.3, 4.0 |
Quiz 1 | ||
03/23/2017 |
Recurrences and Master Theorem | 4.3, 4.4 |
|
||
03/24/2017 |
Quick sort -Part 2 | 7.1, 7.2 |
|
||
Week 3 |
03/27/2017 |
Summary on Recurrences, Heapsort & Priority Queues | 6.1--> 6.5 | ||
03/28/2017 |
Priority Queues, Binary Search Trees |
12.1 --> 12.3 |
|||
03/30/2017 |
BST-part2 |
12.1 --> 12.3 | Quiz 2 | ||
03/31/2017 |
Revision for Midterm exam |
||||
Week 4 |
04/03/2017 |
Midterm I |
|||
04/04/2017 |
Greedy Algorithms -- Part 1(Activity-Selection) |
16.1, 16.2 |
|||
04/06/2017 |
Greedy Algorithms -- Part 2 (Huffman Coding) | 16.3 |
|||
04/07/2017 |
Graph Algorithms I: Structures & Breadth First Search (BFS) |
22.1, 22.2 |
|||
Week 5 |
04/10/2017 |
Graph Algorithms II: Depth First Search (DFS) & Applications of BFS and DFS | 22.3, 22.4 |
||
04/11/2017 |
Graph Algorithms III: Minimum Spanning Trees | 23, 23.2 |
Quiz 3 | ||
04/13/2017 |
Graph Algorithms IV: Topological Sorting | ||||
04/14/2017 |
Revision for Midterm exam | ||||
Week 6 |
04/17/2017 |
Break (Patriots Day) |
|||
04/18/2017 |
Midterm II
|
||||
04/20/2017 |
Break (Project Presentation Day) |
||||
04/21/2017 |
Graphs: Shortest Path |
24, 24.2, 24.3 | |||
Week 7 |
04/24/2017 |
Cancelled (Instcutor on travel) |
|||
04/25/2017 |
Dynamic Programming -- Part 1 (By Prof. Dan Dougherty) |
15.3, 15.4 |
|||
04/27/2017 |
Dynamic Programming -- Part 2 | ||||
04/28/2017 |
Revision for Final exam | ||||
Week
8 |
05/01/2017 |
Final Exam |
|||
05/02/2017 |
No Lecture (Enjoy Summer) |