Studies data abstractions (e.g., stacks, queues, lists, trees, graphs, heaps, hash tables, priority queues) and their representation techniques (e.g., linking, arrays). Introduces concepts used in algorithm design and analysis including criteria for selecting data structures to fit their applications. Knowledge of C++ is highly recommended. Degree credit not granted for this course and CSCI 2275. Same as CSCI 2270.
instructor(s)
Guinn, Curry
Primary Instructor
- Fall 2024 / Spring 2025 / Fall 2025
