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.

Notes

Does not fulfill the laboratory requirement.

Instructor

Metaxas, Shaer

Prerequisites

CS 111 or CS 118 [2012-13] or permission of the instructor. Students who received a grade of C+ or lower in CS 111 or CS 118 [2012-13] must contact the instructor before enrolling.

Unit(s)

1.0

Semesters Offered

Fall, Spring

Degree Requirements

MM
RELATED

Departments and Programs