|
Dec 28, 2024
|
|
|
|
2018-2019 Undergraduate Catalog [ARCHIVED CATALOG]
|
CS 210L - Intermediate Computing with Data Structures 4 Credit(s) | Lecture | Course can be counted for credit once
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.
Course Attribute(s): Distribution Area: Mathematics and Technology
Enrollment Requirements: Prerequisites:
or permission of instructor.
013066:1
|
|