Welcome to Virtually helps.
www.vuhelp.com
Question 1 2 3 4 5 6 7 8 9 10 Total
Marks
Question 11 12
Marks
Question No: 1 ( Marks: 2 ) - Please choose one
The order of precedence in multiplication,. addition & subtraction is
.
highest to highest
.
highest to lowest
.
lowest to lowest
.
Lowest to highest
Question No: 2 ( Marks: 2 ) - Please choose one
the preorder method in B tree is called for the
.
right node
.
left node
.
both nodes
.
none of the above
Question No: 3 ( Marks: 2 ) - Please choose one
Consider the following tree and four (04) statements.
(i) The above tree is a binary search tree.
(ii) The above tree is a AVL tree.
(iii) The above tree is a Heap.
(iv) The above tree is a Binary tree.
.
(i) and (iii) only
.
(i) only
.
(i) and (ii) only
.
(i) and (iv) only
Question No: 4 ( Marks: 2 ) - Please choose one
Which of the following statement is correct in relation to AVL trees?
.
If three nodes lie in a straight line, a double rotation is needed to restore the balance.
.
If three nodes lie in a straight line, a single rotation is needed to restore the balance.
.
If three nodes lie in a dog-leg pattern (that is, there is a bend in the path), you need
to perform a single rotation to restore the balance.
.
If three nodes lie in a dog-leg pattern (that is, there is a bend in the path), you need
to perform a single rotation twice to restore the balance.
Question No: 5 ( Marks: 2 ) - Please choose one
Which of the following is a more complete recursive definition(s) for a tree?
.
A tree consists of left and right sub-trees.
.
A tree consists of left and right sub-trees and value of the right child node is higher with
respect
the root and less than left child.
.
(i)An Empty structure is an empty tree.
(ii)If t1,t2,t3,……..tk are disjoint trees, then the structure whose root has as its children the
roots of t1,t2…….tk is also a tree.
(iii)Only structures generated by rules (i) and (ii) are trees.
.
A tree consists of left and right sub-trees and value of the right child node is smaller with
respect the root and higher than left child.
Question No: 6 ( Marks: 2 ) - Please choose one
A tree with such a property that items in the left sub-tree are smaller than the root and
items in the right sub-tree are larger than the root is called a
.
AVL tree
.
BST
.
Graph
. Circular queue
Question No: 7 ( Marks: 2 ) - Please choose one
If one fixed the violation property of the above AVL tree, what would be the resulting tree?
.
a
.
b
.
c
.
d
Question No: 8 ( Marks: 6 )
Consider the following expression tree representation. Give the step by step inorder traversing
Question No: 9 ( Marks: 5 )
Convert following infix expression to postfix and show the conversion process.
A . B * C – D + E/F
Question No: 10 ( Marks: 5 )
void order(TreeNode
{
if( treeNode != NULL )
{
order(treeNode->getLeft());
cout << *(treeNode->getInfo())<<" ";
order(treeNode->getRight());
}
}
Describes the code with respect to traversing.
Question No: 11 ( Marks: 10 )
Briefly describes the (ADT) with examples?
Question No: 12 ( Marks: 10 )
What is cost of a search & describe it with example in tree data structure?
Contact vuhelps@gmail.com
Regards
Vuhelps
