Name: Note Design And Analysis Of Algorithm DAA By shyed sai
Rating: 4.3 (3 reviews)
Author: Shyed Saif

Syllabus

analysis, designing algorithm. complexities, recursive algorithms, fast exponential algo. , Asymptotic notations, sterling formula, testing of function, Armstrong rule

Introduction To Algorithm

control abstraction, substitution method, master's theorum, recursive tree method, change of variable method, binary search, merge sort, 2 way merge sort, quick sort, pivot section method, max-min algo. , Stressen's multiplication

Divide And Conquer Algorithm

representation, Strict binary tree, priority queue, max-min heap, heap operations

Graph And Tree

coin change problem, Dijkstra's algorithm

Greedy Algorithm

MST, Kruskal and Prim's algorithm, Huffman Coding, optimal merge tree, fraction knapsack problem, brute force algorithm,

Bellman Ford Algorithm

Sorting Algorithm

Graph Traversal Algorithm

matrix chain problem, nth fib. num algo. ,LCS, Knapsack problem(0/1), sum of subset

Note for Design And Analysis Of Algorithm - DAA By shyed saif

. Computer Science Engineering