CS301 Midterm Current Papers VU Fall 2011 (www.vusolutions.com)
all mcqz were from past papaer
why queue is linear data structure.
how we can delete a node having 2 childs in bt.
2 codes were given to find errors and commenteach line
preorder inorder tree were given
defie const keyword, reference variable , Dangling reference
Another Paper:
Q:1 What is complete binary tree?
Q:2 How single left rotation is performed in AVL tree?
Q:3 describe the following
(i) Height of tree
(ii) Balance of Node
Q:4 Compute the number of leafs nodes in binary tree ?
Q:5 Aik tree dia hova tha aur ye find krna tha
Post order traversal
Level Order Traversal
Q:6 Aik prgram tha statment yd ni hay .
0 comments
Post a Comment