CS580 Algorithm Design, Analysis, And Implementation


3 PM - 4:15 PM, Tue/Thu, FNY B124


Jeremiah Blocki, [jblocki AT purdue]

Office Hours: W/F 11AM to noon


Akash Kumar: [akash DOT mnnit AT gmail]

Office Hours: Mondays from 10 AM to 12 noon @ LWSN 3133

Hamidreza Amini Khorasgani: [haminikh AT purdue]

Office Hours: Tuesday/Thursday from 1-2PM @ HAAS G50


Welcome to CS 580!

Please sign-up on Piazza to ask/answer questions. We will send class announcements through this site.

  • Required: Algorithm Design

    J. Kleinberg, E. Tardos. Pearson Education.

    Book slides by Kevin Wayne

  • Recommended: Introduction to Algorithms

    T. Cormen, C.Leiserson, R. Rivest, C. Stein. MIT

LaTeX resources
  • Check here for pointers on LaTeX.
Course description
A tentative list of topics includes scheduling problems, minimum spanning tree problems, data compression, network flow, NP and computational intractability, approximation algorithms, randomized algorithms, sublinear algorithms.

Prerequisites: Mathematical maturity. Undergraduate algorithms (CS 381).

  • 20% for homework
  • 20% for the midterm 1
  • 20% for the midterm 2
  • 35% for the final
  • 5% for class participation.
Schedule (subject to change)
* Important: The final exam is scheduled by the university and the time/date may still be subject to change (within the range April 29 and May 4). See here for the current schedule. If the final exam time conflicts with another course you are taking please let the instructor know as soon as possible so that we can work out an alternative arrangement.
webpage designed by Will Perkins. Contact him if you'd like to use this template.