Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore advanced algorithmic techniques through this comprehensive 11-hour video course covering dynamic programming, backtracking, and branch-and-bound methods. Master dynamic programming by solving classic problems including the 0/1 Knapsack Problem, Traveling Salesman Problem for both directed and undirected graphs, Longest Common Subsequence, Multistage Graph Problems using forward and backward approaches, Optimal Binary Search Trees, and All Pair Shortest Path algorithms. Learn graph fundamentals including terminology, traversal methods like Depth First Search and Breadth First Search, then dive into backtracking techniques to solve the N-Queens Problem, Sum of Subset Problem, Hamiltonian Cycle Problem, and Graph Coloring Problem. Understand branch-and-bound methodology through practical applications to the Traveling Salesman Problem and 0/1 Knapsack Problem using both Least Cost and FIFO approaches. Compare different algorithmic paradigms including Divide & Conquer vs Dynamic Programming and Dynamic Programming vs Greedy Methods. Conclude with disjoint set operations covering Simple Union-Simple Find, Weighted Union, and Collapsing Find techniques. Each topic includes detailed explanations, step-by-step problem-solving approaches, and practical examples to reinforce theoretical concepts essential for computer science students, competitive programming, and technical interviews.
