CS381 Introduction to the Analysis of Algorithms

Tu/Th 10:30 am - 11:45 am Wetherill Lab of Chemistry 172

Course staff

Instructor:

Elena Grigorescu, elena-g@purdue.edu

Office Hours: Tue 1-2pm LWSN 1209.

Graduate TAs:

• Tatiana Kuznetsova (head TA)
  tkuznets@purdue.edu,
  Office Hours: Wed 10:30-12, HAAS G50;
• Anudeep Reddy Dwaram,
  adwaram@purdue.edu,
  Office Hours: Thr 3-4:30, HAAS G50;
• Young-San Lin,
  lin532@purdue.edu,
  Office Hours: Mon 4-5:30; HAAS G50
• Runzhi Yang,
  yang1492@purdue.edu,
  Office Hours: Wed 4:30-6; HAAS G50.

Undergraduate TAs:

• Ryan Davis,
  davis791@purdue.edu,
  Office Hours: Mon 1:30-3:30, HAAS G50
• Shubhang Kulkarni,
  kulkar17@purdue.edu,
  Office Hours: Fri 10:30-12:30, HAAS G50.

(Check exceptions on piazza)

Announcements

Welcome to CS 381!

Syllabus

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 172.

Grading

• 20% homeworks
• 10% quizzes (possibly unannounced, lowest score will be dropped)
• 20% for each midterm
• 30% final.

Useful additional material

MIT slides

MIT Intro to algorithms

MIT OpenCourseWare

Slides for Kleinberg-Tardos textbook

Coursera's algorithms course

TCS cheat sheet

Academic integrity policy. Purdue general policies.
(Read them carefully)