Design and Analysis of Algorithms

Design and Analysis of Algorithms

Sundeep Saradhi Kanthety via YouTube Direct link

01-Introduction to Algorithms for Placements & Interviews | DAA Full Course Series

1 of 53
Next

1 of 53

01-Introduction to Algorithms for Placements & Interviews | DAA Full Course Series

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Design and Analysis of Algorithms

Automatically move to the next video in the Classroom when playback concludes
  1. 1 01-Introduction to Algorithms for Placements & Interviews | DAA Full Course Series
  2. 2 02-Time Complexities in Algorithms | Big O, Omega, Theta | DAA Full Course Series
  3. 3 03-Asymptotic Notations in DAA | Big-O, Omega & Theta | Best, Worst & Average Cases
  4. 4 04-Growth Rates in Algorithms | Order from Smallest to Largest | DAA Performance Analysis | DAA
  5. 5 05-How to Calculate Time Complexity with Examples | DAA Part-1 | Step-by-Step Guide | DAA
  6. 6 06-How to Calculate Time Complexity with Examples | DAA Part-2 | Step-by-Step Guide | DAA
  7. 7 07-Amortized Analysis in Algorithms Explained with Example | DAA Time Complexity | DAA
  8. 8 08-Divide and Conquer Algorithm Explained | DAA Strategy with Examples | DAA
  9. 9 09-Find Min & Max Using Divide and Conquer | With Example & Time Complexity | DAA
  10. 10 10-Binary Search Explained | Divide and Conquer Approach | DAA with Example & Time Complexity | DAA
  11. 11 11-Merge Sort Explained | Divide and Conquer Approach | DAA with Example & Time Complexity | DAA
  12. 12 12-Quick Sort Explained | Divide and Conquer Algorithm | DAA with Example & Time Complexity | DAA
  13. 13 13-Strassen’s Algorithm | Fast Matrix Multiplication | DAA Concept + Time Complexity Analysis | DAA
  14. 14 14-Introduction to Greedy Method | DAA Strategy with Examples & Applications | DAA
  15. 15 15-Job Sequencing with Deadlines | Greedy Algorithm Explained with Example | DAA
  16. 16 16-Kruskal's Algorithm Explained | Minimum Spanning Tree Using Greedy Method | DAA
  17. 17 17-Prim's Algorithm Explained | Minimum Spanning Tree Using Greedy Method | DAA
  18. 18 18-Dijkstra’s Algorithm Explained | Single Source Shortest Path | Greedy Method | DAA
  19. 19 19-Dijkstra’s Algorithm Solved Example | Greedy Strategy | Shortest Path Problem | DAA
  20. 20 20-Knapsack Problem Using Greedy Method | Fractional Knapsack Explained | DAA
  21. 21 21-Dynamic Programming Made Easy | Concepts, Applications & Example Problem | DAA
  22. 22 22 - 0/1 Knapsack Problem Explained | Dynamic Programming Approach | DAA with Example & Table | DAA
  23. 23 23-Example of 0/1 Knapsack Problem | DAA Dynamic Programming Approach Explained | DAA
  24. 24 24-Traveling Salesman Problem Solved | Dynamic Programming on Undirected Graph | DAA
  25. 25 25-Traveling Salesman Problem (TSP) on Directed Graph | DP Approach with Example | DAA
  26. 26 26-Longest Common Subsequence (LCS) Explained | Dynamic Programming with Example | DAA
  27. 27 27-Longest Common Subsequences (All Possibilities) | Dynamic Programming Approach | DAA
  28. 28 28-Multistage Graph Problem Explained | Forward Approach Using Dynamic Programming | DAA
  29. 29 29-Multistage Graph Solved Example | Forward Approach Using Dynamic Programming | DAA
  30. 30 30-Multistage Graph Explained | Backward Approach Using Dynamic Programming | DAA
  31. 31 31-Optimal Binary Search Tree (OBST) Using Dynamic Programming | Successful Searches Only | DAA
  32. 32 32-Floyd Warshall Algorithm Explained | All Pairs Shortest Path Using DP | DAA
  33. 33 33-Divide & Conquer vs Dynamic Programming | Key Differences Explained | DAA
  34. 34 34-Dynamic Programming vs Greedy Method | Key Differences Explained with Examples | DAA
  35. 35 35-Introduction to Graphs | Graph Terminology & Types Explained | DAA Lecture for GATE & Interviews
  36. 36 36-Depth First Search (DFS) Explained | Graph Traversal Algorithm | DAA with Example | DAA
  37. 37 37-Breadth First Search (BFS) Explained | Graph Traversal Algorithm | DAA with Example | DAA
  38. 38 38-Backtracking Explained | Introduction, Applications & State Space Tree | DAA
  39. 39 39-N-Queens Problem Solved Using Backtracking | 4-Queens Example Explained | DAA
  40. 40 40-Sum of Subset Problem Solved | Backtracking Algorithm with Example | DAA
  41. 41 41-Hamiltonian Cycle Problem Explained | Backtracking Algorithm + Full Procedure | DAA
  42. 42 42-Graph Colouring Problem Using Backtracking | Step-by-Step Example | DAA
  43. 43 43-Introduction to Branch and Bound | Characteristics, Strategy & Applications | DAA
  44. 44 44-Traveling Salesman Problem Using Branch and Bound | Least Cost Method Explained | DAA
  45. 45 45-Solve 0/1 Knapsack Using Branch and Bound | Step-by-Step Example | DAA
  46. 46 46-Solve 0/1 Knapsack Using FIFO Branch & Bound | Full Explanation with Tree | DAA
  47. 47 47-Disjoint Set Data Structure | Union & Find Operations Step-by-Step | DAA
  48. 48 48-Weighted Union in Disjoint Sets | Efficient Union Operation Explained | DAA
  49. 49 49-Collapsing Find in Disjoint Sets | Optimized Find Operation Explained | DAA
  50. 50 DAA: Complete Guide to Divide and Conquer | Algorithms + Examples in Just 2 Hours
  51. 51 DAA: Full Dynamic Programming Course | Step-by-Step Examples in 4 Hours
  52. 52 DAA: One Shot Backtracking Tutorial | All Key Problems Solved in One Video
  53. 53 Greedy Algorithms Made Easy | Full Lecture with Examples in 2 Hours | DAA Simplified

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Sign up for free
Someone learning on their laptop while sitting on the floor.