08-07-2010, 07:26 PM
Mcqs mostly from past papers.
name of two divide n conquore algorithm (2 marks)
difference bw call by value n call by reference (2 marks)
skip list (3)
heap and two types of heap(3)
union by size (3)
height of a tree is 5 find sum of heights (2)
Dummy note (5)
collision ,linear probing and quadratic probing note (5)
( Marks: 5 )
Here is an array with exactly 15 elements:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15.
Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.
name of two divide n conquore algorithm (2 marks)
difference bw call by value n call by reference (2 marks)
skip list (3)
heap and two types of heap(3)
union by size (3)
height of a tree is 5 find sum of heights (2)
Dummy note (5)
collision ,linear probing and quadratic probing note (5)
( Marks: 5 )
Here is an array with exactly 15 elements:
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15.
Suppose that we are doing a binary search for an element. Indicate any elements that will be found by examining two or fewer numbers from the array.