ABCDEFGHIJKLMNOPQRSTUVWXYZAA
1
 BTech - CSE 4th SemesterDesign and Analysis of Algorithms: Course Progress
2
Class NoDateTimeDurationReadingList / ResourcesContents Discussed
3
105/01/201802:15pm to 04:15pm2 hrsChapter 1 of Textbook T1Motivation and introduction
4
209/01/201810:15am to 12:15pm2hrs
Chapter 2 & 3of Textbook T1
Model of Computaiton, Asymptotic Notations, Examples
5
312/01/201802:15pm to 04:15pm2hrsChapter 4 of Textbook T1
(Better if you can refer 2nd
Edition)		Recurrence relation and Solution approach (Substitution, Recurrence tree method )
6
416/01/201810:15am to 12:15pm2hrsSection 2.3 of Textbook T1
(Continued in the next class)		Divide and Conquer: Genereal Structure, Merge sort (Problem Statement), Merge Procedure (example, complexity)
7
519/01/201802:15pm to 04:15pm2hrs
Exercise 2.1.3 and 2.3.5 of T1,
For Binary Search Tree
Chapter 12 of Textbook T1
Divide and Conquer: Merge sort (Algorithm, Example, Complexity), Binary Search (Algorithm, Example, Complexity)
8
623/01/201810:15am to 12:15pm2hrsChapter 7 of Textbook T1Divide and Conquer: Quick sort (Algorithm, Example, Best case, worst case and average case time complexity)
9
730/01/201810:15am to 12:15pm2hrsChapter 6 of Textbook T1Heap Sort, Building Blocks of Heap sort ( Heapify: Example, Analysis, Build heap: Example)
10
802/02/201802:15pm to 04:15pm2hrsChapter 6 of Textbook T1Heap sort Building Blocks: Build Heap ( Analysis), Heap sort ( Example, Analysis); Element of Dynamic Programming,
MCM- Problem Statement
11
906/02/201810:15am to 12:15pm2hrsChapter 15 of Textbook T1Dynamic Programming: Matrix Chain Multiplication: Problem Statement, Idea, Algorithm, Analysis, Example
12
1013/02/201810:15am to 12:15pm2hrsChapter 4 of Textbook T1Master Theorem for solving recurrences, Lower bound for sorting
13
1127/02/201802:15pm to 04:15pm2hrsChapter 15 of Textbook T1Dynamic Programming: Longest Common Subsequence (LCS) : Problem Description, Algorithm Idea development,
Algorithm, Example
14
1206/03/201810:15am to 12:15pm2hrsChapter 16 of Textbook T1Greedy Approach: Knapsack Problem ( Greedy Vs Dynamic Programming ), Greedy solution
Elements of greedy strategy
15
1309/03/201802:15pm to 04:15pm2hrsChapter 15 of Textbook T1GreedyApproach: Huffman Coding ( Example, algorithm idea, complexity ),
Activity Selection problem ( Dynamic Programming Solution approach formulation, complexity)
16
1413/03/201810:15am to 12:15pm2hrs[ Class Note ] => [ Link ]Greedy Approach: Activity Selection (Greedy Algorithm solution, complexity ), Graphs and their representations
17
1516/03/201802:15pm to 04:15pm2hrsChapter 21 of Textbook T1Disjoint set data structure (Definition, Basic Operations, Implementation, complexities), Application to find the connected component
18
1623/03/201802:15pm to 04:15pm2hrsChapter 22 of Textbook T1Graph Traversal (Basic Idea), Breadth First Search (BFS) : Idea, algorithm, Complexity, Example
19
1726/03/201802:15pm to 04:15pm2hrsChapter 22 and 23 of Text-
book T1		Depth First Search (DFS): Idea, Algorithm, Complexity, Example, MST(Kruskal's algo): Idea, Algorithm, Complexity, Example
20
1802/04/201802:15pm to 04:15pm2hrsChapter 23 and 24 of Text-
book T1 		MST(Prim's Algo): Idea, Algorithm, Complexity, Example, Single source shortest path (Dijkstras Algorithm): Idea, algorithm, complexity
analysis, example
21
1903/04/201810:15am to 12:15pm2hrsChapter 24 and 25 of
Textbook T1		SIngle source shortest path (Bellman-Ford Algorithm): Idea, algorithm, complexity analysis, example;
All pair shortest path (Floyd-Marshall Algo): Idea, algorithm, complexity analysis, example
22
2005/04/20183:15pm to 5:15pm2hrsChapter 32 of Textbook T1
Chapter 34 of Textbook T1		String matching algorithm (Rabin-Karp Method: Basic idea, Mathematical background, Algorithm, example); P, NP, NP-Complete (Definition,
reduction, NP complete problems)
23
2109/04/201802:15pm to 04:15pm2hrsChapter 35 of Textbook T1Handling NP complete problems: idea of approximation algorithms. 2- Approximation Algorithms (Vertex cover , TSP)
24
2210/04/201810:15am to 12:15pm2hrsChapter 30 of Textbook T1Polynomials and FFT ( Basic Idea, prerequisites, Algorithm, complexity Analysis)
25
44hrs
26
COURSE COMPLETED on 10th April 2018
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100