This course will present sequential and linked representations of various built-in and abstract data structures including arrays, records, stacks, queues, and trees. Algorithms will be developed relating to various sorting and searching techniques, merging and recursion. A high-level programming language, such as C++, will be used in exploring and developing these algorithms with an emphasis on object oriented programming techniques and static and dynamic storage concepts. Credits: 3.00
BCS 230 with a grade of C or better.
At the completion of this course, students will:
Malik - Data Structures Using C++, 2nd Edition
Course Technology - ISBN - 9780324782011