|
Jun 02, 2024
|
|
|
|
CS 3310 - Design and Analysis of Algorithms (4) 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; C or better in CS 241 or CS 2400 ; and C or better in MAT 208, MAT 2250 , STA 326, or STA 2260 . Component(s): Lecture Grading Basis: Graded Only Repeat for Credit: May be taken only once Course Category: Major Course
Add to Portfolio (opens a new window)
|
|