CSC 269 UNLV, Introduction to Data Structures, Summer 2002

Summary of Topics for Test, August 5

I will ask you to describe certain specific implementations of certain data structures in detail. This might include a detailed description of how to implement a queue as a linked list (not doubly linked), how to implement a search structure in various ways, how to implement a stack as an array, how to implement a sparse array as a search structure, for example.

I will expect you to know a number of terms, such as "sparse matrix," "balanced binary search tree," "priority queue," "abstract data type," "acyclic digraph," "linked list," and some others. You might be asked to identify the name (as a multiple choice question) or to define a term, or there might be a question (perhaps a true/false question) which requires knowlege of the definition of one of these terms.

I expect you to be familiar with a number of specific algorithms and data structures we discussed in class. Here is a partial list:

I might ask you to write an implementation of a particular Abstract Data Type, such as "Stack of Integer" including code for the needed operators

~