Latest Activity In Study Groups

Join Your Study Groups

VU Past Papers, MCQs and More

We non-commercial site working hard since 2009 to facilitate learning Read More. We can't keep up without your support. Donate.


Please share your current paper here for help each other.

Stay blessed and Best of Luck for exam.

Remember me in your prayers.

Best Regards,

sana

Views: 1177

Replies to This Discussion

Please share your current paper here for help each other.

Stay blessed and Best of Luck for exam.

Remember me in your prayers.

Best Regards,

sana

O koi tu Current peprz Share kro today 11.30 pe mery pepr hy.

Well mera paper 3.30 pay hai, agar aak paper ka bad thora upload kr daina ,thx

Attachments:

i would suggest to all of  you to prepare your paper form moaz 's solved paper cause my todays paper was totaly from them best of  luck guys

20 MCQz

21. How is single rotation in Avl tree performed?   2

22. What is strictly binary tree and complete binary tree?   2

23. about choosing single/double rotation?  3

24. Code: Recursive call?  3

25. Delete nodes from BST?  5

26. Explanation about code?   5

 (a).int x;
int * y = & x;

(b). int x;
int &y = x;

(c). int x;
int y = x;

Almost all mcqz from past quizzes.

In the __________methodology, a copy of the object is passed to the called function.

The expression AB+C* is called________

We access elements in AVL Tree in,___________

The nodes with no successor are called _________

A tree is an AVL tree if ____________

What will be the postfix notation of 5+6/2.

_____ is the stack characteristic but _______was implemented because of the size limitation of the array.
The next field in the last node in a singly-linked list is set to_____.


 

 

 

 

Thanks alot .... :)

my today's paper ...TOTAL 26 questions .....  18-19 mcq's ..... 20-25% from past papers ... but baki k b itnay mushkil nai thay .. agar past papers prepare kr lo gay to ho jaein gay ....

short question answers....

1. names of operations of binary search tree .... 2marks

2. difference b/w "call by value" and "call by reference" ....... 2marks

3. aik coding di hoi ti .. usma btana tha k kya ho ra hai..steps explain krnay thay .... 3marks

4. AVL tree given tha usma node 12 dalna tha ..... just draw krna wo tree ....... 3marks

5. tree given tha, uskay preorder and inorder likhna tha .... 5marks

6. again AVL tree ... node dalna tha, balnce krna tha etc ..... 5marks

GOOD LUCK ALL

Thanks a lot everyone....who shared his/her paper above....

Total mcq's 20 subjective 6 questions

 

most of the mcq's were from past papers

 

1) cases of rotation

2)what is binary tree

3)make a binary tree as tall as it could be made "2, 5, 4, 6,7,9,8"

4)a code was given and we had to give the output

5)reference variable

6)inorder and preorder traversal. 

total marks 40

20 mcqs

6 quests...2,3,and 5 marks 2 2 quests

mostly mcqs form past papers..

what are the applications of binary tree?2 marks

difference b/w BST and AVL tree?2 marks

one tree was given to delete root of it...and ask the other candidates for that root?3 marks

one three was given and one node was asked to insert in it...3 marks

one tree was given and asked to give post order and level order traversal...5 marks

and one AVL tree was asked to draw..5 marks

thanks a lot

RSS

Looking For Something? Search Below

VIP Member Badge & Others

How to Get This Badge at Your Profile DP

------------------------------------

Management: Admins ::: Moderators

Other Awards Badges List Moderators Group

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service