Catalog Course Search Details

 Department:    CS

 Course #:    211

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    110201

 EPC:    515

 REV:    2024

 Course Description  

This course is a continuation of CS 210. The successful student will be able to read and write C++ code containing recursion and abstract data types (ADTs) such as stacks, queues, linked lists, binary trees, lists, sets and maps. Students will utilize OOP concepts such as encapsulation, inheritance and polymorphism while implementing data structures themselves, or using components from the Standard Template Library.

 Prerequisite  

Prerequisite: CS 210 with a grade of "C" or higher; and either MATH 099 with a grade of "C" or higher (or placement into MATH& 141).

Contact Hours (based on 11 week quarter)

Lecture: 55

Lab: 0

Other: 0

Systems: 0

Clinical: 0

Intent: Distribution Requirement(s) Status:  

Academic Elective  

Equivalencies At Other Institutions

Learning Outcomes

After completing this course, the student will be able to:

1. Read and write C++ code containing pointers and dynamic memory allocation.
2. Read and write recursive C++ code.
3. Read and write C++ code that searches and sorts arrays.
4. Read and write C++ code that uses data abstraction and encapsulation to process stacks, queues, and linked lists. May also include binary search trees.
5. Read and write C++ code that uses inheritance.
6. Read and write C++ code that uses polymorphism.

General Education Learning Values & Outcomes

Revised August 2008 and affects outlines for 2008 year 1 and later.

Course Contents

1. Pointers and dynamic memory allocation.
2. Recursion.
3. Searching and Sorting arrays.
4. Data abstraction/encapulation to process stacks, queues, linked lists and binary trees.
5. Alorithm analysis.
6. Regular writing of code programs that meet given specifications.
7. Regular reading and interpreting of C++ code segments and programs.
8. Inheritance and polymorphism.