Tu/Th 12:00-1:15 pm, Beering Hall of Lib Arts & Ed 2280
Course staff
Instructor:
Elena Grigorescu,
elena-g purdue.edu
Office Hours: Mon 11am-12 LWSN 1209.
TA: Nabeel Butt, butt purdue.edu.
Office Hours: Tue 1:30-2:30pm LWSN 1168,
Thr 10-11am LWSN 3162
TA: Akash Kumar, akumar purdue.edu .
Office Hours: Wed 3-4pm LWSN 1168
Fri 10:30-11:30pm in LWSN 3162
(Check exceptions on piazza)
Announcements
HW 2 posted on Blackboard
Elena's and Nabeel's office hours have been slightly modified.
HW 1 posted on Blackboard.
Welcome to CS 381!
Texts
- Intro to algorithms
T. Cormen, C.Leiserson, R. Rivest, C. Stein. 3rd edition. MIT
- Recommended: Algorithm design
J. Kleinberg, E. Tardos. Pearson Education.
Class websites
Blackboard for assigned homework and grades.
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;
lower bound techniques, graph algorithms, NP-completeness, randomized algorithms, approximation algorithms.
Prerequisites: CS 251, CS 172.
Grading
- 15% homeworks (biweekly Psets)
- 15% quizzes (possibly unannounced, expect biweekly)
- 35% midterm
- 35% final.