A more formalized view of data structures. Stacks, trees, tables, lists, multilinked structures, strings and files are considered. These are viewed in terms of their general usefulness in the construction of algorithms and in their efficient implementation. Both theoretical results and programming techniques will be stressed.
Credit Hours: 3.000

Levels: Graduate, Undergraduate
Schedule Types: Base Lecture

Division: Graduate
Department: CST:Computer & Info Sci

Restrictions:
Must be enrolled in one of the following Levels:     
      Graduate