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, Second Edition, Cormen, Leiserson, Rivest, and Stein, McGraw-Hill.

Instructor: Prof. Lynne E. Parker

• Office: Claxton 220
• Email: parker at cs.utk.edu
• Office Hours: Tues. and Thurs., 12:30 -- 1:30 PM or send email for appointment, or stop by whenever instructor is in.

• Office: Claxton 109b
• Email: klangst2 at utk.edu
• Office Hours: Wed. and Fri., 2:30 -- 3:30 PM

• Office: Claxton 125B
• Email: li at cs.utk.edu
• Office Hours: Mon. and Wed., 10:00 -- 11:00 AM

  Class Mailing List: cs581-students at cs.utk.edu