Intermediate Computing with Data Structures
Course #: CS 210, Class #: 1499, Section #: 01
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.
Prerequisites
CS 110 or CS/IT 115L with a grade of C- or better and MATH 130 or permission of instructor
Course Details
Date / Time
1/25/27 - 5/12/27
TuTh 2p.m. – 3:15p.m.
Location
Wh-Peters W01-0088 Snowden Aud
Credits
4
Session
Regular Academic Session
Class Dates
1/25/2027 - 5/12/2027
Location
Wh-Peters W01-0088 Snowden Aud
General Ed Requirements
Mathematics and Technology
Enrolled / Capacity
0 / 80
Status
Open