CS 3305:Data Structures

3 Class Hours 0 Laboratory Hours 3 Credit Hours
Prerequisite: (MATH 2345 or CSE 2300) and [(CSE 1322 and CSE 1322L each with a “B” or better), or MTRE 2610 with a “B” or better, or CPE 3000 with a “B” or better]
This course introduces data structures, specification, application, and implementation. The case studies will illustrate how data structures are used in computing applications. The emphasis of the course is on linear and some nonlinear data structures and object oriented principles. Topics include: abstract data types, stacks, queues, lists, binary search trees, priority queues, recursion, algorithm efficiency, trees, heaps, hash tables, and analysis of search and sort algorithms and their performance for implementation and manipulation. The programming language to be used in this course is any standard high-level object-oriented programming language such as C++, Java, and Ada.