Requirements for the Final Exam
                    Dec. 18, 11a-2p
                      COSC 2320 (Dr. Eick)
1) Graphs ****
   a) Dijkstra's algorithm
   b) graph-traversal algorithm
   c) techniques to store graphs: adjacency matrices and adjacency lists

2) Produce an interative version of a recursive program ****

3) Search Techniques ****
   a) Binary Search (only basic properties) *
   b) Binary Seach Trees  *** 
   c) Hashing (study chapter 8 and especially the material discussed in class 
      carefully centering on open-address methods and chaining and read
      and study sections 8.1 and 8.2 of the textbook carefully) ****
   d) case studies: which technique is better in a particular situation **

4) Sorting (you should know how each of the alg. works!) ****
   a) insertion-, selection-, exchange- sort
   b) mergesort(only basic properities) and quicksort(detailed knowledge!!)    
   c) complexity discussions of search algorithms
   Also read the corresponding sections of the textbbook!

5) Write a program that do something with trees and/or graphs *****

6) Heaps ***

7) Determine the runtime complexity of a given piece of program
code. ***

Algorithms you should know in detail are: Dijkstra's algorithm,
quicksort, insertion-sort, and the insertion/deletion algorithms 
for heaps. 

The final exam is "open" textbook, and is scheduled for 
Th., Dec. 18, 11a-2p. It will take approx. 160 minutes. Please, bring
photo-id to the exam. Be aware that the final exam starts at 11:00a!!!