Study of data structures covers stacks, queues, trees, and graphs. Data structures are introduced as abstract concepts, and their physical implementations and operations are developed and applied. Topics include basic techniques of design and analysis of efficient algorithms for sorting, merging, and searching. 3 Credits (3 Lecture) Prerequisite(s): CIT260. Fall Only.