Data Structures and Algorithms

CS 361L (3)

An introduction to data structures and algorithms and the mathematics needed to analyze their time and space complexity. Topics include asymptotic notation, recurrence relations and their solution, sorting, hash tables, basic priority queues, search trees (including at least one balanced structure) and basic graph representation and search. Students complete a term project that includes an experimental assessment of competing data structures.

Prerequisite: 261 and 241L

Prerequisites / Corequisites

Mathematical Foundations of Computer Science - CS 261

Data Organization - CS 241L

Data Structures and Algorithms

Prerequisites / Corequisites

Course Search:

Keyword Search: