| 1. | 1. Introduction to Algorithms | 11m 49s |
| 2. | 1.1 Priori Analysis and Posteriori Testing | 1m 48s |
| 3. | 1.2 Characteristics of Algorithm | 5m 37s |
| 4. | 1.3 How Write and Analyze Algorithm | 10m 37s |
| 5. | 1.4 Frequency Count Method | 12m 22s |
| 6. | 1.5.1 Time Complexity #1 | 9m 44s |
| 7. | 1.5.2 Time Complexity Example #2 | 14m 13s |
| 8. | 1.5.3 Time Complexity of While and if #3 | 21m 54s |
| 9. | 1.6 Classes of functions | 3m 10s |
| 10. | 1.7 Compare Class of Functions | 5m 11s |
| 11. | 1.8.1 Asymptotic Notations Big Oh - Omega - Theta #1 | 15m 46s |
| 12. | 1.8.2 Asymptotic Notations - Big Oh - Omega - Theta #2 | 10m 7s |
| 13. | 1.9 Properties of Asymptotic Notations | 11m 58s |
| 14. | 1.10.1 Comparison of Functions #1 | 9m 28s |
| 15. | 1.10.2 Comparison of Functions #2 | 10m 26s |
| 16. | 1.11 Best Worst and Average Case Analysis | 18m 56s |
| 17. | 1.12 Disjoint Sets Data Structure - Weighted Union and Collapsing Find | 26m 4s |
| 18. | 2 Divide And Conquer | 7m 4s |
| 19. | 2.1.1 Recurrence Relation (T(n)= T(n-1) + 1) #1 | 13m 43s |
| 20. | 2.1.2 Recurrence Relation (T(n)= T(n-1) + n) #2 | 16m |
| 21. | 2.1.3 Recurrence Relation (T(n)= T(n-1) + log n) #3 | 12m 25s |
| 22. | 2.1.4 Recurrence Relation T(n)=2 T(n-1)+1 #4 | 10m 42s |
| 23. | 2.2 Masters Theorem Decreasing Function | 8m 10s |
| 24. | 2.3.1 Recurrence Relation Dividing Function T(n)=T(n/2)+1 #1 | 8m 41s |
| 25. | 2.3.2 Recurrence Relation Dividing [ T(n)=T(n/2)+ n]. #2 | 7m 26s |
| 26. | 2.3.3 Recurrence Relation [ T(n)= 2T(n/2) +n] #3 | 11m 20s |
| 27. | 2.4.1 Masters Theorem in Algorithms for Dividing Function #1 | 16m 50s |
| 28. | 2.4.2 Examples for Master Theorem #2 | 5m 41s |
| 29. | 2.5 Root function (Recurrence Relation) | 5m 37s |
| 30. | 2.6.1 Binary Search Iterative Method | 19m 36s |
| 31. | 2.6.2 Binary Search Recursive Method | 7m 11s |
| 32. | 2.6.3 Heap - Heap Sort - Heapify - Priority Queues | 51m 8s |
| 33. | 2.7.1 Two Way MergeSort - Iterative method | 20m 19s |
| 34. | 2.7.2. Merge Sort Algorithm | 20m 23s |
| 35. | 2.7.3 MergeSort in-depth Analysis | 13m 28s |
| 36. | 2.8.1 QuickSort Algorithm | 13m 43s |
| 37. | 2.8.2 QuickSort Analysis | 11m 37s |
| 38. | 2.9 Strassens Matrix Multiplication | 23m 40s |
| 39. | 3. Greedy Method - Introduction | 12m 2s |
| 40. | 3.1 Knapsack Problem - Greedy Method | 15m 30s |
| 41. | 3.2 Job Sequencing with Deadlines - Greedy Method | 13m 29s |
| 42. | 3.3 Optimal Merge Pattern - Greedy Method | 9m 33s |
| 43. | 3.4 Huffman Coding - Greedy Method | 17m 33s |
| 44. | 3.5 Prims and Kruskals Algorithms - Greedy Method | 20m 12s |
| 45. | 3.6 Dijkstra Algorithm - Single Source Shortest Path - Greedy Method | 18m 35s |
| 46. | 4 Principle of Optimality - Dynamic Programming introduction | 14m 52s |
| 47. | 4.1 MultiStage Graph - Dynamic Programming | 21m 7s |
| 48. | 4.1.1 MultiStage Graph (Program) - Dynamic Programming | 14m 26s |
| 49. | 4.2 All Pairs Shortest Path (Floyd-Warshall) - Dynamic Programming | 14m 13s |
| 50. | 4.3 Matrix Chain Multiplication - Dynamic Programming | 23m |
| 51. | [New] Matrix Chain Multiplication using Dynamic Programming Formula | 52m 2s |
| 52. | 4.3.1 Matrix Chain Multiplication (Program) - Dynamic Programming | 18m 40s |
| 53. | 4.4 Bellman Ford Algorithm - Single Source Shortest Path - Dynamic Programming | 17m 12s |
| 54. | 4.5 0/1 Knapsack - Two Methods - Dynamic Programming | 28m 24s |
| 55. | 4.5.1 0/1 Knapsack Problem (Program) - Dynamic Programming | 17m |
| 56. | 4.6 Optimal Binary Search Tree (Successful Search Only) - Dynamic Programming | 30m 19s |
| 57. | 4.6.2 [New] Optimal Binary Search Tree Successful and Unsuccessful Probability - Dynamic Programming | 57m |
| 58. | 4.7 [New] Traveling Salesman Problem - Dynamic Programming using Formula | 17m 18s |
| 59. | 4.8 Reliability Design - Dynamic Programming | 26m 32s |
| 60. | 4.9 Longest Common Subsequence (LCS) - Recursion and Dynamic Programming | 23m 35s |
| 61. | 5.1 Graph Traversals - BFS & DFS -Breadth First Search and Depth First Search | 18m 31s |
| 62. | 5.2 Articulation Point and Biconnected Components | 8m 37s |
| 63. | 6 Introduction to Backtracking - Brute Force Approach | 8m 15s |
| 64. | 6.1 N Queens Problem using Backtracking | 13m 41s |
| 65. | 6.2 Sum Of Subsets Problem - Backtracking | 12m 19s |
| 66. | 6.3 Graph Coloring Problem - Backtracking | 15m 52s |
| 67. | 6.4 Hamiltonian Cycle - Backtracking | 18m 35s |
| 68. | 7 Branch and Bound Introduction | 9m 40s |
| 69. | 7.1 Job Sequencing with Deadline - Branch and Bound | 10m 56s |
| 70. | 7.2 0/1 Knapsack using Branch and Bound | 10m 48s |
| 71. | 7.3 Traveling Salesman Problem - Branch and Bound | 24m 42s |
| 72. | 8. NP-Hard and NP-Complete Problems | 31m 53s |
| 73. | 8.1 NP-Hard Graph Problem - Clique Decision Problem | 17m 14s |
| 74. | 9.1 Knuth-Morris-Pratt KMP String Matching Algorithm | 18m 56s |
| 75. | 9.2 Rabin-Karp String Matching Algorithm | 23m 50s |
| 76. | 10.1 AVL Tree - Insertion and Rotations | 43m 8s |
| 77. | 10.2 B Trees and B+ Trees. How they are useful in Databases | 39m 41s |
| 78. | Asymptotic Notations - Simplified | 22m 44s |
| 79. | Hashing Technique - Simplified | 17m 4s |
| 80. | Shortest Path Algorithms (Dijkstra and Bellman-Ford) - Simplified | 26m 13s |
| 81. | BFS DFS - Simplified | 19m 13s |
| 82. | Tower of Hanoi Problem - Made Easy | 9m 32s |
| 83. | Row-Major and Column-Major Mapping | 19m 16s |
| 84. | Merge Sort Algorithm - Hindi | 16m 38s |
There are 0 Comments
Please Login to view and post the comments.