CSCI 2900 Data Structures

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.

Credits

Prerequisite

CSCI 1302; MATH 2300

Typically Offered

Demorest: Fall (every other odd year)

Student Learning Outcomes

Upon the completion of this course, students will be able to demonstrate the following outcome-based learning skills:

Learn specifications and presentation of commonly used data structures.
Learn advanced search and sort algorithms and their performance issues.
Learn the use of covered data structure in problem solving and application development.