COMP 2140
Data Structures: Analysis and Implementation
Introduction to the representation, implementation, and analysis of common data structures: stacks, queues, hash tables, binary and balanced trees. Algorithms for manipulating data structures will be analyzed using asymptotic notation. One of MATH 1240 , MATH 1241 , or MATH 2136 is recommended.
Prerequisites & course information
PR/CR: A minimum grade of C is required unless otherwise indicated. Prerequisite: COMP 1020 or COMP 1021 . Equiv To: COMP 2061 Attributes: Science
Sources
- Course catalogue ↗2026-2027