What is the maximum number of nodes in a binary tree with L leaves?
A -
2^L
B -
2^(L+1)
C -
None of the others answers
D -
there is no maximum
2-
What is the minimum height of a binary tree with 31 nodes?
A -
3
B -
7
C -
2
D -
5
3-
What is the minimum height of a binary tree with 31 nodes?
A -
5
B -
6
C -
None of the above
D -
4
4-
What is the depth of node E?
A -
4
B -
3
C -
1
D -
2
5-
What is the effect of the following statement on the linked list as given in figure.
P = P->Link
A -
The statement is invalid and will cause an error at rum-time
B -
The statement is invalid and will cause a syntax error during complilation
C -
The statement is valid and after execution of the statement p will be assigned the value null
D -
The statement is valid and after execution of the statement the link field of the node will point back to itself
6-
When using delete newPtr:
A -
None of the others answers
B -
The newPtr itself is deleted
C -
The space newPtr points to is deleted
D -
Both are right
7-
When deciding on a particular algorithm to use in a program, which of the following
should be taken into consideration?
I. The speed of implementation for the algorithm.
II. The space requirements of the algorithm.
III. The ease with which the logic of the algorithm can be understood.
A -
III only
B -
I and II only
C -
II and III only
D -
I, II, and III
8-
Which of the following abstract data types are NOT used by Integer Abstract Data type
group?
A -
long
B -
float
C -
Short
D -
Int
9-
Which of the following about the above tree is #
A -
5 was inserted earlier than 8
B -
The height will be increased if we insert 10
C -
The preorder traversal is 5 3 1 2 4 8 7 6 9
D -
Preorder
10-
Which of the following is not a control structure used in developing structured
algorithms?
