Engineering / College · Algorithms

Design and Analysis of Algorithms Notes – Sorting, Divide and Conquer, Greedy and Dynamic Programming

• PDF · 130 KB
• 0 downloads
• English

Design and Analysis of Algorithms notes for 4th semester B.Tech CSE. Explains asymptotic analysis, solving recurrences with the Master theorem, sorting algorithms with their complexities, divide and conquer, greedy algorithms such as activity selection, Huffman coding and minimum spanning trees, dynamic programming with knapsack and longest common subsequence, graph algorithms including BFS, DFS, Dijkstra and Bellman-Ford, and an introduction to P, NP and NP-complete problems, with practice questions.