CS 230
CS 230 - Data Structures

An introduction to techniques and building blocks for organizing large programs. Topics include: modules, abstract data types, recursion, algorithmic efficiency, and the use and implementation of standard data structures and algorithms, such as lists, trees, graphs, stacks, queues, priority queues, tables, sorting, and searching. Students become familiar with these concepts through weekly programming assignments using the Java programming language. Students are required to attend an additional two-hour laboratory section each week.

Units: 1

Max Enrollment: 26

Prerequisites: CS 111 or permission of the instructor.

Instructor: Bassem, Delcourt, Lerner, Metaxas

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Spring; Fall

Semesters Offered this Academic Year: Fall; Spring

Notes: Does not fulfill the laboratory requirement.