Location: CCB 16

Office hours: TBA. No office hours during first week.

Instructor: Jan van den Brand

TA:

It is your responsibility to check Piazza for assignments, announcements, and review material.

Canvas is only used for grades and linking to Piazza and Gradescope.

Here is a list of good books/resources if you are interested in further reading:

- “Algorithms” by Dasgupta, Papadimitriou, and Vazirani
- “Algorithms” by Erickson. Free version at https://jeffe.cs.illinois.edu/teaching/algorithms
- “Algorithm Design” by Kleinberg and Tardos
- “Introduction to Algorithms” by Cormen, Leiserson, Rivest, and Stein
- “Algorithms Illuminated” by Roughgarden: videos at http://www.algorithmsilluminated.org
- CS 3510 lecture videos by Abernethy at https://gt-cs-3510.github.io/

- There will be 5 exams, 1 hour each. For exam dates, see schedule at the end of the syllabus.
- The exams will take place during the usual lecture time (12:30-1:45) in the usual lecture hall (CCB 16). The 5th exam is during the final exam week and will also take place 12:30-1:45.

The questions will be theory/proof-based problems but there will also be the occasional programming assignments (ie implement an algorithm).

- You are encouraged to collaborate and work in groups, but you must write your own solutions. You must write the names of students you worked with on your homework.
- You may look up reference material online and in textbooks to help with your homework but you may not look up, copy, or paraphrase answers to homework questions.
- We will use Gradescope for submission and grading.
- Solutions must be properly typed pdf. Handwritten solutions will not be accepted. LaTeX (via overleaf or otherwise) is strongly recommended.

- Late-submission of homework:

You can have a total of 8 late days (~1 per problem set) throughout the semester that you can use to submit problem sets late. You can use up to 2 late days per problem set. Any partial day counts as a full day. This budget of 8 late days is intended for events like unexpected illness, but any reason for late submission is fine and you do not need to justify/explain the late submission. - Re-take exam:

If you missed one of the first four exams for extreme circumstances that were out of your hand (e.g., sickness), then you can retake that exam during the last day of class. You cannot retake more than one exam. You cannot retake the 5th/final exam.

Please contact us as soon as possible when it is clear that you cannot take an exam.

https://disabilityservices.gatech.edu/.

- The final grade will be a weighted average of exams (80%) and homework (20%).
- The worst exam grade is dropped. If you are happy with the grade of your first 4 exams, the 5th exam is effectively optional.
- The average will determine your final grade. Grade thresholds are A - 90%, B - 80%, C - 70%, D - 60%. The thresholds may change in the future, but they can only change in your favor.
- We may reduce the maximum number of points of problem sets/exams, meaning you can reach 100% even with small mistakes. However, the score is capped at 100% per problem set/exam.

https://policylibrary.gatech.edu/student-life/academic-honor-code.

Penalties for academic misconduct include getting a zero for an assignment or for the course, see here:

https://osi.gatech.edu/process/academic-misconduct-sanctioning-guidelines.

Divide and Conquer |

Graph algorithms |

Dynamic Programming |

NP Completeness |

Other Topics (linear programs, approximation, and/or randomness) |

Tue | Thu | |||

01/09 | Big-O | 01/11 | Divide&Conquer | |

01/16 | Divide&Conquer | 01/18 | Divide&Conquer | |

01/23 | Review | 01/25 | Exam 1 | |

01/30 | Graph Algorithms | 02/01 | Graph Algorithms | |

02/06 | Graph Algorithms | 02/08 | Graph Algorithms | |

02/13 | Review | 02/15 | Exam 2 | |

02/20 | Dynamic Programming | 02/22 | Dynamic Programming | |

02/27 | Dynamic Programming | 02/29 | Dynamic Programming | |

03/05 | Review | 03/07 | Exam 3 | |

03/12 | P, NP, Complexity | 03/14 | P, NP, Complexity | |

03/19 | Spring Break | 03/21 | Spring Break | |

03/26 | P, NP, Complexity | 03/28 | P, NP, Complexity | |

04/02 | Review | 04/04 | Exam 4 | |

04/09 | Open Topics | 04/11 | Open Topics | |

04/16 | Open Topics | 04/18 | Open Topics | |

04/23 | Review (Retake exam) | 04/25 | No class (exam period) | |

04/30 | No class (exam period) | 05/02 | Exam 5 |