CS581: Advanced Design and Analysis of Algorithms

Spring 2011

Claxton 206
Tuesdays and Thursdays 5:05-6:20 PM

CS581 home page Syllabus Schedule/Readings Homework Assignments Exam Study Guides

Course Description: CS581 covers the analysis of algorithms and the relevance of analysis to the design of efficient computer algorithms. These topics are presented in 3 parts:

(This course focuses on a rigorous treatment of the theory of algorithms; it does not involve programming.)

Prerequisites: Fundamental algorithms and data structures (CS302 or equivalent) and discrete mathematics (CS311 or equivalent). This background should include a working knowledge of sorting techniques, stacks, queues, lists, hash tables, heaps, B-trees, binary search trees, red-black trees, recursion, set theory, graph theory, counting and probability theory, basic calculus, and proofs by mathematical induction.

Required Textbook:

Instructor: Prof. Lynne E. Parker

TA #1: Khairul Kabir (20 hrs/week) TA #2: John Hoare (10 hrs/week)

Class Mailing List: TBA

Last updated: January 12, 2011