The course examines data structures and Abstract Data Types (ADTS), such as stacks, queues, linked lists, binary trees and graphs, applying the foundational principles of algorithm development and analysis techniques (including Big-O notation). Students complete programming assignments to illustrate these concepts. 3 hrs. lect; 1 hr. lab. Prerequisites: CSC 150 with a grade of C or better. Corequisite: MAT 206.