CS 5633 Analysis of Algorithms

[ Home | Topics | Calender | Policies | Slides, pictures | Homework | Resources ]

Home

News:

  • The grades are up.
  • Thank you for a great semester. 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, 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:

M,W 8:30pm - 9:45pm, BB 3.03.14

Textbook:

Required text:
Introduction to Algorithms, Second Edition; Cormen, Leiserson, Rivest, and Stein; MIT Press, Boston, 2001.
Online resources for this book (pseudocodes, power point slides, ...) are available.

Instructor:

Carola Wenk
SB 4.01.36
E-mail: carola@cs.utsa.edu
Phone: 458-4501
Office hours: Tuesday 5pm - 6:30pm, Wednesday 6pm - 7:30pm, and by appointment


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