Detailed Course Information |
Summer 2012
Apr 23, 2024 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CSCI 347 - Analysis of Algorithms |
|
A presentation of asymptotic time and space complexity of sequential and parallel algorithms, using big-O and related notation. Complexity classes P and NP (tractable and intractable problems) and verification of algorithms by formal methods are also discussed.
Prerequisites: CSCI 271 Data Structures and MATH 292 Discrete Mathematics I.
1.000 Credit hours 4.000 Lecture hours Levels: Non-Matriculated, Post-Baccalaureate Tchr Lcnse, Undergraduate Schedule Types: Independent/Directed Study, Lecture Computer Science Department Course Attributes: Undergraduate Level Course Prerequisites: PREREQ for CSCI 347 General Requirements: ( May not be taken concurrently. ) or ( May not be taken concurrently. ) or ( Course or Test: CSCI 271 May not be taken concurrently. and Course or Test: MATH 292 May not be taken concurrently. ) |
| Return to Previous | New Search |
|