Lecture Topics (tentative)

Wed, Jan 21 — Greedy I: Course Intro and Minimum Spanning Tree (Notes)

Reading: KT §1.2 and §2 (especially 2.1, 2.2, 2.4) and §3.1-3.3 and 4.4

Fri, Jan 23 — Greedy II: Algorithms for Minimum Spanning Tree and Interval scheduling start (Notes)

Reading: KT §4.5 (see also, §3.1-3.3 and 4.4)

Mon, Jan 26 — Greedy III: Universuty closed due to weather. Please watch the following short video on interval scheduling, material that is needed for sections this week. See also the Notes.

Reading: KT §4.1

Mon-Tue, Jan 26-27 — Section: Practice with greedy

Reading: KT §4.1 and §4.5

Wed, Jan 28 — Dynamic Programming I: Weighted interval scheduling. See the notes from class.

Reading: KT §6.1 and §6.2

Fri, Jan 30 — Dynamic Programming II: Segmented Least Squares. See the notes from class.

Reading: KT §6.3

Mon, Feb 2 — Dynamic Programming III: Shortest Path in Graphs. See the notes from class.

Reading: KT §4.4 and §6.8

Mon-Tue, Feb 2-3 — Section: Quiz on greedy (based on the HW1) and practice with dynamic programming

Wed, Feb 4 — Dynamic Programming IV: Sequence Alignment. See the notes from class.

Reading: KT §6.6

Fri, Feb 6 — Dynamic Programming V: The Knapsack Problem. See the notes from class.

Reading: KT §6.4

Mon, Feb 9 — Review for Prelim I (one more greedy and reductions)

Mon-Tue, Feb 9-10 — Section: Quiz on dynamic programming (based on the HW2) and practice for the prelim

Wed, Feb 11 — Stable Matching I

Reading: KT §1.1

Thu, Feb 12 — Prelim I at 7:30-9pm

Fri, Feb 13 — Stable Matching II

Reading: KT §1.1

Mon, Feb 16 — February break