CS3510 Algorithms Fall 2023 3:30-4:45PM Klaus 1443

People

• Lecturer: Abrahim Ladha
• TAs:
  • Saigautum Bonam
  • Himanshu Goyal
  • Aditya Kumaran
  • Saahir Dhanani
  • Rohit Arunachalam
  • Tejas Pradeep
  • Josh Chen
  • Adam Zamlynny
  • Richard Zhang
  • Diksha Holla
• For office hour times, see the schedule on canvas. They are subject to change.
• Office hours are located in CCB 331, the third floor of the CoC building, across the Klaus bridge.
• My Office is in Klaus 3125, third floor.

Course Information

Welcome to introductory algorithms. We have four main sections.

• Divide and Conquer
• Graph Algorithms
• Dynamic Programming
• NP-completeness

We will follow the book Algorithms by Dasgupta, Papadimitriou, and Vazirani but there are other excellent books. These include the CLRS book, the Klienberg Tardos book, and Algorithms by Erickson. I will mostly post reading from DPV and occasionally from CLRS. It is expected you read these sections along with the posted notes.

Evaluation

• Five exams, including the final, each worth 20%
• Your lowest exam score is dropped effectively making the final optional
• Problem sets, worth 20%
• You may turn in homework late no more than five total days in the semester and no more than two per assignment.

This is subject to change as I realize what takes more or less time.

Statement of Intent for Classroom Inclusivity

As a member of the Georgia Tech community, I am committed to creating a learning environment in which all of my students feel safe and included. Because we are individuals with varying needs, I am reliant on your feedback to achieve this goal. To that end, I invite you to enter into dialogue with me about the things I can stop, start, and continue doing to make my classroom an environment in which every student feels valued and can engage actively in our learning community.