CS 313. Intermediate Data Structures. 4 Credits.
Design and analysis of data structures as means of engineering efficient software; attention to data abstraction and encapsulation. Lists, trees, heaps, stacks, queues, dictionaries, priority queues.
Requisites: Prereq: CS 210, CS 211, CS 212, MATH 231, MATH 232 with grades of B- or better.
