CS 210 - Intermediate Computing with Data Structures

Formerly CS 210L
4 Credit(s) | Lecture and Discussion | Graded (includes P/F option)
Not repeatable for credit

Description:
The design and implementation of computer programs in a high-level language, with emphasis on proper design principles and advanced programming concepts, including dynamic data structures and recursion. The assignments are designed to introduce the student to a variety of topics in computing: data structures and ADTs, Lists, Stacks, Queues, Ordered Lists, Binary Trees, and searching and sorting techniques.

Course Note
Students cannot receive credit for both CS 210 and IT 210.

Distribution Area: Mathematics and Technology
Enrollment Requirements:
Prerequisites:

CS 110 or CS /IT 115L and
MATH 130

or permission of instructor.

Semester(s) typically offered: Fall and Spring

013066:1