An extension of programming methodology to cover data storage and manipulation on complex data sets. Topics include: programming and applications of data structures; stacks, queues, lists, binary trees, heaps, priority queues, balanced trees and graphs. Recursive programming is heavily utilized. Fundamental sorting and searching algorithms are examined along with informal efficiency comparisons. Students expected to be proficient with a professional IDE for coding and debugging. The course consists of 100-minute face-to-face lecture and 100-minute instructor-led lab each week. (2 hrs. lecture, 2 hrs. laboratory) Prerequisite: CSE148 with a C or higher. Offered on: A / 3 cr. hrs.