During union by size method, which data structure is used to improve the balancing of tree?
Select correct option:
Array
Stack
Linked List
Tree
Suppose there are a set of fruits and a set of vegetables. Both sets are ______________ sets.
Disjoint
Subsets
Whole
Whole
Question # 3 of 10 ( Start time: 06:23:27 PM ) Total Marks: 1
Suppose there is an image segmented into pixels. Each pixel has _________ neighbour(s).
Select correct option:
0
4
8
16
Question # 5 of 10 ( Start time: 06:25:45 PM ) Total Marks: 1
Suppose there are 100 elements in an equivalence class, so initially there will be 100 trees. The collection of these trees is called ________________.
Select correct option:
Cluster
Class
Forest
Bunch
Question # 6 of 10 ( Start time: 06:26:40 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
Question # 7 of 10 ( Start time: 06:28:12 PM ) Total Marks: 1
A binary relation R over S is called an equivalence relation if it has following property(s)
Select correct option:
Reflexivity
Symmetry
Transitivity
All of the given options
Question # 8 of 10 ( Start time: 06:29:44 PM ) Total Marks: 1
The array in binary search is sub divided ______________.
Select correct option:
Once
Twice
N time
Until a sublist is no more divisible
Question # 9 of 10 ( Start time: 06:30:53 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 # 10 of 10 ( Start time: 06:32:07 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
