07-16-2011, 02:59 AM
CS301 Current Final Term Paper - 15 July 2011
Q#1
For smaller list linear insertion sort is perform well but for large list Quick sort suitable to
justify why????????
Q#2
Here is a array of exctaly 15 elements
2 3 4 5 6
1
Suppose that we are doing a binary search for an elemnt .Indicate any element that will be fo
examining two or fewer number from the array (5 mrks)
Q#3
Write the applications of heap.
Q#4
Write down the c++ code for selection sort (5 marks)
Q#5
Write the application of binary search tree
Q#6
Write the about disjoint set?
Q#7
Heapified theelament of the following array (from left to right)in to a min heap and show rha
heap contenti in the array that shown blow(5 marks)
7 8 9 10 11 12 13 14 15
Q#1
For smaller list linear insertion sort is perform well but for large list Quick sort suitable to
justify why????????
Q#2
Here is a array of exctaly 15 elements
2 3 4 5 6
1
Suppose that we are doing a binary search for an elemnt .Indicate any element that will be fo
examining two or fewer number from the array (5 mrks)
Q#3
Write the applications of heap.
Q#4
Write down the c++ code for selection sort (5 marks)
Q#5
Write the application of binary search tree
Q#6
Write the about disjoint set?
Q#7
Heapified theelament of the following array (from left to right)in to a min heap and show rha
heap contenti in the array that shown blow(5 marks)
7 8 9 10 11 12 13 14 15
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]