COP 4531: Preparing for the Test on Pre-Requisite Material

You may be asked to perform the following tasks in the test.

1. Give the time and space complexity for common operations on the following data structures: linked lists, queues, stacks, heaps, binary search trees, balanced binary search trees (such as an AVL tree), and hash tables.

2. Given a data structure and an operation on it, derive the time complexity for that operation. For example, derive the time complexity of heap initialization.

3. Given a data structure and some operation on it, write code to implement that operation.

4. Given a data structure, data it contains, and some operation on it, show the state of the data structure after completion of that operation.

5. Given a data structure and an algorithm for some operation on it, prove of disprove its correctness.

6. Prove or disprove properties of big-Oh and big-Omega notations.

In order to prepare for the test, you may wish to look at review questions for the COP 4530 course in Fall 2005, the midterm solutions for that course, and the final exam for that course.