Instructor 

Jamie Sikora 

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

Office hours: 

• 9:30am-12pm Thursdays in Torgersen 2160E

• Immediately after lectures (outside Derring Hall 3081)

• Other times and Zoom options available upon request

Teaching Assistants

Ankith Mohan (GTA), ankithmo@vt.edu

Office hours: 2pm-4pm Thursdays in Torgersen 1120

Janna Helvey (UTA), jhelves@vt.edu

Office hours: 11am-1pm Fridays in Torgersen 1120

Aidan Flinton (UTA), aidanflinton@vt.edu

Office hours: 1pm-3pm in Torgersen 1120

👍 Rule of thumb: Use Piazza to post questions about assignments, clarifications about exam questions, and general questions about course content. 

🧑‍🏫 Lectures: Tuesdays and Thursdays @ 8:00am - 9:15am in Derring Hall 3081

📑 Syllabus: The rest of the course information can be found here: syllabus pdf

• Classes begin: Jan 21

•  Assignment 1: out Jan 27, due Feb 07 

• Assignment 2: out Feb 10, due Feb 21 

• No lectures/office hours: Feb 22-28

• Assignment 3: out Feb 24, due Mar 07 

• Spring Break: Mar 08-16 

• Midterm exam: out Mar 18, due Mar 22

• Assignment 4: out Mar 25, due Apr 05

• Assignment 5: out Apr 07, due Apr 18

• Assignment 6: out Apr 21, due May 03  

• Final exam: out May 05, due May 09

• Classes end: May 07

• Reading Day: May 08 

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)