07-16-2011, 03:10 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#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
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]