CS 163 Data Structures
Data abstraction with formal specification. Elementary algorithm analysis. Basic concepts of data and its representation inside a computer. Linear, linked, and orthogonal lists; tree structures. Data structures are implemented as data abstractions using pointer based implementations. Sorting and search strategies. Data management. Three hours lecture and one 3-hour laboratory. The laboratory emphasizes practical programming skills.
Prerequisite
Prerequisite:
CS 162 with a grade of C or better. Co-requisites: concurrent enrollment in CS163L.