Go to Main Content

 

 

HELP | EXIT

Detailed Course Information

 

Spring 2024
Apr 16, 2024
Transparent Image

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

Restrictions:
Must be enrolled in one of the following Levels:     
      Undergraduate
Must be enrolled in one of the following Campuses:     
      Reynolda Campus (UG)

Prerequisites:
Undergraduate level CSC 221 Minimum Grade of D- and (Undergraduate level MST 111 Minimum Grade of D- or Undergraduate level MST 112 Minimum Grade of D- or Undergraduate level MTH 111 Minimum Grade of D- or Undergraduate level MTH 112 Minimum Grade of D-)

Return to Previous New Search
Transparent Image
Skip to top of page
Release: 8.7.2.4