Notes for Analysis and Design of Algorithms - DAA by Verified Writer

Introduction to Analysis and Design of Algorithm

Growth of Functions, Asymptotic Notations

Recurrences, Solution of recurrences by substitution, Recurrence tree and the master method

Divide and conquer algorithms, Worst case analysis of merge sort, quick sort algorithm, heap sort algorithms,

Priority queue, Data Structure for Disjoint Sets, Disjoint set operations, linked list representation, disjoint set forests

Dynamic Programming Approach, Matrix chain multiplication, longest common subsequence, Greedy method, Activity solution problem, Greedy verses dynamic programming, Huffman codes

Greedy Algorithm, Greedy Approach, Greedy method, Activity solution problem, Greedy verses dynamic programming, Huffman codes,

Graph algorithms, Minimal spanning tree, Kruskal and Prims algorithms, Single source shortest paths, Bellman-Ford, Dijkstras algorithm, Floyd s algorithm,

Flow Network, Flow Graph

Ford-Fulkerson Method

Rabin-Karp String Matching Algorithm