Note for Design And Analysis Of Algorithm - DAA By Animesh Dutta
- Design And Analysis Of Algorithm - DAA
- Note
- Computer Science Engineering
- 17 Topics
- 10526 Views
- 284 Offline Downloads
- Uploaded 10 months ago
Touch here to read
Page-1
Note for Design And Analysis Of Algorithm - DAA By Animesh Dutta
- Analysis of algorithm - ( 1 - 5 )
- Insertion sort algorithm - ( 6 - 7 )
- Divide & Conquer - ( 8 - 9 )
- Master Theorem for D&C - ( 10 - 12 )
- Recursive tree method - ( 13 - 13 )
- Quick sort - ( 14 - 14 )
- Merge sort - ( 15 - 18 )
- Greedy Algorithm - ( 19 - 19 )
- Fractional knapsack problem - ( 20 - 21 )
- Activity selection problem - ( 22 - 22 )
- Event scheduling problem - ( 23 - 23 )
- Heap sort - ( 24 - 27 )
- Huffman code - ( 28 - 30 )
- Matrix chain multiplication - ( 31 - 36 )
- Longest common subsequence - ( 37 - 39 )
- 0/1 knapsack - ( 40 - 41 )
- Graph - BFS - ( 42 - 43 )
Topic:
Topics ( 17 )
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
Animesh Dutta
10 months ago 00