Catalog Entries

CSC 222 - Data Structures and Algorithms II
Study of algorithms, algorithm design strategies, and the derivation of time complexity bounds. Case studies illustrate greedy algorithms, divide and conquer, backtracking, and dynamic programming techniques. An introduction to the classes P, NP, NP-complete, and Turing decidability is included. P-CSC 221 and MTH 111 or 112. (QR) 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: QR

CSC 222 - Data Structures and Algorithms II

Study of algorithms, algorithm design strategies, and the derivation of time complexity bounds. Case studies illustrate greedy algorithms, divide and conquer, backtracking, and dynamic programming techniques. An introduction to the classes P, NP, NP-complete, and Turing decidability is included. P-CSC 221 and MTH 111 or 112. (QR)
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Computer Science Department

Course Attributes:
QR

Return to Previous	New Search		XML Extract

Skip to top of page

Catalog Entries		Spring 2024 Oct 15, 2024