CSC 201 Data Structures (4 credits)
The course covers fundamental data structures, algorithms for manipulating and retrieving information from these data structures, and techniques for analyzing their efficiency in terms of space and time. The distinction between an Abstract Data Type and its implementation is emphasized. Topics include lists, vectors, trees (general trees, binary search trees, and balanced trees), priority queues, hashing, graphs, and various searching and sorting algorithms.