CS 133 - Computer Science III C++

5.0 Credits
C++ Data Structures.Focuses on the implementation and analysis of elementary data structures such as lists, stacks, queues, maps, sets, trees,and related algorithms.
Prerequisite Completion of CS 132 with a grade of 2.5 or higher or instructor permission.
Course-level Learning Objectives (CLOs)
Upon successful completion of this course, students will be able to:

Demonstrate the implementation of the underlying data structures used in computer science, such as the list, set and map implementations using both array and linked node implementations.
Describe, implement and debug simple algorithms using the concept of recursion as a tool for data structure implementation.
Study complexity and performance tradeoffs using classical algorithms and standard notation such as Big-O.
Demonstrate the ability to decompose a large scale process into multiple object oriented classes/interfaces/etc. to make a single unified solution.

Course Typically Offered
Spring