My Cs301 Final Paper Held On 26-AUG-2014
Q.45 Huffman tree was given(page 311 handouts)and also selected characters were given; we have to write binary code (3 marks).
Q.46 Consider the following keys 36, 30, 84. The hash function to insert these values in a hash table (array) is f(h)=key mode 12, identify the keys that may cause for collision. (3 marks)
Q.47 Heap uses minimum memory. Do you agree this statement?. Justify your answer. (3 marks)
Q.48 Construct a tree using union-find method from the following
Union(O,A), Union(B,M), Union(A,G), Union(O,N), Union(J,H), Union(A,C), Union(O,B), Union(J,O). (3 marks)
Q.49 we have a list of N elements (numbers, names etc) which can be freely ordered and an integer k, we have to find the kth smallest element. One way is put into array and sort it, then smallest will be at kth position, it will take Nlog2N time. Can we use heap? Justify your answer. (5 marks)
Q.50 given is an array of exactly 15 elements
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15
Find an element using binary search. Indicate which element will be found in first two iterations.
Case1:- The numbers to be found is 1.
Case2:- The numbers to be found is 15. (5 marks)
Q.51 consider a hash table of size 7 (index 0 to 6). The hash function is H (key) = (2*key+5) mod 7. Enter the keys in table. 5, 23,17,14,44
Use Linear Probing to resolve collisions. (5 marks)
Q.52 How can you make the following binary tree (see page 16 question 36 moaaz file) a heap by making minimum possible changes in it? (5 marks).
Q.45 Huffman tree was given(page 311 handouts)and also selected characters were given; we have to write binary code (3 marks).
Q.46 Consider the following keys 36, 30, 84. The hash function to insert these values in a hash table (array) is f(h)=key mode 12, identify the keys that may cause for collision. (3 marks)
Q.47 Heap uses minimum memory. Do you agree this statement?. Justify your answer. (3 marks)
Q.48 Construct a tree using union-find method from the following
Union(O,A), Union(B,M), Union(A,G), Union(O,N), Union(J,H), Union(A,C), Union(O,B), Union(J,O). (3 marks)
Q.49 we have a list of N elements (numbers, names etc) which can be freely ordered and an integer k, we have to find the kth smallest element. One way is put into array and sort it, then smallest will be at kth position, it will take Nlog2N time. Can we use heap? Justify your answer. (5 marks)
Q.50 given is an array of exactly 15 elements
1,2,3,4,5,6,7,8,9,10,11,12,13,14,15
Find an element using binary search. Indicate which element will be found in first two iterations.
Case1:- The numbers to be found is 1.
Case2:- The numbers to be found is 15. (5 marks)
Q.51 consider a hash table of size 7 (index 0 to 6). The hash function is H (key) = (2*key+5) mod 7. Enter the keys in table. 5, 23,17,14,44
Use Linear Probing to resolve collisions. (5 marks)
Q.52 How can you make the following binary tree (see page 16 question 36 moaaz file) a heap by making minimum possible changes in it? (5 marks).
Comments
Post a Comment
Please give us your feedback & help us to improve this site.