**CS 332: Algorithms**

**Administrivia**

**Review: Dynamic Programming**

**Review: Greedy Algorithms**

**Review: Activity-Selection
Problem**

**Review: Activity-Selection**

**Review: Activity-Selection**

**Review: Greedy Choice
Property For Activity Selection**

**Review: **

The Knapsack Problem

**Homework 4**

**Homework 4**

**Homework 4**

**Homework 4**

**NP-Completeness**

**Polynomial-Time Algorithms**

**NP-Complete Problems**

**An NP-Complete
Problem:**

Hamiltonian Cycles

**P and NP**

**Nondeterminism**

**P and NP**

**NP-Complete Problems**

**Reduction**

**Reducibility**

**Using Reductions**

**Coming Up**

**The End**