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): Computer Science major; C or better in CS 241 or CS 2400; C or better in MAT 208 or MAT 2250, STA 326, or STA 2260; or consent of instructor.
Component(s): Lecture
Grading Basis: Graded Only
Repeat for Credit: May be taken only once