COMP 151 - Data Structures and Program Design

Units: 4
Three hours lecture and three hours lab per week
Prerequisite: COMP 150
Introduction to data structures and the algorithms that use them. Review of composite data types such as arrays, records, strings, and sets. Topics include: the role of the abstract data type in program design, definition, implementation and application of data structures such as stacks, queues, linked lists, trees and graphs; recursion; use of time-complexity expressions in evaluating algorithms.; comparative study of sorting and searching algorithms.