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.

CS230X is intended for students with significant prior experience in Java programming as demonstrated by a 5 in CS AP A, or equivalent demonstration of experience. Students in this section will complete self-directed weekly labs. If you did not take the CS AP A exam and would like to take this class, you may take the CS placement questionnaire to see if you qualify.

Units: 1

Max Enrollment: 24

Prerequisites: CS 111 or permission of the instructor.

Instructor: Grevet Delcourt

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Fall

Semesters Offered this Academic Year: Fall

Notes: