CSE421 - Winter 2025 Schedule

6 Jan

Courses begin

Intro; Stable Matching

K&T: 1.1 and slides(pptx) and slides(pdf) and slides(ink) and video

7 Jan

8 Jan

Stable Matching; Overview

K&T: 1.1 and slides(pptx) and slides(pdf) and slides(ink) and video

9 Jan

S1 Stable Matching; Proofs/Induction

slides(pptx) and slides(pdf) and handout and solution

10 Jan

Stable Matching 2

K&T: 2 (review) and slides(pptx) and slides(pdf) and slides(ink) and video

11 Jan

12 Jan

13 Jan

Graph Traversal (BFS & Applications)

K&T: 3.1-3.4 and slides(pdf) and slides(pptx) and slides(ink) and video

14 Jan

15 Jan

Graph Traversal (DFS & Applications)

slides(pdf) and slides(pptx) and slides(ink) and video

HW1 Stable Matching

16 Jan

S2 Graph Search; Asymptotics

slides(pptx) and slides(pdf) and handout and solution

17 Jan

Greedy Algorithms 1

K&T: 4.1-4.2 and slides(pdf) and slides(pptx) and slides(ink) and video

18 Jan

19 Jan

20 Jan

MLK Day
(no class)

21 Jan

22 Jan

Greedy Algorithms 2

K&T:4.4-4.7 and slides (pptx) and slides (pdf) and slides (ink) and video

HW2 Graph Search

23 Jan

S3 Problem Solving Strategy - Greedy

slides(pptx) and slides(pdf) and handout and solution

24 Jan

Greedy Algorithms 3

slides (pptx) and slides (pdf) and slides (ink) and video

25 Jan

26 Jan

27 Jan

Divide and Conquer

K&T 5.1-5.4 and slides (pptx) and slides (pdf) and slides (ink) and video

28 Jan

29 Jan

Multiplication (Matrix, Integer)

k&T 5.5-5.6 and slides (pptx) and slides (pdf) and slides (ink) and video

HW3 Greedy

30 Jan

S4 Problem Solving Strategy - Divide and Conquer

slides(pptx) and slides(pdf) and handout and solution

31 Jan

Median, Quicksort

K&T 13.5 and slides (pptx) and slides (pdf) and slides (ink) and video

1 Feb

2 Feb

3 Feb

Dynamic Programming 1

K&T: 6.1-6.2 and slides (pptx) and slides (pdf) and slides (ink)

4 Feb

5 Feb

Dynamic Programming 2

K&T: 6.3-6.6 and slides (pptx) and slides (pdf)

HW4 Divide and Conquer

6 Feb

S5 Problem Solving Strategy - Dynamic Programming

slides(pptx) and slides(pdf) and handout and solution

7 Feb

Dynamic Programming 3

K&T: 6.8-6.10 and slides (pptx) and slides (pdf)

8 Feb

9 Feb

10 Feb

Network Flow

K&T: 7.1 and slides (pptx) and slides (pdf) and slides (ink)

11 Feb

12 Feb

MaxFlow/MinCut

K&T: 7.2-7.3 and slides (pptx) and slides (pdf) and slides (ink)

13 Feb

S6 Midterm Review

slides(pptx) and slides(pdf) and handout and solution

14 Feb

Network Flow in Polynomial Time

slides (pptx) and slides (pdf) and slides (ink)

HW5 Dynamic Programming

15 Feb

16 Feb

17 Feb

Presidents Day
(no class)

18 Feb

19 Feb

Midterm (6:00pm-7:30pm, no class meeting)

20 Feb

S7 Network Flow

slides(pptx) and slides(pdf) and handout and solution

21 Feb

Applications of MaxFlow/Mincut 1

slides (pptx) and slides (pdf) and slides (ink)

22 Feb

23 Feb

24 Feb

Applications of MaxFlow/Mincut 2

slides (pptx) and slides (pdf)

25 Feb

26 Feb

Linear Programming 1

slides (pptx) and slides (pdf)

HW6 DP and Network Flow

27 Feb

S8 Algorithm Toolbox - Linear Programming

slides(pptx) and slides(pdf) and handout and solution

28 Feb

Linear Programming 2; Duality

slides (pptx) and slides (pdf)

1 Mar

2 Mar

3 Mar

NP-Completeness 1

4 Mar

5 Mar

NP-Completeness 2

6 Mar

S9 NP Completeness

HW7 Network Flow and Linear Programming

7 Mar

NP-Completeness 3; Approximation Algorithms

8 Mar

9 Mar

10 Mar

Linear Programming Algorithms

11 Mar

12 Mar

Dealing with NP-Completeness; SAT Solvers

HW8 Hardness

13 Mar

S10 Review

14 Mar

Courses end

Finale