Techniques for analyzing the time and space requirements of algorithms. Application of these techniques to sorting, searching, pattern-matching, graph problems, and other selected problems. Brief introduction to the intractable (NP-hard) problems.

Homepage	http://www.cs.purdue.edu/homes/seh/381web08/
Usually Offered:	Fall and Spring
Credit:	3 hours (class)
Prerequisite:	MA 261 and CS 251
University Catalog:	CS 381
Schedule:	Spring 2008 Instructor: Susanne E Hambrusch & Gopal Pandurangan