CS 233
Data Structures I

Credits/When Offered: 4R-0L-4C / W

Prerequisites: CS 231 or equivalent.

Definition and implementation of fundamental data structures. Linear lists, strings, stacks, queues, trees, graphs, internal searching and sorting algorithms, space and time requirements, information hiding, data abstraction. Team software design and implementation.

Explain the notation used here.

white_icon.gif (851 bytes)Required Courses
cs_icon.gif (891 bytes)Computer Science
rhit_icon.gif (977 bytes)Rose-Hulman

09-Feb-1999 20:02:14