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 and properly use Software Reuse with Templates.
Understand and properly use Stacks, and Queues.
Use Recursive Thinking.
Understand and properly use Software Reuse with Derived Classes.

Prerequisite: CS 135