**CS 332: Algorithms**

**Administrivia**

**Homework 5**

**Review: P and NP**

**Review: P and NP**

**Review: NP-Complete**

**Review: NP-Complete**

**Review: **

Proving Problems NP-Complete

**Review: **

Directed Þ Undirected Ham. Cycle

**Review:**

Directed Þ Undirected Ham. Cycle

**Review: Hamiltonian Cycle Þ TSP**

**Review: Hamiltonian Cycle Þ TSP**

**Review: Conjunctive Normal
Form**

**3-CNF ® Clique**

**3-CNF ® Clique**

**3-CNF ® Clique**

**3-CNF ® Clique**

**Clique ® Vertex Cover**

**Clique ® Vertex Cover**

**Clique ® Vertex Cover**

**Clique ® Vertex Cover**

**General Comments**

**Other NP-Complete Problems**

**Final Exam**

**Final Exam: Study Tips**

**Graph Representation**

**Basic Graph Algorithms**

**Topological Sort, MST**

**MST Algorithms**

**Single-Source Shortest Path**

**Disjoint-Set Union**

**Amortized Analysis**

**Dynamic Programming**

**LCS Via Dynamic Programming**

**Greedy Algorithms**

**The End**