2. Select one of the alternatives from the following questions as your answer. [6]
(a) The number of elements in the power set of a set A with |A| = 5 are
D. 25
(b) Let U = {1, 2, 3, 4, 5, 6, 7, 8, 9** be the universal set and A = {1, 2, 3, 4, 5**, B =
{4, 5, 6, 7**. Then A ∩ B¯ =
A. {4, 5**
(c) . . . sorting algorithm is frequently used when n is small, where n is total number of elements.
C. Bubble
(d) Which of the following is not the required condition for binary search algorithm?
A. The list must be sorted.
B. There must be mechanism to delete and/or insert elements in list.
C. There should be the direct access to the middle element in any sub list.
D. Number values should only be present.
(e) The decimal expansion of the integer that has (100111100)2 as its binary expansion
C. 316
(f) Use the definition of addition and multiplication in Zm, the sum 17 +20 19 is
A. 36
B. 56
C. 37
D. 16