CS210: Intermediate Computing with Data Structures
Credits: 4
Catalog 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. CS 210L and IT 210L are the same course.
Current & Upcoming Offerings
2025-2026
Fall 2025 11 sections
| Section | Schedule / Time | Instructor | Location |
|---|---|---|---|
| 01 |
TuTh 12:30PM - 01:45PM
|
Iyer, Swaminathan Raghunathan |
Y02-2120
|
| 01D |
Tu 11:00AM - 12:15PM
|
Iyer, Swaminathan Raghunathan |
W01-0044
|
| 02 |
MW 05:30PM - 06:45PM
|
Vaish, Sankalp |
M02-0116
|
| 02D |
Th 11:00AM - 12:15PM
|
Iyer, Swaminathan Raghunathan |
M01-0418
|
| 03 |
TuTh 05:30PM - 06:45PM
|
TBA |
M02-0116
|
| 03D |
Tu 02:00PM - 03:15PM
|
Iyer, Swaminathan Raghunathan |
W01-0046
|
| 04D |
Th 02:00PM - 03:15PM
|
Iyer, Swaminathan Raghunathan |
W01-0044
|
| 05D |
M 07:00PM - 08:15PM
|
Vaish, Sankalp |
M01-0418
|
| 06D |
W 07:00PM - 08:15PM
|
Vaish, Sankalp |
M01-0418
|
| 07D |
Tu 07:00PM - 08:15PM
|
TBA |
W01-0055
|
| 08D |
Th 07:00PM - 08:15PM
|
TBA |
W01-0055
|
Spring 2026 10 sections
| Section | Schedule / Time | Instructor | Location |
|---|---|---|---|
| 01 |
TuTh 02:00PM - 03:15PM
|
Iyer, Swaminathan |
Y02-2120
|
| 01D |
Tu 12:30PM - 01:45PM
|
Iyer, Swaminathan |
W01-0044
|
| 02 |
MW 04:00PM - 05:15PM
|
Saadat, Saied |
M02-0116
|
| 02D |
Th 12:30PM - 01:45PM
|
Iyer, Swaminathan |
M02-0616
|
| 03D |
Tu 04:00PM - 05:15PM
|
Iyer, Swaminathan |
M01-0608
|
| 04D |
Th 04:00PM - 05:15PM
|
Iyer, Swaminathan |
M02-0206
|
| 05D |
M 05:30PM - 06:45PM
|
Saadat, Saied |
W01-0061
|
| 06D |
W 05:30PM - 06:45PM
|
Saadat, Saied |
W01-0061
|
| 07D |
Tu 09:30AM - 10:45AM
|
Iyer, Swaminathan |
W01-0046
|
| 08D |
Th 09:30AM - 10:45AM
|
Iyer, Swaminathan |
W01-0061
|
Prerequisites
- CS 110 or CS/IT 115L with a grade of C- or better and MATH 130 or permission of instructor.
Intermediate course in intermediate computing with data structures covering data structures, recursion, and algorithmic problem solving.