Question

1. What is hash function? Consider a company with 68 employee assign a 4-digit employee number to each employee which is used as the primary key in the company’s employee file. Suppose L (set of memory addresses of the location) consist of 100 two – digit addresses : 00,01,02,…..99. Then apply the division method, mid square method and folding method (hash function) to find out the hash addresses for each of the following numbers 3205,7148,2345.

2. What is Heap Sort? Build a max heap for the following list of numbers: 44, 30,50,22,60,55,77,55.

3. Applying Merge Sort algorithm for the following list of numbers: 85,76,46,92,30,41,12.

4. Compare the complexities for the following sorting algorithm in average & worst case : bubble sort, quick sort ,heap sort

5. Write function of shell sort.

6. Explain the following :

(i) 2-tree

(ii) 4-tree

7. Write short note on :

(i) B –tree

(ii) M-way tree Search Tree

(ii) Partition Exchange Sort

Answer 1

Answer:

sorry friend I don't know the answer

Explanation:

because I will not study well