CS 3310 - Data and File Structures

This course focuses on the study of internal and external data structures and algorithms with an ongoing emphasis on the application of software engineering principles. Trees, graphs and the basic algorithms for creating, manipulating and using them will be studied. Various types of hash and indexed random access file structures will be discussed and implemented. B-trees and external file sorting will be introduced. Internal and external data and file organizations and algorithms will be compared and analyzed. Students will carry out a number of programming projects which will include the various interface (person-to-person, module-to-module, person-to-module-to-person) aspects of the software development process.

Prerequisites & Corequisites: Prerequisite: CS 1120 and (CS 1310 or MATH 1450), with a grade of “C” or better, or equivalent.

Credits: 3 hours