Detailed Course Information

CSC 221 - Data Structures and Algorithms I
Analysis, implementation, and application of abstract data structures such as lists, stacks, queues, trees, hash tables, heaps, and grabs. Complexity analysis of algorithms that operate upon these structures. P-CSC 112. P or C-MTH 117. (D) 3.000 Credit hours 3.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: Div CSC, Div V-CSC 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 112 Minimum Grade of D- and (Undergraduate level MTH 117 Minimum Grade of D- or Undergraduate level MST 117 Minimum Grade of D-)

CSC 221 - Data Structures and Algorithms I

Analysis, implementation, and application of abstract data structures such as lists, stacks, queues, trees, hash tables, heaps, and grabs. Complexity analysis of algorithms that operate upon these structures. P-CSC 112. P or C-MTH 117. (D)
3.000 Credit hours
3.000 Lecture hours

Levels: Undergraduate
Schedule Types: Lecture

Computer Science Department

Course Attributes:
Div CSC, Div V-CSC

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 112 Minimum Grade of D- and (Undergraduate level MTH 117 Minimum Grade of D- or Undergraduate level MST 117 Minimum Grade of D-)

Return to Previous	New Search

Return to Previous

New Search

Skip to top of page

Detailed Course Information		Spring 2024 Jul 27, 2024