CS 202 - Computer Science II

Credits: 3

Description
This course is the continuation of CS 135. It covers: a) Data structures and algorithms for manipulating linked lists; b) String and file processing; c) Recursion. Software engineering, structured programming and testing, especially larger programs are also covered in this course.

Student Learning Outcomes

Handle Program Specification Design, and Analysis.
Compile and execute their programs with Abstract Data Types and C++ Classes.
Use Pointers and Dynamic Arrays in their programs.
Develop programs using Linked Lists.
Understand Software Reuse with Templates.
Use Stacks, and Queues.
Use Recursive Thinking.
Understand Software Reuse with Derived Classes.

Prerequisite: A grade of C or better in either CS 135 or CIT 133
Corequisite: None

Graded: Letter Grade