CS 580: Algorithm Design, Analysis, And Implementation
Spring 2010  

     
The course gives a broad introduction to the design and analysis of algorithms. Topics to be covered include  recurrences, sorting and order statistics, dynamic programming, greedy algorithms,advanced data structures, applications of data structures, lower bound techniques, graph searching and graph algorithms, string algorithms, NP-completeness, approximation algorithms. 

 

Class Times

Tuesday, Thursday, 10:30-11:45, LWSN B134

 

Final Exam: Tuesday, May 4, 8-10 am, KRAN G018

Qual Supplemental Exam:  Friday, May 7, 9-10am, BRNG B222

   

 

Instructor

Professor S.E. Hambrusch

1179 Lawson, 494-1831;  seh@cs.purdue.edu
Office Hours:  Monday, 1:30-2:30, Thursday, 9:30-10:30, or by appointment

 

Teaching Assistant

Yongwook Choi

B116B Lawson,   ywchoi@purdue.edu

            Office Hours: Tuesday, 2-3pm, or by appointment
   

 

Course Material