Knapsack Problem: Dynamic Programming

Related lectures (28)

Page 2 of 3

Covers graph algorithms, modeling relationships between objects, and traversal techniques like BFS and DFS.

Explores formal proofs, satisfiability problems, and inductive invariants using SAT queries in sequential circuits.

Explores model selection challenges in causal models and the impact of local geometry on statistical inference.

Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.

Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.

Explores the properties of undirected and directed graphs, emphasizing connectivity and network topology modeling.

Covers a dynamic programming algorithm for a financial adviser to maximize the probability of impressing her clients.

Covers the independence polynomial of a dependency graph and related concepts such as graph coloring and directed graph properties.

Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.

Introduces the Bellman-Ford algorithm for finding shortest paths in directed graphs with edge weights.