 DESIGN AND ANALYSIS OF ALGORITHM (DAA) Lecture Notes Ebook PDF download

Ashish talpade | 10-Jan-2016 |

DESIGN AND ANALYSIS OF ALGORITHM (DAA) Lecture Notes Ebook PDF download for B.tech And MCA

CONTENTS
MODULE – I
Lecture 1 - Introduction to Design and analysis of  algorithms
Lecture 2 - Growth of Functions ( Asymptotic notations)
Lecture 3 - Recurrences, Solution of Recurrences by substitution
Lecture 4 - Recursion tree method
Lecture 5 -  Master Method
Lecture 6 -  Worst case analysis of merge sort, quick sort and binary search Lecture 7 - Design and analysis of Divide and Conquer Algorithms Lecture 8 -  Heaps and Heap sort
Lecture 9 -  Priority Queue
Lecture 10 - Lower Bounds for Sorting
MODULE -II
Lecture 11 - Dynamic Programming algorithms
Lecture 12 - Matrix Chain Multiplication
Lecture 13 - Elements of Dynamic Programming
Lecture 14 - Longest Common Subsequence
Lecture 15 - Greedy Algorithms
Lecture 16 - Activity Selection Problem
Lecture 17 - Elements of Greedy Strategy
Lecture 18 - Knapsack Problem
Lecture 19 - Fractional Knapsack Problem
Lecture 20 - Huffman Codes
MODULE - III
Lecture 21 - Data Structure for Disjoint Sets
Lecture 22 - Disjoint Set Operations, Linked list Representation
Lecture 23 - Disjoint Forests
Lecture 24 - Graph Algorithm - BFS and DFS
Lecture 25 - Minimum Spanning Trees
Lecture 26 - Kruskal algorithm
Lecture 27 - Prim's Algorithm
Lecture 28 - Single Source Shortest paths
Lecture 29 - Bellmen Ford Algorithm
Lecture 30 - Dijkstra's Algorithm
MODULE -IV
Lecture 31 - Fast Fourier Transform
Lecture 32 - String matching
Lecture 33 - Rabin-Karp Algorithm
Lecture 34 - NP-Completeness
Lecture 35 - Polynomial time verification
Lecture 36 - Reducibility
Lecture 37 - NP-Complete Problems (without proofs)
Lecture 38 - Approximation Algorithms
Lecture 39 - Traveling Salesman Problem

Attachment Lists

• DAA.pdf (Size: 1777.83KB)