CS301 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
Friday, July 15, 2011 Posted In .Final Term Exam Spring 2011 (July) Edit ThisCS301 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan
All mcqs were from past papers
Q#1
For smaller list linear insertion sort is perform well but for large list Quick sort suitable to apply/justify why????????
For smaller list linear insertion sort is perform well but for large list Quick sort suitable to apply/justify why????????
Q#2
Here is a array of exctaly 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 elemnt .Indicate any element that will be found by examining two or fewer number from the array (5 mrks)
Here is a array of exctaly 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 elemnt .Indicate any element that will be found by examining two or fewer number from the array (5 mrks)
Q#3
Write the applications of heap.
Write the applications of heap.
Q#4
Write down the c++ code for selection sort (5 marks)
Write down the c++ code for selection sort (5 marks)
Q#5
Write the application of binary search tree
Write the application of binary search tree
Q#6
Write the about disjoint set?
Write the about disjoint set?
Q#7
Heapified theelament of the following array (from left to right)in to a min heap and show rhat min heap contenti in the array that shown blow(5 marks)
origional array 6 5 3 9 1 2 10 8
heapified array
Q #8
Represent the following Binary tree ussin array representation
hashing definition
skiplist characteristics
avl tree
complete binary tree characteristics
abstract data typ
union operatiion
maze algorithm
hashing is usefull in compiler "
Heapified theelament of the following array (from left to right)in to a min heap and show rhat min heap contenti in the array that shown blow(5 marks)
origional array 6 5 3 9 1 2 10 8
heapified array
Q #8
Represent the following Binary tree ussin array representation
hashing definition
skiplist characteristics
avl tree
complete binary tree characteristics
abstract data typ
union operatiion
maze algorithm
hashing is usefull in compiler "
