Introduction to Algorithms

CMPSCI 311, Spring 2018

Akshay Krishnamurthy


When: MW 4:00-5:15
Where: Goessmann Lab 64

Course Staff:

  • (Instructor) Akshay Krishnamurthy (Email: akshay at cs), Office hour: Monday 5:30-6:30 (CS 258)
  • (TA) Russell Lee (Email: rclee at cs), Office hour: Tuesday 1-2 (CS 207)
  • (TA) Jesse Lingeman (Email: lingeman at cs), Office hour: Wednesday 2-3 (CS 207)
  • (UCA) Stefan Grosser
  • (UCA) Ibrahim Shaheen, Office hour: Tuesday 12-1 (CS 207)
  • (UCA) Shuyang Wang

Textbook: The textbooks will be

Resources:

Grading: The grade breakdown is as follows:

Policies: You are expected to abide by the following policies:

  • Homework submission: Homework submissions are due at 11:59pm on the posted date in Gradescope. Please submit a pdf file. You may submit a scanned handwritten document, but a typed submission is preferred. If we cannot read your handwriting, then we cannot grade your solution.
  • Late submissions: Homework submissions received after 11:59 pm on the posted date will be considered late. You may submit your homework up to one day late (11:59pm on the day after the posted date) for half credit. Submissions received more than one day late will receive zero credit.
  • Collaboration: You may work in groups on the homeworks, but you must individually write up your solutions yourself. Violations of this policy fall under the scope of plagiarism and will be handled in accordance with the University's Academic Honesty policy. If you do discuss your solutions with others, list your collaborators on your submission.
  • Academic Honesty: You are expected to follow the University's Academic Honesty policy.

Homeworks, Exams, Material:

Schedule: Here is a tentative schedule for the course, including lecture and discussion dates, topics, dates that homework assignments are released and due, and the exam dates. I will update the links with pointers to the slides after each lecture and the links for homeworks and solutions will go live at the appropriate times.
Date Topics Readings Assignments
Lec 1 1/22 Introduction and Stable Matching Chapter 1
Lec 2 1/24 Algorithm Analysis and Asymptotics Chapter 2.1, 2.2 Hw 1 out
1/26 No discussion
Lec 3 1/29 Graphs I Chapter 3.1, 3.2
Lec 4 1/31 Graphs II Chapter 3.3-3.6
Dis 1 2/2
Lec 5 2/5 Greedy I Chapter 4.1
2/7 NO CLASS -- Snow day Hw 1 due, Hw 2 out
Dis 2 2/9
Lec 6 2/12 Greedy II Chapter 4.2
Lec 7 2/14 Greedy III Chapter 4.4, 4.5
Dis 3 2/16
2/19 NO CLASS -- President's Day
Lec 8 2/21 Greedy IV Chapter 4.5, 4.6 Hw 2 due, Hw 3 out
Dis 4 2/23
Lec 9 2/26 Divide and Conquer I Chapter 5.1-5.3
Lec 10 2/28 Divide and Conquer II Chapter 5.4, 5.5 Midterm, 7-9PM ISB 135
2/23 No Discussion
Lec 11 3/5 Divide and Conquer III
3/7 NO CLASS -- Snow day Hw 3 due
Dis 5 3/9
3/12 NO CLASS -- Spring Recess
3/14 NO CLASS -- Spring Recess
Lec 12 3/19 Dynamic Programming I Chapter 6.1, 6.2
Lec 13 3/21 Dynamic Programming II Chapter 6.4, 6.5 Hw 4 out
Dis 6 3/23
Lec 14 3/26 Dynamic Programming III Chapter 6.6-6.9
Lec 15 3/28 Dynamic Programming IV
Dis 7 3/30
Lec 16 4/2 Network Flow I Chapter 7.1, 7.2
Lec 17 4/4 Network Flow II Chapter 7.5 Hw 4 due, Hw 5 out
Dis 8 4/6
4/9 Midterm Review
4/11 No Lecture Midterm, 7-9PM ISB 135
4/13 No Discussion
4/16 NO CLASS -- Patriot's Day
Lec 18 4/17 Intractability I Chapter 8.1
Lec 19 4/18 Intractability II Chapter 8.2, 8.3 Hw 5 due, Hw 6 out
Dis 9 4/20
Lec 20 4/23 Intractability III
Lec 21 4/25 Randomized Algorithms Chapter 13.1, 13.2
Dis 10 4/27
Lec 22 4/30 Approximation Algorithms Chapter 11.1, 11.2
5/1 Hw 6 due
5/4 Final Exam