CS 311 - Data Structures and Algorithms

Units: 3

A thorough understanding of several advanced methods for implementing the abstract data types and the time used by each method. Includes abstract data types such as dictionary, priority queues, matrices, and relations, foundation of recursive algorithms, complexity analysis, complexity classes, sorting and searching, computability and undecidability, problem-solving strategies, heuristic search, modeling and components of database systems, and graphics software systems.

Prerequisite(s): CS 211 .
Prerequisite(s)/Corequisite(s): MATH 270 or MATH 370.