Instructor 

Jamie Sikora 

Email: sikora@vt.edu (please include "4104" in the subject line)

Office hours: 

• TBA in Torgersen 2160E

• Immediately after lectures (outside Goodwin Hall 125)

• Other times and Zoom options available upon request

Teaching Assistants

Ankith Mohan (GTA), ankithmo@vt.edu

Office hours: TBA in Torgersen TBA

🧑‍🏫 Lectures: Mondays and Wednesdays @ 4:00pm - 5:15pm in Goodwin Hall 125

📑 Syllabus: The rest of the course information can be found here: syllabus pdf (last years, for reference)

• Classes begin: Jan 20 (Jan 21 for this course)

•  Assignment 1: out Jan 26, due Feb 06 

• Assignment 2: out Feb 09, due Feb 20 

• Assignment 3: out Feb 23, due Mar 06 

• Spring Break: Mar 07-15 (no lectures) 

• Midterm exam: out Mar 18, due Mar 20

• Assignment 4: out Mar 23, due Apr 03

• Assignment 5: out Apr 06, due Apr 17

• Assignment 6: out Apr 20, due May 01 

• Final exam: out May 04, due May 06

• Classes end: May 06

• Reading Day: May 07 

Introduction   (lecture slides)

Stable matchings   (lecture slides, Gale-Shapley demo)

Algorithm analysis   (lecture slides, binary search demos)

Graphs   (lecture slides) 

Greedy algorithms I - Scheduling   (lecture slides, job scheduling demo, lecture scheduling demo)

Greedy algorithms II - Shortest paths  (lecture slides, Dijkstra's demo)

Greedy algorithms III - Special trees   (lecture slides, Edmond's branching demo, red-blue algorithms)

Divide and conquer   (lecture slides)

Dynamic programming   (lecture slides) 

Network flows I - Introduction   (lecture slides, Ford-Fulkerson demo)

Network flows II - Applications   (lecture slides)

Intractability I - Reductions   (lecture slides)

Intractability II - NP   (lecture slides) 

Linear programming   (lecture slides)