D B3D041 ‘Total Pages:3

16. Give any two representations of graph. Give algorithm for DFS. Demonstrate DFS using
suitable example. (1a)

17. Give an algorithm to perform binary search. Using the algorithm, search for elements 23
and 47 in the given set of elements|12 23 27 35 39 42 50. பய

18. a) Write algorithm for (1) Insertion sort (11) Bubble sort (6)

‎[மணா the insertion sort algorithm and bubble sort algorithm on input‏ زط
)4( ]30,20,10,60,70,40[

‎1५. Deline hashing. What are the properties of a good hash function? With necessary
examples explain four different hashing techniques. (10)

‎20. Define collision, What is linear probing? The following keys 10, 16, ||, 1,3, 4,23 and ‏5ا‎
‎are inserted into an initially empty hash table of length 10 using open addressing with hash

‎function h(k) =k mod 10 and linear probing, What is the resultant hash table? . (10)

‎சுருக்‌

‎Page 3 of 3