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:

• Advanced Algorithm Design and Analysis Techniques,
• Computational Complexity, and
• Selected additional topics.

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:

• Introduction to Algorithms, Third Edition, Cormen, Leiserson, Rivest, and Stein, McGraw-Hill.

Instructor: Prof. Lynne E. Parker

• Office: Claxton 220
• Email: parker at eecs.utk.edu
• Office Hours: Tues/Thurs, 4-5PM, or send email for appointment, or stop by whenever instructor is in.

• Office: Claxton 110D
• Email: kkabir@eecs.utk.edu
• Office Hours: Mondays, 11-1

• Office: Claxton 124
• Email: jhoare@eecs.utk.edu
• Office Hours: Wednesdays, 1-3

Class Mailing List: TBA