ECS 60 Practice Final
1. Class program (15 points)
This question will attempt to determine whether you wrote the code for p5. There is no need for you to see sample
questions if you actually participated in writing the code.
2. Trees (25 points) Possible “trees” are AVL trees, splay trees, B-Trees, and skip lists. Show the result of accessing
node 14 in the following splay tree. To receive partial credit you should show the intermediate tree after the zig-zig
3
2 20
6 32
5 10
9 14
12 16
3. Hash (25 points) Possible areas explored are linear probing, quadratic probing, double hashing, and extendible
hashes. Assuming linear probing with a hash function of key mod TableSize, an initial TableSize of 3, and rehashing
when the load factor exceeds 0.5, show the hash table after each of the operations. Also fill-in the TableSize column.
Operation Table
Size
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19
insert 21 3
insert 22
insert 4
insert 0
insert 1
delete 0
insert 34
5 Priority Queues (25 points) Possible priority queues are binary heap, leftist heap, skew heap, and binomial queues.
For each of the following binary heaps, show the state of heap after operation specified.
Insert(20)
8
28 64
37 59 87 69
43 76 66
DeleteMin()
8
28 64
37 59 87 69
43 76 66
6 Sorting I (25 points) Possible sorts are shellsort, heapsort, quicksort, and radix sort. For Hibbard's increments of
1,3,7, …, 2k -1, show the state of the array during a Shellsort. Fill in the increment for each row. There may be
more rows than needed.
