Data Structures and Algorithms

Catalog description

Teaches 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, balanced trees, graphs, and relations, as well as, foundation of recursive algorithms, complexity analysis, complexity classes, sorting and searching, computability and undecidability, problem-solving strategies, and heuristic approaches. Prerequisite(s): CS 211 . Prerequisite(s)/Corequisite(s): For CS majors: CS 310 and either MATH 270 or MATH 350 . For non-CS majors: MATH 270 or MATH 350 .