Catalog Course Search Details

 Department:    CS

 Course #:    333

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    11.0701

 EPC:    CSACSBS

 REV:    2024

 Course Description  

Explore and implement different methods of data storage and recommend which to use based on time and space performance. Evaluate commonly used data structures and their associated algorithms.

 Prerequisite  

Prerequisite: CS 123; and CS 202 or concurrent enrollment.

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. Apply principles of algorithm complexity analysis, using common notation, and apply to the data structures in this course.
2. Implement various types of linked list.
3. Implement a stack and a queue data structure including traversal, insertion, and deletion.
4. Implement tree structures including traversal and balancing techniques.
5. Implement a priority queue and heap data structures using appropriate algorithms.
6. Recommend and implement appropriate sorting and searching algorithms for a given real-world problem.
7. Create a hash table design with collision handling strategies.

General Education Learning Values & Outcomes

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

Course Contents

1. Bags, queues, and stacks.
2. Sorting, priority queues, and symbol tables.
3. Binary search trees, balanced binary search trees, and hash tables.