CS 334 - Data Structures and Algorithms II

5.0 Credits
Students continue the 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 Completion of CS 333 with a grade of 2.5 or higher or instructor permission.
Course-level Learning Objectives (CLOs)
Upon successful completion of this course, students will be able to:

Describe, implement and reason about the underlying data structures used for multiple types of graphs.
Analyze graph properties and types to choose the optimal graph for solving a problem.
Explain, implement, and compare fundamental algorithms for spanning trees, identifying shortest paths, and graph searching.
Explain and analyze memory usage and caching with B-Trees.
Evaluate algorithms that interact with memory including exploration of time locality, spatial locality, and cache efficiency.
Analyze and apply commonly used algorithms such as check sum, TCP, and UDP, for applications in memory and data transfer.

Course Typically Offered
Winter, Spring