Design & Analysis of Algorithms - Vol 2
Engineering · 24 chapters · 294 sections · about 196 hours
Chapters
24 chapters · 294 sections- 1All-pairs Shortest Paths11 sections
- 2Minimum Cost Spanning Trees12 sections
- 3Spanning Trees: Prim’s Algorithm7 sections
- 4Dijkstra's Algorithm and Prim's Algorithm9 sections
- 5Kruskal's Algorithm15 sections
- 6Union-Find Data Structure12 sections
- 7Union-Find Data Structure Using Pointers12 sections
- 8Priority Queues9 sections
- 9Heaps13 sections
- 10Height of the Heap15 sections
- 11Heaps and Dijkstra's Algorithm12 sections
- 12Divide and Conquer: Counting Inversions11 sections
- 13Divide and Conquer: Closest Pair of Points25 sections
- 14Search Trees13 sections
- 15Find Operations5 sections
- 16Insertion in a Search Tree10 sections
- 17Balanced Search Trees9 sections
- 18AVL Tree Rotations9 sections
- 19Greedy algorithms: Interval scheduling23 sections
- 20Greedy Algorithms: Minimizing Lateness9 sections
- 21Greedy Algorithms: Huffman Codes12 sections
- 22Introduction to Recursive Solutions and Huffman Coding19 sections
- 23Dynamic Programming10 sections
- 24Module – 0212 sections
About this course
Design and analysis of algorithms is a field of computer science focused on creating efficient and effective problem-solving procedures (algorithms) and analyzing their performance.