Course Description:
The course begins with a short review of basic analysis techniques:
approximating functions, asymptotically, bounding sums, and solving
recurrences. We will study problems that are efficiently solvable,
focusing on design techniques such as divide-and-conquer, dynamic
programming, amortization and greedy algorithms. Algorithms for
sorting, graph algorithms, string matching
algorithms, and geometric algorithms will serve to illustrate these
concepts.
The emphasis of this class will be on learning algorithm design: the
ability to synthesize correct and efficient procedures for new
problems. These skills are developed through written assignments containing
challenging exercises.
Prerequisites:
CS 3343
Time & Place:
T,TR 8:30pm - 9:45pm; Place: MB 0.222
Textbook:
Required text:
Introduction to Algorithms, 2nd Edition; Cormen, Leiserson,
Rivest, and Stein; MIT Press, Boston, 2001.
Instructor:
Carola Wenk
SB 4.01.36
E-mail:
carola@cs.utsa.edu
Phone: 458-4501
Office hours:
Tuesday, Thursday 6pm - 7:30pm, and by
appointment
Last modified by Carola Wenk,
carola @ cs.utsa.edu ,