|CS581 home page||Syllabus||Schedule/Readings||Homework Assignments||Piazza Discussions||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:
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.
Instructor: Prof. Lynne E. Parker
Class Mailing List: via Blackboard