Catalog Course Search Details

 Department:    CS

 Course #:    334

 Credits:    5

 Variable:     No

 IUs:    5

 CIP:    11.0701

 EPC:    CSACSBS

 REV:    2024

 Course Description  

Continue exploration of data structures and algorithms by investigating real-world applications of algorithms, such as undirected graphs, directed graphs, minimum spanning trees, shortest paths, tries, regular expressions, reductions, and intractability.

 Prerequisite  

Prerequisite: CS 333.

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. Implement the various types of graph data structures.
2. Analyze graph properties and types.
3. Compare and contrast minimum spanning tree algorithms.
4. Compare and contrast shortest path algorithms.
5. Apply various graph search algorithms to a graph data structure.
6. Create a Binary Tree and analyze memory usage and caching.
7. Evaluate algorithms that interact with memory including exploration of time locality, spatial locality and cache efficiency.
8. Recommend commonly used algorithms such as check sum, TCP, or UDP, for applications in memory and data transfer.

General Education Learning Values & Outcomes

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

Course Contents

1. Various types of graph data structures.
2. Graph properties and types.
3. Minimum spanning tree algorithms.
4. Shortest path algorithms.
5. Various graph search algorithms.
6. Binary Trees and memory usage and caching.
7. Algorithms that interact with memory including exploration of time locality, spatial locality and cache efficiency.
8. Commonly used algorithms such as check sum, TCP, or UDP, for applications in memory and data transfer.