Design and Analysis of Algorithms

Sem-4
S.No File Name Open
1 L1_Welcome Lecture.pdf View
2 L2- Complexity.pdf View
3 L3_Recurrance Relations and Master Theorem.pdf View
4 L4_DIVIDE AND CONQUER.pdf View
5 L5_Matrix Multiplication.pdf View
6 L6_Large_number_multi.pdf View
7 L7_Bucket and Radix.pdf View
8 L8_Max-Min_Median problem.pdf View
9 L9 Greedy, Knapsack.pdf View
10 L10 Minimum Spanning trees, Prims Algorithm.pdf View
11 L11 Dsjt Set Kruskals.pdf View
12 L12 Kruskals, Dijkstra.pdf View
13 L13_Dijkastra Algorithms.pdf View
14 L14_Huffman code.pdf View
15 L15_DFS_bi-connectivity.pdf View
16 L16_Articulation Point.pdf View
17 L17_dynamic Programming.pdf View
18 L18_Backtracking.pdf View
19 L19_Max Flow Min Cut.pdf View
20 L20_complexity ClassesP_NP.pdf View