CS 3310 - Design and Analysis of Algorithms (3)

Algorithms for fundamental problems. Efficiency analysis using asymptotic notation. Principal algorithm design techniques and their tradeoffs. NP-theory and approaches used to address intractability.

Prerequisite(s): CS major or CS minor, and C or better in CS 2400 and STA 2260; or consent of instructor.
Grading Basis: Graded Only
Repeat for Credit: May be taken only once
When Offered: Fall, Spring, Summer, Winter
Course Category: Major Required Course