Schedule
Tue-Thu, 11:30 AM - 12:45 PM (8/31/2009 - 12/22/2009) Location: MAIN HH 113
Tue-Thu, 11:30 AM - 12:45 PM (8/31/2009 - 9/11/2009) Location: MAIN HH 113
Description
COMP 422. THEORY OF ALGORITHMS. Topics include fundamental techniques for designing efficient algorithms and basic mathematical methods for analyzing their performance; paradigms for algorithm design; divide-and-conquer, greedy methods, graph search techniques, dynamic programming; design of efficient data structures, and analysis of the running time and space requirements of algorithms in the worst and average cases. Prerequisite: Computer Science 222 and Mathematics 213. Fall semester only, three hours.