Tag: Data Structures and Algorithms Mcq

(A) Push
(B) Pop
(C) Top
(D) First

(A) The array elements must form a heap
(B) The array must have at least 2 entries
(C) The array must be sorted
(D) The array size must be a power of two

(A) 0 3 8 9 1 7 5 2 6 4
(B) 2 6 4 0 3 8 9 1 7 5
(C) 2 6 4 9 1 7 0 3 8 5
(D) 0 3 8 2 6 4 9 1 7 5

(A) Left to right
(B) Right to left
(C) Not filled at all
(D) None of the above

(A) It is not a requirement that a find operation returns any specific name, just that finds on two elements return the same answer if and only if they are in the same set
(B) One idea might be to use a tree to represent each set, since each element in a tree has the same root, thus the root can be used to name the set
(C) Initially each set contains one element
(D) Initially each set contains one element and it does not make sense to make a tree of one node only

(A) A find(x) on element x is performed by returning exactly the same node that is found
(B) A find(x) on element x is performed by returning the root of the tree containing x
(C) A find(x) on element x is performed by returning the whole tree itself containing x
(D) A find(x) on element x is performed by returning TRUE

(A) 16, 18, 20, 22, 24, 28, 30
(B) 16, 20, 18, 24, 22, 30, 28
(C) 16, 24, 18, 28, 30, 20, 22
(D) 16, 24, 20, 30, 28, 18, 22

(A) 21
(B) 41
(C) 42
(D) 43