The course gives a broad introduction the design and analysis of computer algorithms. Topics to be covered include: growth of functions, recurrences, sorting and order statistics, dynamic programming, greedy algorithms, fundamental and advanced data structures, applications of data structures, lower bound techniques, graph searching and graph algorithms, string matching, NP-completeness, approximation algorithms. Detailed syllabus.
Class Times: Monday, Wednesday, Friday, 9:30-10:20, LWSN B155.
FINAL EXAM: Thursday, December 17, 8-10am, BRNG 2280
Professor S.E. Hambrusch
1179 Lawson, 494-1831;
Office Hours: Tuesday, 2:30-3:30, Wednesday, 11-noon, or by appointment
Office hours: Monday 2-3, Friday 11-noon
B116 Lawson, firstname.lastname@example.org