CST 211 - Data Structures

Lecture Hours: 3
Lab Hours: 3
Credit Hours: 4

Discussion of efficient methods of data representation such as stacks, queues, linked-lists, binary trees, B-trees. Emphasis is on data representation and algorithm analysis.

Prerequisite: CST 136 with grade “C” or better