Semester Hours: 3The study of representations for lists, stacks, queues, trees, and graphs. Fundamental algorithms (and their implementation) for sorting, searching, merging, hashing, graph theoretic models and recursive procedures. Prerequisite(s)/Course Notes: CSC 014, 016.