Question

Assume a hash table is implemented using chaining with buckets implemented using binary search trees. What's the average case time complexity of searching for a data item? Assume the size of data, n, is much larger than the size of the hash table. Oln O(1) O(n) O(login) D Question 24 2 pts Assume that list consists of the following elements. What is the result after the first pass of the selection sort algorithm? Assume the list is to be sorted in ascending order int list() - 110, 56, 34, 25, 73, 46, 89, 2, 5, 16) 2 5 10 16 25 34 46 56 73 89 89 73 56 46 34 25 16 10 5 2 2 56 34 25 73 46 9 10 5 16 2 56 34 25 5 16 89 46 73

Answer 1

1)

ans) O(log(n))

Explaination :

then time buckets connected in a chain. If number of buckels is n hash table taken to search using binary search & O(logn) In care of most of the elements maps to the same cell of hash table. The length of chain of buckets become nearly N

Question 24)

Ans : c i.e.,[2,56,34,25,73,46,89,10,5,16]

Explaination :

Selection sort : It is a one type of sorting algorithm.In this algorithm checks smallest value in the array and swap to the first position. After that counter add one . and checks the small value in the array except first value and swap to the second position and counter add one.

10,56, 34,25,73,46,89,2,5 16 O An:२,56, 34, 25,73,46,89,10,5,16

3)

Ans : b i.e.,[12,34,25,56,46,73,10,5,16,89]

Explaination :

Bubble sort : It is also a sorting algorithm. This algorithm checks adjacent smallest values in the array and swap to the elements.

12,56 34 25734689 10,5,16 11 34 56 25 46 73 10 85 5 85 As: 2, 34, 25,56,4673, 10,5, 16, 88

If any queries about answer please leave a comment........

Thank you............