## CS 473, Spring 2023

## Algorithms

### Course Staff

**Instructor:**
Timothy Chan
(tmc)
**TAs:**
Tanvi Bajpai (tbajpai2),
Christian Howard (howard28)

**CAs:**
Changsheng Chen (cc81),
Yirong Chen (yirongc3),
Sam Ruggerio (samuelr6),
David Yao (dyyao2)

### Lecture Time/Place

Tue & Thu 2:00pm-3:15pm, Siebel 1404
### Office Hours

- Mon 3:00-4:00 Christian
- Tue 3:30-4:30 Timothy
- Wed 3:00-4:00 Tanvi
- Fri 3:00-4:00 Sam (note the change)

All office hours to be held in the open lounge area on the 3rd floor of Siebel (outside of 3240).
### Administrivia

### Homework

- Homework 0 (not graded)
[solutions]
- Homework 1 (due Feb 1 Wed 9pm)
[.tex]
- Homework 2 (due Feb 8 Wed 9pm)
- Homework 3 (due Feb 15 Wed 9pm)
- Homework 4 (due Mar 1 Wed 9pm)
- Homework 5 (due Mar 8 Wed 9pm)
- Homework 6 (due Mar 22 Wed 9pm)
- Homework 7 (due Mar 29 Wed 9pm)
- Homework 8 (due Apr 12 Wed 9pm)
- Homework 9 (due Apr 19 Wed 9pm)
- Homework 10 (due Apr 26 Wed 9pm)

### Exams

- Midterm 1 (Feb 20 Mon 7pm-9pm)
- Midterm 2 (Apr 3 Mon 7pm-9pm)
- Final Exam (TBA)

### About the Course

CS 473 (also cross-listed as Math 473 and CSE 414) is an algorithms course aimed at advanced undergraduates and graduate students in computer science and related disciplines. The course covers a wide range of topics in algorithm design and analysis, including the following:
- Divide-and-conquer (such as FFT)
- Dynamic programming
- Randomized algorithms
- Optimization: matching, network flow, linear programming
- NP-completeness and reductions
- Approximation algorithms

*Prerequisites*: CS/ECE 374 or equivalent, or graduate standing
(see things you should already know)
### Lectures

Although lectures will be recorded, it is expected that students will attend most of the lectures. Recordings may be accessed on mediaspace for registered students.
I will provide scribbles from class, and some links to relevant resources, below. There is no textbook, but Jeff's book and notes
are excellent. (Other useful general resources can be found here.)