CS381 Introduction to the Analysis of Algorithms

Fall 2019

Lectures: MWF 1:30 PM - 2:20 PM
                @ LILY G126

Course staff

Instructors:

  • Prof: Jeremiah Blocki,
    j + [lastname] AT purdue DOT edu
    Office Hours: Mon 2:30-3:30PM, Wed 5:30-6:30PM (See Piazza for updates and TA office hours)

Graduate TAs:


Undergraduate TAs:

  • Michael Cinkoske
  • Noah Franks
  • Hiten Arun Rathod
  • Abhishek Sharma
  • Himanshi Mehta
  • Utkarsh Jain
  • Darpan Tanna
Practice Study Observation
  • PSO1: Friday 11:30-1:20PM (LWSN B151)
  • PSO2: Thursday 1:30-3:20PM (HAAS G066)
  • PSO3: Tuesday 1:30-3:20PM (HAAS G066)
    • Announcements

    Welcome to CS 381!

    Texts
    • Algorithm design

      J. Kleinberg, E. Tardos. Pearson Education.

    • Intro to algorithms

      T. Cormen, C.Leiserson, R. Rivest, C. Stein. 3rd edition. MIT

    Class websites

    Gradescope for assigned homework and grades (Entry Code: MR5J6J)

    Blackboard clicker registration (Optional: CS580 Video Lectures).

    Piazza for class discussions.

    Course description
    The course gives a broad introduction to the design and analysis of algorithms. A tentative list of topics includes: sorting and order statistics; common algorithm design techniques, including divide-and-conquer, dynamic programming, and greedy; design and use of data structures; flows and cuts; lower bound techniques; graph algorithms; NP-completeness; randomized algorithms; approximation algorithms.

    Prerequisites: CS 251, CS 182.

    Grading
    • 5% clicker (bring your own)
    • 20% homework
    • 20% each midterm
    • 35% final.
    Schedule (subject to change)
    (two lectures will be cancelled to make-up for the evening exams)