|
CSC 201 - Data Structures and Algorithms |
A study of fundamental data structures and the algorithms that act upon them. Data structure topics include the application, implementation, and complexity analysis of trees, hash tables, heaps, maps, sets, and graphs. Algorithmic topics include advanced sorting and searching methods and an introduction to divide-and-conquer and greedy techniques, graph algorithms, backtracking, and dynamic programming. P-CSC 112 and 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 MST 117 Minimum Grade of D- or Undergraduate level MTH 117 Minimum Grade of D-) |
Return to Previous | New Search |