Final examination review
Computer Science 1321
Spring Semester 1998

Topics for the final examination include, but are not necessarily
limited to, the following:

Chapters 4, 5, 6, 7.1, 7.2, 7.3, 8.1, 8.2, 8.3

1. Searching and list management
	Trees
		insertion
		deletion
	sorted arrays
		binary search
	unsorted arrays
		sequential search
2. Sorting
	quick
	heap
	tree
	shell
	insertion
	merge
	computational complexity
3. Trees
	binary search tree
	tree balancing (simple rotation)
4. General trees
	tree representation
		Array 
		dynamic (pointer)
	n-ary trees
	general search trees
	tree traversals
		preorder
		postorder
		inorder
5. Applications of trees
	Huffman encoding
6. Generalizations
	Stacks
	Queues
	Priority Queues (heap)
	Trees
	general data structures