CS 5633 Analysis of Algorithms
Spring 12
http://www.cs.utsa.edu/~carola/teaching/cs5633/spring12
[ Home | Schedule | Policies | Slides, pictures | Homework | Resources ]

Home

News:

    The grades are up on Blackboard.

    Thank you for a fun semester. And enjoy your 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.

Prerequisites:

CS 3343 Analysis of Algorithms

Time & Place:

Tuesdays, Thursdays 8:30pm - 9:45pm, MB 0.302

Required Textbook:

Introduction to Algorithms, 3rd Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press.
(The older editions are very similar, however one or two chapters are missing, and chapter numbers and exercise numbers are switched around. If you opt to use an older edition it is your responsibility to keep up with those differences. Links to free ebooks of older editions of the book are available on the Resources page.)

Instructor:

Carola Wenk
SB 4.01.17
E-mail: carola at  cs.utsa.edu
Phone: 458-4501
Office hours: Tuesdays 3pm-4:30pm, Thursdays 6pm - 7:30pm, and by appointment

Teaching Assistant:

Mahmuda Ahmed
SB 1.04.02
E-mail: mahmed at cs dot utsa dot edu
Office hours: Wednesdays 6pm-7pm, and by appointment


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