07 Divide-and-Conquer

Counting Inversions

📄 00 Counting Inversions.pdf

Recursive-Multiply

📄 00 Recursive-Multiply.pdf

08 Dynamic Programming

Coin Change Problem

📄 01 Coin Change.pdf

0/1 Knapsack Problem

📄 02 01 Knapsack.pdf

Matrix Chain Multiplication

📄 03 Matrix Chain Multiplication.pdf

Floyd-Warshall Algorithm

📄 04 Floyd-Warshall.pdf

Reliability Design

📄 05 Reliability Design.pdf

09 Coping with the Limitations of Algorithm Power (Backtracking)

N Queens Problem (Backtracking)

📄 06 N-Queens.pdf

Hamiltonian Circuit Problem

📄 07 Hamiltonian.pdf

Subset-sum Problem

📄 08 Sum of Subsets.pdf

Graph Coloring

📄 09 Graph Coloring.pdf

Branch-and-Bound

📄 10 Branch-and-Bound.pdf

Knapsack Problem (0/1 using BB)

📄 11 01 Knapsack (BB).pdf

String Matching Algorithm

Brute Force (Naïve Algorithm) + Horspool’s Algorithm

📄 12 String Match (2 Alg).pdf

P, NP, and NP-complete Problems

• Hamiltonian Circuit Problem (Yes, No)
• Vertex Cover Problem (NP-hard)
• CNF-SAT Problem (NP-complete)
  📄 13 NP, NP-hard.pdf

Clique Decision Problem

https://youtu.be/qZs767KQcvE?feature=shared