CS 3305: Data Structures

3 Credit Hours

Prerequisite: (MATH 2345 or CSE 2300) and ((CSE 1322 and CSE 1322L each with a “B” or higher), or MTRE 2710 with a “B” or higher, or CPE 3000 with a “B” or higher)
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.

Course Learning Outcomes
Students who successfully complete this course will be able to:

Demonstrate understanding of single dimensional, multidimensional arrays, and dynamic arrays to store and access data, by applying these to programs.
Demonstrate learning of specifications and presentation of commonly used data structures by completely developing software. This must include appropriate documentation.
Demonstrate understanding and learn of advanced search and sort algorithms and their performance issues, by applying these to programs.
Demonstrate the analysis of the time complexity and space complexity of algorithms by explaining these concepts and applying these in programming.
Demonstrate the data structure covered in the courses by performing problem solving and application development.