Skagit Valley College logo

Catalog Course Search Details

This course has been changed from the previous catalog, the changed field(s) are highlighted in red:

 Course Title:   C++ Programming II

 Title Abbreviation:   C++ PROGRAMMING II

 Department:    CS

 Course #:    211

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    110201

 EPC:    515

 REV:    2013


 Course Description  

Continuation of CS 210. Topics include pointers, data structures, recursion, sorting and searching, basic algorithm analysis, inheritance and polymorphism. Additional topics may include GUIs, exception handling and file streams.

 Prerequisite  

Prerequisite: CS 210 or Permission of Instructor

Additional Course Details

Contact Hours (based on 11 week quarter)

Lecture: 55

Lab: 0

Other: 0

Systems: 0

Clinical: 0


Intent: Distribution Requirement(s) Status:  

Academic Quantitative  

Equivalencies At Other Institutions

Other Institution Equivalencies Table
Institution Course # Remarks
WSU CptS 122
WWU CSCI 145

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.

3. Communication

Definition: Understanding and producing effective written, spoken, visual, and non-verbal communication.

Outcomes: Students will be able to . . .
3.6 Recognize, comprehend, and use visual communication appropriate to a given context.

8. Mathematical Reasoning

Definition: Understanding and applying concepts of mathematics and logical reasoning in a variety of contexts, both academic and non-academic.

Outcomes: Students will be able to . . .
8.2 Correctly apply logical reasoning and mathematical principles to solve problems.

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 (weekly) design, code, test and debug of programs that meet given specifications.
  7. Regular (weekly) reading and interpreting of C++ code segments and programs.
  8. Inheritance and polymorphism.