Catalog Course Search Details

 Department:    CS

 Course #:    123

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    11.0701

 EPC:    CSACSBS

 REV:    2024

 Course Description  

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

 Prerequisite  

Prerequisite: CS 122 with grade C or higher or department chair permission.

Contact Hours (based on 11 week quarter)

Lecture: 55

Lab: 0

Other: 0

Systems: 0

Clinical: 0

Intent: Distribution Requirement(s) Status:  

Academic N/A  

Equivalencies At Other Institutions

Learning Outcomes

After completing this course, the student will be able to:

1. 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.
2. Describe, implement and debug simple algorithms using the concept of recursion as a tool for data structure implementation.
3. Study complexity and performance tradeoffs using classical algorithms and correct notation such as Big-O.
4. Demonstrate the ability to decompose a large-scale process into multiple object-oriented classes/interfaces/etc. to make a single unified solution.

General Education Learning Values & Outcomes

Revised August 2008 and affects outlines for 2008 year 1 and later.

Course Contents

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