Note for Design And Analysis Of Algorithm - DAA by Shekharesh Barik
- Design And Analysis Of Algorithm - DAA
- Note
- Biju Patnaik University of Technology BPUT - BPUT
- Computer Science Engineering
- B.Tech
- 40 Topics
- 207765 Views
- 2604 Offline Downloads
- Uploaded 1 year ago
Touch here to read
Page-1
Note for Design And Analysis Of Algorithm - DAA by Shekharesh Barik
- Introduction , Definition,Growth of Functions - ( 1 - 1 )
- Asymptotic analysis, Amortized analysis, Standard notations and common function - ( 2 - 3 )
- Recurrences - ( 4 - 4 )
- Master methods - ( 5 - 6 )
- Solution of recurrences by substitution - ( 7 - 8 )
- Recursion tree - ( 9 - 11 )
- Design & Analysis of Divide and conquer algorithms - ( 12 - 12 )
- Binary search - ( 13 - 16 )
- Merge sort - ( 17 - 19 )
- Quick sort - ( 20 - 24 )
- Heaps - ( 25 - 26 )
- Building a heap - ( 27 - 28 )
- Heapsort mechanism - ( 29 - 29 )
- Heapsort algorithm - ( 30 - 30 )
- Lower bounds for sorting - ( 31 - 31 )
- Priority Queue - ( 32 - 33 )
- Dynamic programming methodology, Elements of Greedy strategyof dynamic programming Greedy Algorithms, - ( 34 - 34 )
- Matrix-chain multiplication - ( 35 - 39 )
- Longest common subsequence - ( 40 - 42 )
- Assembly-line scheduling - ( 43 - 44 )
- Activity selection Problem - ( 45 - 46 )
- Fractional knapsack problem - ( 47 - 49 )
- Huffman codes - ( 50 - 53 )
- Data structure for disjoint sets,Disjoint set operations ,Linked list representation - ( 54 - 54 )
- Disjoint set forests - ( 55 - 55 )
- Path compression - ( 56 - 57 )
- Breadth First Search,Depth First Search - ( 58 - 61 )
- Minimum Spanning Trees ,Kruskal algorithm , Prim's algorithms - ( 62 - 64 )
- Single-source shortest paths , Dijkstra's algorithms - ( 65 - 67 )
- Bellman-ford algorithm - ( 68 - 70 )
- All-pairs shortest paths (Floyd-Warshall Algorithm) - ( 71 - 73 )
- Back tracking,Traveling Salesman Problem - ( 74 - 74 )
- Eight Queen Problem - ( 75 - 75 )
- Branch and Bound - ( 76 - 76 )
- String matching algorithms,Naive string matching algorithm - ( 77 - 77 )
- Rabin-Karp algorithm - ( 78 - 78 )
- Knuth-Morris-Pratt algorithm - ( 79 - 80 )
- NP–Completeness,Polynomial time verification - ( 81 - 81 )
- Reducibility , NP-Complete problems (without Proofs) - ( 82 - 82 )
- Approximation algorithms characteristics - ( 83 - 83 )
Topic:
Topics ( 40 )
Text from page-1
Scanned by CamScanner
Text from page-2
Scanned by CamScanner
Text from page-3
Scanned by CamScanner
Text from page-4
Scanned by CamScanner
Leave your Comments
Pratap Sahoo
4 months ago 01