CS 334 - Data Structures and Algorithms II

Credits: 5
Variable Credit Course: No

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

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: CS 333 with a grade of C or higher. Admission to BSCS program and Dept. Chair permission.
Meets FQE Requirement: No
Integrative Experience Requirement: No

Student Learning Outcomes

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

Course Contents

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

Instructional Units: 5