This course examines the design and implementation of abstract data types and algorithms. Data structures such as linked lists, stacks, queues and trees are introduced in this course. This course also examines searching and sorting algorithms and their efficiency. This course is taught utilizing an object-oriented programming language. Lecture Hours:26.Laboratory Hours:52.Prerequisite(s):CMP 210 with a grade of “C” or better.Laboratory Fee:$25.Usually offered in the spring.
