CS 123 - Introduction to Computer Programming III

Credits: 5
Variable Credit Course: No

Lecture Hours: 55
Lab Hours: 0
Worksite/Clinical Hours: 0
Other Hours (LIA/Internships): 0

Course Description: Focuses on the implementation and analysis of elementary data structures (array list, linked list, binary search tree) and related algorithms.

Prerequisite: CS 122 with grade C or higher or Dept. Chair permission.
Meets FQE Requirement: No
Integrative Experience Requirement: No

Student Learning Outcomes

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 correct 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 Contents

Underlying data structures used in computer science, such as the list, set and map implementations using both array and linked node implementations.
Simple algorithms using the concept of recursion as a tool for data structure implementation.
Performance tradeoffs using classical algorithms and correct notation such as Big-O.
Large-scale process into multiple object-oriented classes/interfaces/etc. to make a single unified solution.

Instructional Units: 5