Topics for the CSE 214 Final Exam
	---------------------------------

	Monday September 15th, 8:30-11:30AM
	116 Old Chemistry

The final exam will consist of about 8 questions of difficulty
similar to those of the midterms.  It will be cumulative, with
perhaps some bias towards material since the last midterm.

	Binary Search Trees
		Search
		Insertion
		Deletion
	Tree Traversals
	Balanced Search Trees
		Red-Black Trees
		Splay Trees
	Graphs (not much)

Do not feel you have to reproduce the details of red-black tree insertion
and deletion algorithms -- just understand the signficance.

Any topic we discussed in class is fair game.  Particularly important topics
from previous midterms include:

        program design and Modula-3
        stacks and queues
        pointers
        parameter passing
        linked lists
        recursion
	big Oh notation
		what is it (definition), how do you find the
		worst-case running time of an algorithm, working
		with the big Oh.
	sorting algorithms (algorithms and analysis)
		insertion / selection sort
		mergesort / quicksort
		heapsort and priority queues
	binary search
	multidimensional arrays
	hashing
	
It should help to study the Sedgewick book and the lecture notes on
the WWW, however my questions stress applying the concepts we have
learned more than memorization.

Good luck,
Steven Skiena