Name: Note Analysis and Design Algorithms DAA By Lovely Kiit
Rating: 5 (1 reviews)
Author: Lovely Kiitian

Analysis of Algorithm, Approximation algorithm, Asymptotic Notations, Order of growth of a function, Execution time

Introduction To Daa

Applications of Technique, Quick Sort, Average Case analysis, Merge Sort, Binary Search

Divide And Conquer Technique

Applying recurrence formula, Master's Theorem, Recurrence Tree

Representation using array, Complete Binary Tree, Max-heap, Deletion in heap, Insertion in heap, Search

Knapsack Problem, Activity Selection problem

Degree of Vertex, Spanning tree, MST, Kruskal and Prims algorithm, Dijkstra Shortest Path

Note for Analysis and Design of Algorithms - DAA