Design and Analysis of Algorithms Pdf Notes download – DAA VTU Notes Design and Analysis of Algorithms Pdf Notes download – DAA VTU Notes SUBJECT NAME : DESIGN AND ANALYSIS OF ALGORITHMS Module – I : Introduction, Performance Analysis, Asymptotic Notations, Important Problem Types & Fundamental Data Structures Module – II : Divide and Conquer & Decrease and Conquer Approach Module – III : Greedy Method, Minimum cost spanning trees, Optimal Tree problem & Transform and Conquer Approach Module – IV : Dynamic Programming, Transitive Closure & All-Pairs Shortest Paths Module – V : Backtracking, Branch and Bound, Knapsack problem & NP-Complete and NP-Hard problems