# Algorithms

## To Do

• Study for the final! Thursday May 11th, 6:20-8:20pm (normal classroom)
• Q&A session Thursday May 11th, 9-10:30am (normal classroom)
Spoilers for Advanced Graph Algorithms Quiz

## Week Fourteen (Apr 25, 27)

NP-Completeness (Cormen Ch 34 [34.5])

CS320 Final-study ideas
Basic Graph notes
NP-Completeness notes

## Week Thirteen (Apr 18, 20)

Single Source Shortest Path (Cormen Ch 24)

## Week Twelve (Apr 11, 13)

Minimum Spanning Trees (Cormen Ch 23, 21.1-2), Single Source Shortest Path (Cormen Ch 24)

MST Worksheet
Single Source Shortest Path

## Week Eleven (Apr 4, 6)

Minimum Spanning Trees (Cormen Ch 23, 21.1-2)

## Week Ten (Mar 28, 30)

Basic Graph Algorithms (Cormen Ch 22)

## Week Nine (Mar 21, 23)

Review midterm answers, Basic Graph Algorithms (Cormen Ch 22)

## Week Eight (Mar 7, 9)

Review for midterm and take it on Thursday

## Week Seven (Feb 28, Mar 2)

Greedy algorithms (Cormen Ch 16) and Midterm review

Midterm Practice Material
Study Score Card

## Week Six (Feb 21, 23)

Dynamic programming (Cormen Ch 15) and Greedy algorithms (Cormen Ch 16)

Homework Two

## Week Five (Feb 14, 16)

Divide and Conquer algorithms (Cormen Ch 4) and Dynamic Programming (Cormen Ch 15)

HomeworkOne.pdf
Dynamic Programming Worksheet

## Week Four (Feb 7, 9)

Divide and Conquer algorithms (Cormen Ch 4)

Divide and Conquer Worksheet

## Week Three (Jan 31, Feb 2)

Python, a preview of different problems, complexity (Kleinberg Ch 2, Cormen Ch 3)

CS320 Lecture Note Template, Feb 2

## Week Two (Jan 24, 26)

More Gale-Shapely proofs and extensions from the base problem (Kleinberg Ch 1, 2)

Gale-Shapley Unique Matching Proof
Gale-Shapley Group Exercises

## Week One (Jan 17, 19)

We examine the Stable Matching Problem, and how the Gale-Shapley algorithm produces a stable matching. (Kleinberg Ch 1)