Question

I will rate your answers so please make sure the answers are accurate. Please answer the following questions with fully explanations:

1) Of the following, which has the most impact on the efficiency of searching for an item in a hash table?
a) the number of non-key fields
b) the size of the table
c) the density of the table
d) whether the size of the table is a prime number
e) the difficulty of computing the inverse of the hash function

2) Assume that a priority queue is implemented using a binary heap and contains items. What is the average time requirement for the insert() operation?
a) O (1) b) O (log n) c) O (n) d) O (n log n) e) O (n^2)

3) Consider a perfect binary search tree of n nodes. Which of the following best describes the number of nodes that must be examined, in the worst case, to determine whether a given value is stored in the tree?
a) O (n/2) b) O (log n) c) O (n) d) O (n log n) e) O (n^2)

4) Please answer 26) in the picture shown below, please write out all the steps (step by step):

CSCI 210 Final Exam b) Construct a second hash table using the same hash function as above, but use chaining to resolve collisions. (3) insert (5): (4) 26. Draw the final splay tree that results from the operation: 6 7 2 4

Answer 1

1. C

2.B

3.B

Splay tree insertion

JiVen ver 8 9 Tnset (5) 6 6 5 구 니 8 3 2