CS 361L - Data Structures and Algorithms I - 3 credit hours


An introduction to data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics
include 0( ) notation, recurrence relations and their solution, sorting, hash tables, priority queues, search trees (including at least one balanced tree structure), and basic graph representation and search. Course includes programming projects.

Prerequisite: 261, 251L, and Math 163L.

Also offered as EECE 331