Detailed Course Information |
2024 Fall
Jul 16, 2025 |
|
 |
||
 | Select the desired Level or Schedule Type to find available classes for the course. |
| CS 210 - Data Structures and Abstractions |
|
This course introduces data abstraction, data structures and their implementations, the basics of algorithmic analysis, and the fundamental computing algorithms. Topics include stacks, queues, heaps, recursion, Master Theorem, asymptotic notation, computational complexity, empirical performance measurement, recursion based sorting algorithms, hashing, and trees (including binary trees, B-trees, and AVL trees).
*** Prerequisite: CS 115 and MATH 110 ***
0.000 OR 3.000 Credit hours 0.000 OR 3.000 Lecture hours 0.000 OR 2.000 Lab hours Levels: Undergraduate Schedule Types: Lecture, Lab, Examination All Sections for this Course Computer Science Department Restrictions: Must be enrolled in one of the following Levels: Undergraduate Graduate |
| Return to Previous | New Search |
|