Question # 1 of 10 ( Start time: 07:36:03 PM ) Total
Marks: 1
For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.
Select correct option:
N – (h – 1)
N – (h + 1)
N – 1
N – 1 + h
Question # 2 of 10 ( Start time: 07:36:32 PM ) Total Marks: 1
The expression if ( ! heap->isEmpty() ) checks
Select correct option:
Heap is empty
Heap is full
Heap is not empty
Not a valid expression
Question # 3 of 10 ( Start time: 07:36:55 PM ) Total Marks: 1
Which one of the following is NOT the property of equivalence relation?
Select correct option:
Reflexive
Symmetric
Transitive
Associative
Question # 4 of 10 ( Start time: 07:37:22 PM ) Total Marks: 1
If a tree has 20 edges/links, then the total number of nodes in the tree will be :
Select correct option:
19
20
21
Can't be determined
Question # 5 of 10 ( Start time: 07:37:58 PM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear
Exponential
Polynomial
None of the given options
Question # 5 of 10 ( Start time: 07:37:58 PM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear
Exponential
Polynomial
None of the given options
Question # 6 of 10 ( Start time: 07:38:23 PM ) Total Marks: 1
given the values are the array representation of heap; 12 23 26 31 34 44 56 64 78 100 If we perform 4 deleteMin operations, the last element deleted is__________.
Select correct option:
31
34
44
56
Question # 8 of 10 ( Start time: 07:39:48 PM ) Total Marks: 1
Suppose there are a set of fruits and a set of vegetables. Both sets are ______________ sets.
Select correct option:
Disjoint
Subsets
Whole
Equal
Question # 10 of 10 ( Start time: 07:40:42 PM ) Total Marks: 1
The preculateDown procedure will move the smaller value____ and bigger value______.
Select correct option:
left,right
right,left
up,down
down,up
For a perfect binary tree of height h, having N nodes, the sum of heights of nodes is _____________.
Select correct option:
N – (h – 1)
N – (h + 1)
N – 1
N – 1 + h
Question # 2 of 10 ( Start time: 07:36:32 PM ) Total Marks: 1
The expression if ( ! heap->isEmpty() ) checks
Select correct option:
Heap is empty
Heap is full
Heap is not empty
Not a valid expression
Question # 3 of 10 ( Start time: 07:36:55 PM ) Total Marks: 1
Which one of the following is NOT the property of equivalence relation?
Select correct option:
Reflexive
Symmetric
Transitive
Associative
Question # 4 of 10 ( Start time: 07:37:22 PM ) Total Marks: 1
If a tree has 20 edges/links, then the total number of nodes in the tree will be :
Select correct option:
19
20
21
Can't be determined
Question # 5 of 10 ( Start time: 07:37:58 PM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear
Exponential
Polynomial
None of the given options
Question # 5 of 10 ( Start time: 07:37:58 PM ) Total Marks: 1
We can build a heap in _____ time.
Select correct option:
Linear
Exponential
Polynomial
None of the given options
Question # 6 of 10 ( Start time: 07:38:23 PM ) Total Marks: 1
given the values are the array representation of heap; 12 23 26 31 34 44 56 64 78 100 If we perform 4 deleteMin operations, the last element deleted is__________.
Select correct option:
31
34
44
56
Question # 8 of 10 ( Start time: 07:39:48 PM ) Total Marks: 1
Suppose there are a set of fruits and a set of vegetables. Both sets are ______________ sets.
Select correct option:
Disjoint
Subsets
Whole
Equal
Question # 10 of 10 ( Start time: 07:40:42 PM ) Total Marks: 1
The preculateDown procedure will move the smaller value____ and bigger value______.
Select correct option:
left,right
right,left
up,down
down,up
Comments
Post a Comment
Please give us your feedback & help us to improve this site.