Detailed Course Information

Select the desired Level or Schedule Type to find available classes for the course.

CS 412 - Algorithm Analysis
A formal algorithmic language. Measures of complexity for time and space. Worst-case, average-case, and best-case analysis. Lower and upper bounds of algorithms (techniques include comparison trees, adversary arguments, and reduction). P and NP classes. NP-hardness and NP- completeness. Introduction to parallel computational models and algorithms. * Prerequisite: CS 310 and 340 * 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture, Examination Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate

CS 412 - Algorithm Analysis

A formal algorithmic language. Measures of complexity for time and space. Worst-case, average-case, and best-case analysis. Lower and upper bounds of algorithms (techniques include comparison trees, adversary arguments, and reduction). P and NP classes. NP-hardness and NP- completeness. Introduction to parallel computational models and algorithms. *** Prerequisite: CS 310 and 340 ***
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture, Examination

Computer Science Department

Restrictions:
Must be enrolled in one of the following Levels:
Undergraduate
Graduate

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

UR Self-Service

Detailed Course Information

© 2024 Ellucian Company L.P. and its affiliates.