ITSC 2214 - Data Structures and Algorithms

A study of the design, implementation and testing of abstract data types for linear and non-linear data structures. Introduction to Big O as a tool for analysis of algorithm efficiency and to evaluate tradeoffs in alternative implementations of data structures. Data structures studied include lists, sets, bags, hashmaps, stacks, queues, trees and graphs. Course covers the design and analysis of searching, sorting, and more general traversal algorithms using both iterative and recursive solutions for all the data structures covered. For the implementation of data structures, emphasis is placed on software design principles such as encapsulation, interfaces, generics, unit testing, and code coverage. Programming projects emphasize the use of data structures to solve common computational problems.

Credit Hours: (4)
Prerequisite(s): ITSC 1213 with grade of C or above.

Schedule of Classes