17

18

19

20

a)

b)

a)

b)

a)
b)

a)

b)

02000CS205092002

Explain Merge Sort algorithm/pseudocode with the help of an example?
Mention the best case and worst case time complexity of Merge sort algorithm?
Why Binary Search algorithm is more efficient that linear search? Depict your
answer with suitable example? Mention the time complexity level of two
algorithms.

Write an algorithm/pseudocode to sort elements using Heap sort technique?
Illustrate the working of Heap sort algorithm on the following input :
35,15,0,1,60

Define hashing, hash function and collision.

List any three applications of BFS algorithm.

A hash table contains 7 buckets and uses linear probing to solve collision. The
key values are integers and the hash function used is key%7. Draw the table that
results after inserting in the given order the following values:
16,8,4,13,29,11,22.

With the help of an algorithm/pseudocode and suitable example, explain how
would you perform binary search on an array of n elements. Find the time
complexity of binary search algorithm.

Write short notes on separate chaining.

Page 3 of 3

(6)

(4)

(7)

(3)
(3)
(7)

(7)

(3)