The second examination of the semester will be held Friday, March 23, 2012. The examination will last 50 minutes. Please be on time.
The topics for the second examination include
1. Trees
binary search trees
tree traversals
preorder
inorder
postorder
tree construction, insertion and deletion
searching a binary tree
sorting using a binary search tree
depth, level, nodes, leaves
binary, complete binary, almost complete binary, strictly binary
tree representations
lists
nodes and references
generalizations
2. Linked lists
linked data structures
construction of lists
single linked lists
insertion
deletion
searching
double linked lists (trees)
insertion
deletion
searching
applications of lists
3. Lists and list methods
4. Stack, queue, deque
Definition
Implementation
5. Recursion
recursion and lists
6. sorting
tree sort, shell sort, minsort, maxsort, bubble sort, insertion sort
quicksort, heapsort, mergesort
various implementations
7. Computational complexity
Problems on the examination will include some definitions, fill in the blanks, true and false, short answer. Problems will also include studying and correcting code I write, as well as coding problems you will write.
Return to the Computer Science 1321 Home Page
Return to Dr. Eggen's Home Page