Design and Analysis of Algorithms | DAA |ADA playlist
30 videos • 39,675 views • by Sandeep Kumar Gour
#DesignandAnalysisofAlgoriths #DAA #ADA
1
Substitution method for solving Recurrence Relation | Design and Analysis of Algorithm | Hindi
Sandeep Kumar Gour
Download
2
Substitution method for solving Recurrence relation | Design and Algorithm of Algorithm| Hindi
Sandeep Kumar Gour
Download
3
Binary Search using Divide and Conquer | Design and Analysis of Algorithm | Hindi
Sandeep Kumar Gour
Download
4
Binary Search using Divide and Conquer | Design and Analysis of Algorithm | Hindi
Sandeep Kumar Gour
Download
5
Binary Search using Divide and Conquer | Design and Analysis of Algorithm | Searching | Hindi
Sandeep Kumar Gour
Download
6
Quick Sort using Divide and Conquer with algorithm
Sandeep Kumar Gour
Download
7
Strassen matrix multiplication method using Divide and Conquer
Sandeep Kumar Gour
Download
8
Graph Traversal Method -DFS and BFS in hindi
Sandeep Kumar Gour
Download
9
Breadth First Search (BFS) for Graph Traversal Method
Sandeep Kumar Gour
Download
10
Depth First Search (DFS) with Example-Graph Traversal Method | Design and Analysis of Algorithm
Sandeep Kumar Gour
Download
11
Difference between BFS and DFS- Graph Traversal Method | Design and Analysis of Algorithm | Part-4
Sandeep Kumar Gour
Download
12
Greedy method Introduction | Design and Analysis of Algorithm | Greedy approach | Greedy Technique
Sandeep Kumar Gour
Download
13
Minimum Cost Spanning Tree GREEDY METHOD |MCST | MST | Design and Analysis of Algorithm
Sandeep Kumar Gour
Download
14
Kruskal's Algorithm for minimum cost spanning tree | Kruskals | design and analysis of algorithm
Sandeep Kumar Gour
Download
15
Prims algorithm for minimum cost spanning tree using Greedy method | Prim's Algorithm
Sandeep Kumar Gour
Download
16
Knapsack fractional Problem with Example using Greedy Method
Sandeep Kumar Gour
Download
17
Knapsack (Fractional) Problem with Example.2-Greedy Method
Sandeep Kumar Gour
Download
18
Dijkstra's Algorithm for Single source shortest path using Greedy Method
Sandeep Kumar Gour
Download
19
Bellman Ford Algorithm with Example-Single Souce Shortest Path- Greedy method
Sandeep Kumar Gour
Download
20
Matrix chain multiplication using dynamic programming with example
Sandeep Kumar Gour
Download
21
Shortest Path in multistage graph using Backward approach - Dynamic programming
Sandeep Kumar Gour
Download
22
Shortest path in multistage graph using forward approach-Dynamic programming
Sandeep Kumar Gour
Download
23
Longest Common Subsequence using Dynamic Programming
Sandeep Kumar Gour
Download
24
Traveling Salesman Problem (TSP) using Dynamic Programming
Sandeep Kumar Gour
Download
25
15 puzzle problem using branch and bound
Sandeep Kumar Gour
Download
26
Traveling Salesman Problem (TSP) using Branch and Bound
Sandeep Kumar Gour
Download
27
0/1 Knapsack Problem using Branch and Bound | Design and Analysis of algorithm | Hindi
Sandeep Kumar Gour
Download
28
N Queen problem using Backtracking with Example
Sandeep Kumar Gour
Download
29
Knapsack problem using Backtracking
Sandeep Kumar Gour
Download
30
Assignment problem using branch and bound | Analysis and design of algorithm | DAA | ADA
Sandeep Kumar Gour
Download