COMP 280 - Data Structures

When Offered: F, S, SS

3 Credit(s)
3 Lecture Hour(s)
0 Lab Hour(s)

This is the third course in the computer science sequence. It introduces abstractions (algorithm, data type, complexity) and programming tools (pointers, dynamic memory, and linked data structures). The course also examines essential data structures, (stacks, queues, trees, linked lists, and graphs). It analyzes and implements techniques such as hashing, sorting, searching, and priority queues, to solve general problems. The emphasis of the course is on building modular programs that can be changed to use different data structures and algorithms.

Prerequisite(s): COMP 167 and (COMP 180 or MATH 123 or ECEN 227).