eBooks E-Books Dynamic Programming: Optimal Binary Search Trees (Cont.) , Greedy Algorithms (V-U) Dynamic Programming for Solving Optimization Problems: Chain Matrix Multiplication Problem (V-U) Dijkstra's Algorithm: Problem Statement, Analysis, Correctness (V-U) Designing Algorithms using Divide & Conquer Approaches (Cont.) (V-U) Designing Algorithms using Brute Force and Divide & Conquer Approaches (V-U) Chain Matrix Multiplication Problem using Dynamic Programming (Cont.) (V-U) Brute Force Approach: Introduction, Starting with Primality, Sorting Sequence of numbers (V-U) Breadth First Search: Shortest Paths (V-U) Backtracking, Branch & Bound Algorithms (V-U) Assembly-Line Scheduling Problem (V-U) All-Pairs Shortest Paths, Shortest Paths and Matrix Multiplication (V-U) 2-Line Assembly Scheduling Problem, n-Line Assembly Scheduling Problem (V-U) 0-1 Knapsack Problem's Algorithm using Dynamic Programming, Optimal Weight Triangulation (V-U) 0-1 Knapsack Problem using Dynamic Programming (V-U) Lecture 9 (Harvard) Lecture 8 (Harvard) « Previous 1 … 3,711 3,712 3,713 3,714 3,715 … 4,276 Next »
