CS 241 - Data Structures and Algorithms II (4)

Trees, priority queues, graphs, sets, and maps. Sorting algorithms. Random access, indexed and direct files. Indexing techniques.

Prerequisite(s): CS 240 with a grade of C or better, or consent of instructor.
Component(s): 4 lectures/problem-solving.