Lecture Notes On Design And Analysis Of Algorithms

Overview & Synopsis

This note covers the following topics, Design and analysis of algorithms, Growth of Functions, Recurrences, Solution of Recurrences by substitution, Recursion tree method, Master Method, Worst case analysis of merge sort, quick sort and binary search, Design and analysis of Divide and Conquer Algorithms, Heaps and Heap sort, Priority Queue, Lower Bounds for Sorting, Dynamic Programming algorithms, Matrix Chain Multiplication, Elements of Dynamic Programming, Longest Common Subsequence, Greedy Algorithms, Activity Selection Problem, Elements of Greedy Strategy, Fractional Knapsack Problem, Huffman Codes, Graph Algorithm BFS and DFS, Minimum Spanning Trees, Kruskal algorithm, Prims Algorithm, Fourier transforms and RabinKarp Algorithm.