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. 

This course has a required co-requisite lab - CS 230L.

A student is required to have confirmation of authorization from the CS 111 faculty that is based on the mastery of the CS 111 concepts in order to enroll in CS 230. Students who did not take CS 111 at Wellesley and who wish to enroll in CS 230 should contact the CS department to take a placement questionnaire.

Units: 1

Max Enrollment: 24

Prerequisites: CS 111 or permission of the instructor

Instructor: Staff

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.

CS 230L
CS 230L - Lab: Data Structures

Accompanying required laboratory for CS 230.

The grading option chosen for the lecture (CS 230) - either Letter Grade or Credit/Non Credit - will apply to the lab as well; the final grade is a single unified grade for both lecture and lab and is based on the grading option you choose for the lecture.

Units: 0

Max Enrollment: 15

Prerequisites: None.

Instructor: Staff

Typical Periods Offered: Fall and Spring

Semesters Offered this Academic Year: Spring

Notes:

CS 230P
CS 230P - 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 *additional self-driven weekly programming practice using the Java programming language.

Students are required to attend an additional two-hour laboratory section each week. CS 230P is open to all students who did not meet the prerequisites for CS 230, or for students who took CS 111 before the last semester, or students who would appreciate additional academic support because of their prior MATH and CS experience. Class meetings are followed by a 30-minutes practice session to provide for extra time to work with the instructor after class.


This course has a required co-requisite laboratory - CS 230PL.

Units: 1

Max Enrollment: 36

Prerequisites: CS 111 or permission of the instructor.

Instructor: Metaxas

Distribution Requirements: MM - Mathematical Modeling and Problem Solving

Typical Periods Offered: Fall and Spring

Semesters Offered this Academic Year: Fall

Notes:

CS 230PL
CS 230PL - Lab: Data Structures

This is a required co-requisite laboratory for CS 230P.

The grading option chosen for the lecture (CS 230P) - either Letter Grade or Credit/Non Credit - will apply to the lab as well; the final grade is a single unified grade for both lecture and lab and is based on the grading option you choose for the lecture.

Units: 0

Max Enrollment: 12

Prerequisites: CS 111 or permission of the instructor.

Instructor: Metaxas

Typical Periods Offered: Fall

Semesters Offered this Academic Year: Fall

Notes:

CS 230X
CS 230X - 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.

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: