CS 266 - Applied Data Structures

4 credits
Studies Abstract Data Types (ADT) and its algorithms in an applied context. Topics include control flow, elementary (linear) data structures: stacks, lists, queues, and trees, as well as searching and sorting these structures. The course also covers software engineering tools and techniques, including integrated development environments, debuggers, version control, and testing. Prerequisite(s): CS 256 with a B or better and MTH 112Z with a C- or better.
Grade mode designated on a CRN basis each term. Students should consult current term schedule.