Details for:

Type:
Files:
Size:

Uploaded:
By:

Seeders:
Leechers:
Info Hash:
  1. !! IMPORTANT Note !!.txt287 B
  2. !!! Please Support !!! [CoursesGhar.Com].txt197 B
  3. 1.Instruction Note/1. Read Me First.pdf319.88 KiB
  4. 10.Zero by one Knapsack/1.Difference between fractional and 0-1 knapsack.m4v67.26 MiB
  5. 10.Zero by one Knapsack/2.Why greedy method fails in 0-1 knapsack.m4v23.80 MiB
  6. 10.Zero by one Knapsack/3.Substructure and Recursive equation.m4v58.03 MiB
  7. 10.Zero by one Knapsack/4.Recursion tree and unique subproblems.m4v68.11 MiB
  8. 10.Zero by one Knapsack/5.Example tracing out bottom up Dynamic programming algorithm.m4v169.29 MiB
  9. 10.Zero by one Knapsack/6.Bottom up Dynamic programming algorithm and analysis.m4v54.61 MiB
  10. 11.Subset sum/1.Subset Sum Introduction.mp479.32 MiB
  11. 11.Subset sum/2.Example.mp4148.87 MiB
  12. 12.Travelling salesman problem/1.Introduction to TSP.m4v51.86 MiB
  13. 12.Travelling salesman problem/2.Detecting Optimal substructure.mp4135.51 MiB
  14. 12.Travelling salesman problem/3.Bottom up dynamic programming algorithm.mp4145.53 MiB
  15. 13.All pairs shortest path -- Floyd Warshall/1.Relationship between single source shortest path and all pairs shortest path.m4v39.19 MiB
  16. 13.All pairs shortest path -- Floyd Warshall/2.Optimal substructure.m4v47.94 MiB
  17. 13.All pairs shortest path -- Floyd Warshall/3.Example.mp4224.40 MiB
  18. 13.All pairs shortest path -- Floyd Warshall/4.Time complexity and space complexity of bottom up dynamic programming algorithm.mp440.20 MiB
  19. 13.All pairs shortest path -- Floyd Warshall/5.Bottom Dynamic programming algorithm.mp426.13 MiB
  20. 14.NP Completeness (Not required for GATE) Complexity Classes/1.Introduction.m4v47.56 MiB
  21. 14.NP Completeness (Not required for GATE) Complexity Classes/10.Well know NP complete problems.mp489.10 MiB
  22. 14.NP Completeness (Not required for GATE) Complexity Classes/2.Types of algorithms.m4v84.17 MiB
  23. 14.NP Completeness (Not required for GATE) Complexity Classes/3.some examples.m4v44.71 MiB
  24. 14.NP Completeness (Not required for GATE) Complexity Classes/4.Optimisation and Decision problems.mp4108.92 MiB
  25. 14.NP Completeness (Not required for GATE) Complexity Classes/5.We use only decision problems in NP completeness theory.mp435.96 MiB
  26. 14.NP Completeness (Not required for GATE) Complexity Classes/6.Verfication algorithms.mp458.65 MiB
  27. 14.NP Completeness (Not required for GATE) Complexity Classes/7.P NP Introduction.mp4107.83 MiB
  28. 14.NP Completeness (Not required for GATE) Complexity Classes/8.Polynomial time reduction algorithms.mp4138.40 MiB
  29. 14.NP Completeness (Not required for GATE) Complexity Classes/9.NP hard and NP complete problems.mp4165.80 MiB
  30. 2.Time and Space analysis/1.Algorithms Lecture 1 -- Introduction to asymptotic notations.mkv72.05 MiB
  31. 2.Time and Space analysis/10.Example on Aggregate Analysis.m4v37.15 MiB
  32. 2.Time and Space analysis/2.Time complexity Analysis of iterative programs.mkv128.25 MiB
  33. 2.Time and Space analysis/3.Time analysis of recursive program.mkv93.03 MiB
  34. 2.Time and Space analysis/4.comparing various functions to analyse time complexity.mkv91.72 MiB
  35. 2.Time and Space analysis/5.Masters theorem.mkv113.05 MiB
  36. 2.Time and Space analysis/6.Analyzing Space complexity of iterative and recursive algorithms.mkv248.76 MiB
  37. 2.Time and Space analysis/7.Note.png22.98 KiB
  38. 2.Time and Space analysis/8.Amortized Analysis.mp414.07 MiB
  39. 2.Time and Space analysis/9.Aggregate Analysis.m4v17.71 MiB
  40. 3.Sorting Techniques/1.Insertion sort algorithm and analysis.mkv123.15 MiB
  41. 3.Sorting Techniques/13.Bubble sort algorithm.m4v33.89 MiB
  42. 3.Sorting Techniques/14.Example on Bubble sort.m4v43.31 MiB
  43. 3.Sorting Techniques/15.Time complenity analysis for bubble sort.m4v34.12 MiB
  44. 3.Sorting Techniques/16.Extract max increase key and insert key into heap.mkv96.71 MiB
  45. 3.Sorting Techniques/17.Bucket sort.m4v32.29 MiB
  46. 3.Sorting Techniques/18.Counting sort.m4v28.33 MiB
  47. 3.Sorting Techniques/19.Radix-sort(aid).mp436.79 MiB
  48. 3.Sorting Techniques/2.Merge sort algorithm analysis and problems.mkv258.58 MiB
  49. 3.Sorting Techniques/20.Analysis of time complexity on radix -sort(AID).mp440.14 MiB
  50. 3.Sorting Techniques/21.Algorithm of selection sort file.mp418.21 MiB
  51. 3.Sorting Techniques/22.Analysis of selection sort file.mp469.31 MiB
  52. 3.Sorting Techniques/3.Quick sort algorithm.mkv196.05 MiB
  53. 3.Sorting Techniques/4.Analysis of quick sort and problems on it.mkv130.75 MiB
  54. 3.Sorting Techniques/5.introduction to heaps.mkv173.52 MiB
  55. 3.Sorting Techniques/6.Max heapify algorithm and complete binary tree.mkv177.26 MiB
  56. 3.Sorting Techniques/7.Build max heap algorithm and analysis.mkv72.08 MiB
  57. 3.Sorting Techniques/9.Heap sort and analysis.m4v121.39 MiB
  58. 4.Greedy algorithms/1.Introduction to Greedy algorithms.m4v50.97 MiB
  59. 4.Greedy algorithms/10.Prims algorithm implementation without min heap.m4v245.30 MiB
  60. 4.Greedy algorithms/11.Prims algorithm implement with min heap.m4v230.50 MiB
  61. 4.Greedy algorithms/12.Introduction to kruskal algorithm and examples on it.m4v312.05 MiB
  62. 4.Greedy algorithms/13.Kruskals algorithm using Disjoint sets.mp431.76 MiB
  63. 4.Greedy algorithms/14.Example on kruskals using Disjoint sets.mp437.51 MiB
  64. 4.Greedy algorithms/15.Amortized Analysis.mp414.07 MiB
  65. 4.Greedy algorithms/16.Aggregate Analysis.mp416.70 MiB
  66. 4.Greedy algorithms/17.Example on Aggregate Analysis.mp435.63 MiB
  67. 4.Greedy algorithms/18.Data Structure for Disjoint Sets.mp418.84 MiB
  68. 4.Greedy algorithms/19.Operations on Disjoint Sets.mp422.80 MiB
  69. 4.Greedy algorithms/2.Greedy knap sack algorithm.m4v240.78 MiB
  70. 4.Greedy algorithms/20.Linked list representation of disjoint sets.mp425.74 MiB
  71. 4.Greedy algorithms/21.Time complexity for linked list representation of Disjoint Sets.mp427.68 MiB
  72. 4.Greedy algorithms/22.Amortized analysis of disjoint sets using linked list representation.mp435.94 MiB
  73. 4.Greedy algorithms/23.Disjoint set forest.mp421.47 MiB
  74. 4.Greedy algorithms/24.Union by rank.mp411.68 MiB
  75. 4.Greedy algorithms/25.Analysis union by rank.mp459.13 MiB
  76. 4.Greedy algorithms/26.Path compression.mp432.08 MiB
  77. 4.Greedy algorithms/27.Time complexity using the Heuristics.mp426.67 MiB
  78. 4.Greedy algorithms/28.Connected components using Disjoints.mp420.91 MiB
  79. 4.Greedy algorithms/29.Example on connected components using Disjoint sets.mp420.95 MiB
  80. 4.Greedy algorithms/3.Huffman codes.m4v323.73 MiB
  81. 4.Greedy algorithms/4.More examples on Huffman codes.m4v91.65 MiB
  82. 4.Greedy algorithms/5.Job sequencing with deadlines.m4v171.36 MiB
  83. 4.Greedy algorithms/6.Optimal merge Patterns video mistake at 10-03 mins.docx88.52 KiB
  84. 4.Greedy algorithms/7.Optimal merge patterns.m4v112.59 MiB
  85. 4.Greedy algorithms/8.Introduction to spanning trees and Kirchhoff theorem.m4v253.29 MiB
  86. 4.Greedy algorithms/9.MST and examples on prims algorithm.m4v287.90 MiB
  87. 5.Dijkstra Algorithm/1.Dijkstra algorithm example1.mp4125.20 MiB
  88. 5.Dijkstra Algorithm/2.Dijkstra algorithm example2.mp434.01 MiB
  89. 5.Dijkstra Algorithm/3.Dijkstra algorithm.mp485.15 MiB
  90. 5.Dijkstra Algorithm/4.Negative weight edges and dijkstra algorithm.mp4132.30 MiB
  91. 6.Dynamic programming/1.Introduction to Dynamic programming.m4v91.21 MiB
  92. 7.Matrix chain multiplication -- Dynamic Programming/1.matrix multiplication.m4v40.43 MiB
  93. 7.Matrix chain multiplication -- Dynamic Programming/2.chain multiplication introduction.m4v34.62 MiB
  94. 7.Matrix chain multiplication -- Dynamic Programming/3.Examples.m4v111.16 MiB
  95. 7.Matrix chain multiplication -- Dynamic Programming/4.Optimal substructure and Recursive equations.mp480.97 MiB
  96. 7.Matrix chain multiplication -- Dynamic Programming/5.Recursion tree.mp492.61 MiB
  97. 7.Matrix chain multiplication -- Dynamic Programming/6.Dynamic programming bottom up implementation.mp4201.75 MiB
  98. 7.Matrix chain multiplication -- Dynamic Programming/7.Top down dynamic programming memoization algorithm.mp481.20 MiB
  99. 8.Longest common subsequence/1.Introduction to LCS.m4v127.62 MiB
  100. 8.Longest common subsequence/2.Optimal substructure and Recursive equations.m4v71.75 MiB
  101. 8.Longest common subsequence/3.Recursion tree and unique sub problems.m4v199.25 MiB
  102. 8.Longest common subsequence/4.example 1.mp459.11 MiB
  103. 8.Longest common subsequence/5.example 2.mp484.51 MiB
  104. 8.Longest common subsequence/6.Bottom up Dynamic programming algorithm.mp430.74 MiB
  105. 9.Multi stage graph/1.Introduction to multi stage graph.mp462.61 MiB
  106. 9.Multi stage graph/2.Substructure and recursive equation.mp465.25 MiB
  107. 9.Multi stage graph/3.Bottom up Dynamic programming algorithm.mp4135.23 MiB
  108. Uploaded by [Coursesghar.com].txt1.10 KiB
  109. Visit coursesghar.com for more awesome tutorials.url114 B
  110. [TGx]Downloaded from torrentgalaxy.to .txt564 B
  111. telegram @coursesghargate.url128 B