Design and Analysis of Algo.              CS311


cs department


Course reviews will be shown here


Credits: 3 (3,1,0) Prerequisite: CS 285
The course examines techniques for designing algorithms, analyzing them, and proving their correctness. Algorithm design paradigms, such as, greedy, divide-and-conquer, backtracking, dynamic programming, and randomization are studied. Time and space complexity classes and an introduction to NP-completeness are covered as well.

Course content

Request invitation

Content of this course is available by invitation only. You can not access this course if you don't have an invitation from the course instructor.

Get Started

Interested? Start your first course right now.

There is more to learn