CS 201 - Computer Science II

Units: 4
Further development of programming and problem solving skills in the C++ programming language. Topics include Abstract Data Types (ADTs), data structures (stacks, queues, trees), and object oriented design. Sorting and searching algorithms. Lecture Units: 3; Lab Units: 1.

Prerequisites: CS 101 with grade C- or better.
Equivalent Quarter Course: CS 2370.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F grading only.
Course Typically Offered: Fall & Spring

Student Learning Outcomes - Upon successful completion of this course students will be able to:

Design a class to describe objects of a particular domain;
Describe common applications for data structures such as stacks, queues and trees;
Choose the appropriate data structure for modeling a given problem;
Implement a program given design specifications;
Compare and contrast the efficiency of basic sorting and searching algorithms using asymptotic notation.