| 1 |
1 2 March Introduction. Some representative problems
2 9 March Stable Matching
3 16 March Basics of algorithm analysis.
4 23 March Graphs (Project 1 announced)
5 30 March Greedy algorithms-I
6 6 April Greedy algorithms-II (Project 2 announced)
7 13 April Divide and conquer
8 20 April PRESENTATIONS (Graphs, Greedy & Divide and Conquer)-Real life applications (1-minute video, voting)
9 27 April Dynamic Programming I
10 4 May Dynamic Programming II
11 11 May Network Flow-I
12 18 May Network Flow II (Project 3 announced)
13 25 May NP and computational intractability-I, II
14 1 June NP and computational intractability-I, II
15 8 June PRESENTATIONS (Dynamic Programming, Network Flow & NP)-Real life applications (1-minute video, voting) |