Completed
Introductiont to Dynamic Programming
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Design and Analysis of Algorithms Part 2 - Dynamic Programming and Backtracking
Automatically move to the next video in the Classroom when playback concludes
- 1 Introductiont to Dynamic Programming
- 2 0/1 Knapsack Problem using Dynamic Programming
- 3 0/1 Example on Knapsack Problem using Dynamic Programming
- 4 Traveling Salesman Problem using Dynamic Programming - Undirected Graph
- 5 Traveling Salesman Problem using Dynamic Programming - Directed Graph
- 6 Longest Common Subsequence using Dynamic Programming
- 7 Longest Common Subsequences all possibilities using Dynamic Programming
- 8 Multistage Graph Problem - Forward Approach
- 9 Multistage Graph Problem - Forward Approach Example
- 10 Multistage Graph Problem - Backward Approach
- 11 OBST - Optimal Binary Search Tree using Dynamic Programming
- 12 OBST Example using Dynamic Programming
- 13 All Pair Shortest Path using Dynamic Programming
- 14 Divide & Conquer vs Dynamic Programming
- 15 Dynamic Programming vs Greedy Method
- 16 Introduction to Graphs & Graph Terminology
- 17 Introduction to Graph Traversals
- 18 Depth First Search
- 19 Breadth First Search
- 20 Introduction to Backtracking
- 21 N-Queens Problem using Backtracking
- 22 Sum of Subset Problem using Backtracking
- 23 Hamiltonian Cycle Problem using Backtracking
- 24 Graph Coloring Problem using Backtracking
- 25 Introduction to Branch and Bound
- 26 Traveling Salesman Problem using Branch and Bound
- 27 0/1 Knapsack Problem using Least Cost Branch and Bound
- 28 0/1 Knapsack Problem using FIFO Branch and Bound
- 29 Disjoint Sets - Simple Union - Simple Find
- 30 Weighted Union
- 31 Collapsing Find
