Detailed Course Information |
Fall 2026 Semester
Nov 15, 2026 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 2700 - Data Structures and Analysis |
|
Introduces data structures and analysis. Investigates abstract data types, recursion, algorithms for searching and sorting, and basic algorithm analysis. Covers abstract data types (ADTs)including arrays, linked lists, stacks, queues, priority queues, trees, and hash tables. Demonstrates ADT operations such as insert, remove, and find. Examines the trade-offs associated with ADT choices for a given application and the trade-offs associated with array-based implementations compared to linked implementations. Offers students an opportunity to apply core concepts by implementing their own data structures and developing applications that use them.
4.000 Credit hours 4.000 Lecture hours Levels: Undergraduate Schedule Types: Lecture Computer Science Department Course Attributes: Computer&Info Sci Restrictions: Must be enrolled in one of the following Levels: Undergraduate Corequisites: CS 2701 Prerequisites: (Undergraduate level CS 1800 Minimum Grade of D- or Undergraduate level MATH 1365 Minimum Grade of D- or Undergraduate level MATH 1465 Minimum Grade of D- or Undergraduate level MATH 209M Minimum Grade of D-) and (Undergraduate level CS 2100 Minimum Grade of D- or Undergraduate level CIS 201M Minimum Grade of D-) |
| Return to Previous | New Search |
|