Vuhelper
12-01-2011, 10:44 PM
(MONTH OF MAY)
PAPER#1
1. What is function of length () method in the Aueue
2. Explain the two cases in which we apply double roation in An Avl
tree
3. how can we perform level -order travessal on a tree
4. How can the dangling reference problem be avoided
supose we have these value 16,27,23,10,,38
PAPER#2
Q.21: - How AVL is different from Binary Search Tree?
Q.22: - What the maximum no of comparisons we have to perform
during insertion in BST?
Q.23: - We have a list of 1, 2, 3, 4 numbers. Their inorder traversal is
2, 1, 4, 3 and post order is 2, 4, 3, 1. What will be its root at level 0.
(a). 1 (b) 2 © 3 (d) 4 (e) none
Q.24: -(a). Write C++ statement that declares a valid reference of int
i.
(b). What are the benefits of reference?
Q.25: - There is a BST, who root is 70 its left 65 right 74, left of 65 is
50 & right 67, left of 50 is null & right is 57, & back left of 67 is null &
right 69 and right of root 70 is 74, left of 74 is 72 & right is 77, left of
72 is null & right 73 and back to 77, left of 77 is null and right is 80.
I wrote all this because tree is not made by me...
write its Prefix and infix traversal.
Q.26: - write the details of given statements.
(a). int x;
int * y = & x;
(b). int x;
int &y = x;
©. int x;
int y = x;
PAPER#1
1. What is function of length () method in the Aueue
2. Explain the two cases in which we apply double roation in An Avl
tree
3. how can we perform level -order travessal on a tree
4. How can the dangling reference problem be avoided
supose we have these value 16,27,23,10,,38
PAPER#2
Q.21: - How AVL is different from Binary Search Tree?
Q.22: - What the maximum no of comparisons we have to perform
during insertion in BST?
Q.23: - We have a list of 1, 2, 3, 4 numbers. Their inorder traversal is
2, 1, 4, 3 and post order is 2, 4, 3, 1. What will be its root at level 0.
(a). 1 (b) 2 © 3 (d) 4 (e) none
Q.24: -(a). Write C++ statement that declares a valid reference of int
i.
(b). What are the benefits of reference?
Q.25: - There is a BST, who root is 70 its left 65 right 74, left of 65 is
50 & right 67, left of 50 is null & right is 57, & back left of 67 is null &
right 69 and right of root 70 is 74, left of 74 is 72 & right is 77, left of
72 is null & right 73 and back to 77, left of 77 is null and right is 80.
I wrote all this because tree is not made by me...
write its Prefix and infix traversal.
Q.26: - write the details of given statements.
(a). int x;
int * y = & x;
(b). int x;
int &y = x;
©. int x;
int y = x;