Recent ProfessorsNot yet assignedRecent SemestersNo scheduled sections on recordClass SizeNot publishedCredits3PrerequisiteCS 136 or CO SCI 536 with a grade of "C" or better. Transfers ToCSUDescriptionFormerly CO SCI 532. Credit not given for both courses. Prerequisite: CS 136 or CO SCI 536 with a grade of "C" or better. This course is a continuation of the study of data structures using object-oriented design. Students examine, use, and implement a number of classic data structures, including (but not limited to) the following: Union/Find Trees, Priority Queues and Heaps, Huffman Trees, Graphs, Hash Tables and Files, and B-Trees, and main memory structures, architectural foundations for files, Large-scale sorting, hash- based persistent structure, Indexed files. Students evaluate the basic concepts involved in external sorting, including the Replacement Selection and Polyphase Merge algorithms, introduction to Database Management Systems.