CS 5633 Analysis of Algorithms
Spring 08

[ Home | Schedule | Policies | Slides, pictures | Homework | Resources ]

Home

News:

The grades are up.
Have a great summer!

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, 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 Analysis of Algorithms

Time & Place:

Tuesdays, Thursdays 5:30pm - 6:45pm, HSS 3.02.30

Required Textbook:

Introduction to Algorithms, 2nd Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press, Boston, 2001.
(The older edition is very similar, however one or two chapters are missing, and chapter numbers and exercise numbers are switched around. If you opt to buy the older edition it is your responsibility to keep up with those differences.)

Instructor:

Carola Wenk
SB 4.01.14
E-mail: carola at cs.utsa.edu
Phone: 458-4501
Office hours: Tuesdays, Thursdays 4pm-5pm and by appointment

Last modified by Carola Wenk, carola at cs.utsa.edu ,