18CS42 MODULE 3 DESIGN AND ANALYSIS OF ALGORITHMS VTU NOTES

18CS42 DESIGN AND ANALYSIS OF ALGORITHMS VTU CBCS Notes Question Papers 18CS42 MODULE 3 DAA VTU NOTES by VTUguide.in.
Admin

Greedy Method: General method, Coin Change Problem, Knapsack Problem, Job sequencing with deadlines (T2:4.1, 4.3, 4.5). Minimum cost spanning trees: Prim‟s Algorithm, Kruskal‟s Algorithm (T1:9.1, 9.2). Single source shortest paths: Dijkstra's Algorithm (T1:9.3). Optimal Tree problem: Huffman Trees and Codes (T1:9.4). Transform and Conquer Approach: Heaps and Heap Sort (T1:6.4).


 
Udemy APAC