Name: Note Design And Analysis Of Algorithm DAA By Mamata Ga
Rating: 4 (21 reviews)
Author: Mamata Garanayak

Assignment And Syllabus

Characteristics, Time and Space complexity, Growth of function, Asymptotic Notation, Ratio theorem, Recurrence, Master Method, changing variable method, Recursion tree method, Substitution Method, Iteration Method

Introduction To Daa

Algorithm, Advantages, Merge Sort, Quick Sort, Binary Search with analysis

Divide And Conquer

Max and min heap, building a heap, Heap sort algorithm and its analysis, priority queue, Heap maximum and extract max, heap increase key, lower bounds for sorting, counting sort

Introduction To Heap Sort

Principle of optimality, matrix chain multiplication, Brute force approach, differences, Longest Common Sub-sequence, elements of DP, Assembly-Line scheduling, Activity Selection Problem, Greedy-Activity-Selector, Knapsack problem( 0/1 and fractional), Huffman Codes

Dynamic Programming And Greedy Algorithm

Operations, Application, Representation, Implementation, Disjoint set forests, Union by rank

Disjoint Sets

Types of graphs, Graph traversal, BFS, DFS, Classification of edges, Minimum Cost Spanning Trees, Kruskal's and Prim's Algorithm, single source shortest path, Dijkstra Algorithm, Bellman Ford Algorithm, Floyd-Warshall Algorithm, Backtracking, Subset-Sum problem

Graph Algorithms

Ford- Fulkerson method, FFT, Polynomial Time ,Class NP,P, NP-completeness, NP hard and complete, Boolean Satisfy problems,Hamiltonian path, subgraph isomorphism, vertex cover problem, approximation algorithm, TSP problem and approximation

Branch And Bound And Flow Network

Excellent Notes. Wonderfully Explained in A Simpler Way. Even A Beginner can Understand these Notes And Became A Master in it. Loved The Study Material !!!

Note for Design And Analysis Of Algorithm - DAA By Mamata Garanayak

short ·

CSE ·

DAA

· 2018