CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 06 Feb 2012

CS301 Fall 2011 Final Term Feb 2012 – VU Current Paper – 03 Feb 2012

what is tree?(2)
what is hashing(2)
apply union operation and draw the tree applying following union operation?(5)

Another Paper:

all mcqs were from past solved papers jo papers bilal bhai ne upload kiay huay hain. 40 mai se almost 30 mcqs un papers mai se thay.

long questions mai se:

write down the algorithm for making maze? 2 marks
difine recursive relationship between siblings and parnts from distinct people? 2 marks
array was given sort that by bubble sort method? 5 marks
array was given sort that by selection sort method? 3 marks
array was given make a binary search tree and then remove a node from resultant tree.? 5 marks
define union by weight? 3 marks
define merge sort algorithm? 2 marks

 

DOWNLOAD SOLUTION HERE
loading...