VUsolutions Transferred to AchiKhasi.com

From December 2011, this blog www.VUsolutions.blogspot.com is transferred to http://achikhasi.com/vu/ . So, you may visit http://achikhasi.com/vu/ for latest study related help.

Back to home VUsolutions

VUsolutions Fans Club [join us for MORE solutions]

VUsolutions on Facebook

CS301 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan

Saturday, July 16, 2011 Posted In Edit This
CS301 Current Spring 2011 Final Term VU Paper [July 2011] Virtual University of Pakistan

Total 52 Q's,40 mcq,s 120min

1)      For a perfect binary tree of height 5,what will be the sum of heights of nodes?     2marks

2)      Properties of equivalence class.

3)      Two ways for the implementation of Queue data structure.

4)      Worst case of selection sort

5)      Max heap, add 24                  3 marks

6)       "is a sibling of" set of all human beings is equivalence relation or not? explain.

7)      Linked memory

8)      3 5 9 8 1 7 0 2 6 4 , draw after the 1st iteration of large loop in a selection sort (smallest to largest)

9)      Union commands 1, 2, 3, 4, 5 union(4,2),union(3,1),union(5,4)        5 marks

10)   Code for removing an element froma linked list data structureif it is implementationby using linked memory methods.

11)   Fill the hash table ofsize 11 that results when u insert the keys 19, 6, 16, 8, 5, 13, 1

12)   Draw an heap that is created by removing one item from the heap.

                   911

            77             66

68           1             3        11


Back to home VUsolutions

Shaadi.com: Just create ur account & find ur partner or EARN money, its reall & EASY

VUsolutions Followers (Join NOW and Get Extra Benefits)

Install LATEST toolbar having lot of features - GET solutions on Desktop

toolbar powered by Conduit
Caliplus 300x250 NoFlam VitoLiv 468x60 GlucoLo