1) If x is a set and the set contains an integer which is neither positive nor negative then

the set x is ____________.

a. Set is Empty
b. Set is Non-empty
c. Set is Finite.
d. Set is both Non- empty and Finite.

2) If x ∈ N and x is prime, then x is ________ set.

a. Infinite set
b. Finite set
c. Empty set
d. Not a set

3) If x is a set and the set contains the real number between 1 and 2, then the set is ________.

a. Empty set
b. Finite set
c. Infinite set
d. None of the mentioned

4) Which of the following is a subset of set {1, 2, 3, 4}?

a. {1, 2}
b. {1, 2, 3}
c. {1}
d. All of the mentioned

5) Convert the set x in roster form if set x contains the positive prime number, which divides
72.

a. {∅}
b. {2, 3}
c. {2, 3, 7}
d. {3, 5, 7}
6) Power set of empty or Null set has exactly _________ subset.

a. One
b. Two
c. Zero
d. Three

7) What is the Cartesian product of set A and set B, if the set A = {1, 2} and set B = {a, b}?

a. { (1, a), (1, b), (2, a), (b, b) }

b. { (1, 1), (2, 2), (a, a), (b, b) }
c. { (1, a), (2, a), (1, b), (2, b) }
d. { (1, 1), (a, a), (2, a), (1, b) }

8) The members of the set S = {x | x is the square of an integer and x < 100} is
________________

a. {0, 2, 4, 5, 9, 55, 46, 49, 99, 81}

b. {1, 4, 9, 16}
c. {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
d. {0, 1, 4, 9, 25, 36, 49, 123}

9) The intersection of the sets {1, 2, 8, 9, 10, 5} and {1, 2, 6, 10, 12, 15} is the set _____________

a. {1, 2, 10}
b. {5, 6, 12, 15}
c. {2, 5, 10, 9}
d. sd) {1, 6, 12, 9, 8}

10) The difference of {1, 2, 3, 6, 8} and {1, 2, 5, 6} is the set ____________

a. {1, 3}
b. {5, 6, 8}
c. {3, 8}
d. {2, 6, 5}
11) If n(A) = 20 and n(B) = 30 and n(A U B) = 40 then n(A ∩ B) is?

a. 20
b. 30
c. 40
d. 10

12) Let the players who play cricket be 12, the ones who play football 10, those who play
only cricket are 6, then the number of players who play only football are ___________,
assuming there is a total of 16 players.

a. 16
b. 8
c. 4
d. 10

13) Which among the following can be taken as the discrete object?

a. People
b. Rational numbers
c. Integers
d. All of the mentioned

14) Which option contains two equal sets?

a. X = {5, 6} and Y = {6}

b. X = {5, 6, 8, 9} and Y = {6, 8, 5, 9}
c. X = {5, 6, 9} and Y = {5, 6}
d. X = {5, 6} and Y = {5, 6, 3}

15) The cardinality of the Power set of the set {1, 5, 6} is______________.

a. 5
b. 6
c. 8
d. 10
16) The Cartesian product of the (Set Y) x (Set X) is equal to the Cartesian product of (Set
X) x (Set Y) or Not?

a. Yes
b. No
c. None of the above
d. I Don't know

17) How many elements in the Power set of set A= {{Φ}, {Φ, {Φ}}}?

a. 4 elements
b. 2 elements
c. 6 elements
d. 5 elements

18) Mathematics can be broadly categorized into how many types?

a. 3 types
b. 2 types
c. 5 types
d. 4 types

19) Which of the following function is not a mathematics function?

a. many to one
b. one-to-many
c. one to one
d. All of the mentioned

20) Which of the following function is also referred to as an injective function?

a. Many-to-one
b. Onto
c. One-to-One
d. None of the mentioned
21) How many injections are defined from set A to set B if set A has 4 elements and set B
has 5 elements?

a. 24
b. 64
c. 144
d. 120

22) The function (gof) is _________ , if the function f and g are onto function?

a. Into function
b. one to one function
c. onto function
d. one-to-many function

23) How many bytes are needed for encoding 2000 bits of data?

a. 5 Byte
b. 2 bytes
c. 4 bytes
d. 8 bytes

24) The cardinality of the set of even positive integers less than 20 is__________?

a. 8
b. 10
c. 9
d. 12

25) If X = {2, 8, 12, 15, 16} and Y= {8, 16, 15, 18, 9} then union of X and Y is___________.

a. {2, 8, 12, 15, 16}

b. { 8, 16, 15}
c. {8, 16, 15, 18, 9}
d. {2, 8, 9, 12, 15, 16, 18}`
26) What is Floor function?

a. It maps the real number to the greatest previous integer

b. It maps the real number to the smallest previous integer
c. It maps the real number to the smallest following integer
d. None of the mentioned

27) What is Ceil function?

a. It maps the real number to the greatest previous integer

b. It maps the real number to the smallest previous integer
c. It maps the real number to the smallest following integer
d. None of the mentioned

28) What is the value of Floor(8.4) + Ceil(9.9)?

a. 18
b. 19
c. 20
d. 17

29) If a and b are two positive numbers that are less than one, then the maximum value of
Floor(a+b) and Ceil(a+b) is?

a. Floor(a+b) is 0 and Ceil(a+b) is 1.

b. Floor(a+b) is 1 and Ceil(a+b) is 0.
c. Floor(a+b) is 1 and Ceil(a+b) is 2.
d. Floor(a+b) is 2 and Ceil(a+b) is 1

30) How many relations exist from set X to set Y if the set X and set Y has 7 and 8 elements?

a. 256
b. 272
c. 356
d. 56
31) The number of reflexive closure of the relation {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} on
the set {0, 1, 2, 3} is________.

a. 36
b. 8
c. 6
d. 26

32) The number of transitive closure exists in the relation R = {(0,1), (1,2), (2,2), (3,4), (5,3),
(5,4)} where {1, 2, 3, 4, 5} ∈ A is__________.

a. {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}

b. {(0,0), (4,4), (5,5), (1,1), (2,2), (3,3)}
c. {(0,1), (1,2), (2,2), (3,4)}
d. {(0,1), (5,3), (5,4), (1,1), (2,2)}

33) Which statement is incorrect if X and Y are the two non-empty relations on the set S.

a. If X and Y are transitive, then the intersection of X and Y is also transitive.

b. If X and Y are reflexive, then the intersection of X and Y is also reflexive.
c. If X and Y are symmetric, then the union of X and Y is not symmetric.
d. If X and Y are transitive, then the union of X and Y is not transitive.

34) Which option is the negation of the bits "1001011"?

a. 11011011
b. 10110100
c. 0110100
d. 1100100

35) What is the output of X (Ex-or) Y, if the bits of X is 001101 and the bits of Y is 100110?

a. Output of X (Ex-or) Y is 101011

b. Output of X (Ex-or) Y is 1101010
c. Output of X (Ex-or) Y is 101000
d. Output of X (Ex-or) Y is 0010101
36) Boolean algebra deals with how many values.

a. It deals with only four discrete values.

b. It deals with only five discrete values.
c. It deals with only three discrete values.
d. It deals with only two discrete values.

37) Which of the following Law of Boolean proofs the X.X=X?

a. Identity Law
b. Double Complement Law
c. Complement Law
d. Idempotent Law

38) According to the symmetric matrix, which of the following statement is correct?

a. A = AT
b. All the diagonal elements of a symmetric matrix are One.
c. A = -AT
d. All the diagonal elements of a symmetric matrix are Zero.

39) Which of the following matrix having only one row and multiple columns?

a. Diagonal Matrix
b. Row Matrix
c. Column Matrix
d. None of the mentioned

40) Which of the following matrix having only one column and multiple rows?

a. Diagonal Matrix
b. Row Matrix
c. Column Matrix
d. None of the mentioned
41) Which of the following condition is correct if we want to add two matrices?

a. Both rows and columns of both the matrices which we want to add are the same
b. Columns of both the matrices which we want to add are equal
c. Rows of both the matrices which we want to add are the same
d. a number of the first matrix's rows should be equal to the number of the second
matrix's column, which we want to add.

42) A+B = B+A is a true or false statement if the order of A matrix and B matrix is the
same.

a. False
b. True

43) XY = YX is a true or false statement if the order of A matrix and B matrix is the same.

a. False
b. True

44) Universal logic gate is__________.

a. OR
b. NOT
c. NAND
d. AND

45) In which year Maurice Karnaughin introduced the Karnaugh map?

a. 1953
b. 1956
c. 1952
d. 1950
46) Canonical forms for a boolean expression has _______ types.

a. Three types
b. Four types
c. Two types
d. Five types

47) The use of Boolean algebra is ____________.

a. in building the algebraic functions.

b. in building logic symbols.
c. in circuit theory.
d. in designing the digital computers.

48) Boolean algebra deals with how many values.

a. It deals with only four discrete values.

b. It deals with only five discrete values.
c. It deals with only three discrete values.
d. It deals with only two discrete values.

49) Which search compares each element with the searching element till not found?

a. Merge search
b. Sequential Search
c. Binary search
d. none of the mentioned

50) If a user wants to sort the unsorted list of n elements, then the insertion sort starts with
which element of the list.

a. First element of the list

b. the second element of the list
c. the Third element of the list
d. the Fourth element of the list
51) What is the complexity of the bubble sort algorithm?

a. O(n2)
b. O(n)
c. O(log n)
d. O(n log n)

52) What is the worst case of a linear search algorithm?

a. When the searching item is present in the middle of the list.

b. When the searching item is the last element in the list.
c. When the searching is not available in the list.
d. When the searching item is the last element in the list or is not present in the
list.

53) Which algorithm uses the previous outputs for finding the new outputs?

a. Dynamic Programming algorithms

b. Divide and Conquer algorithm
c. Brute Force algorithm
d. None of them

54) Which option is correct for representing an algorithm?

a. Pseudo codes
b. Flow charts
c. Statements in the common language
d. All of them

55) Which case does not exist in complexity theory?

a. Average case
b. Null case
c. Best case
d. Worst Case
Discrete Mathematics Multiple-Choice Questions
1. Consider x ∈ N where x is prime. Here, x is a ________ set.

a. Empty

b. Infinite

c. Finite

d. Not a set

Answer: (b) Infinite

2. Convert a set x in the roster form, where the set x consists of the positive prime
number that divides 72.

a. {3, 5, 7}

b. {2, 3, 7}

c. {2, 3}

d. {∅}

Answer: (c) {2, 3}

3. _____________ is the intersection of the two sets {1, 2, 8, 9, 10, 5} and {1, 2, 6,
10, 12, 15}.

a. sd) {1, 6, 12, 9, 8}

b. {2, 5, 10, 9}

c. {5, 6, 12, 15}

d. {1, 2, 10}

Answer: (d) {1, 2, 10}

4. If n(P) = 20 and n(Q) = 30 and n(P U Q) = 40 then n(P ∩ Q) is:

a. 10

b. 20

c. 30

d. 40

Answer: (a) 10

5. Which of these can be taken as discrete objects?

a. Rational numbers

b. Integers

c. People

d. All of the above

Answer: (d) All of the above

6. If the functions g and f are onto functions, then the function (gof) is _________
function:

a. onto

b. one to one

c. one-to-many

d. Into

Answer: (a) onto

7. If set P consists of 4 elements and set Q consists of 5 elements, then how many
injections can we define from set P to set Q?

a. 144

b. 120

c. 64

d. 24

Answer: (b) 120

8. Total number of bytes needed to encode 2000 bits of data:

a. 8 Byte

b. 4 bytes

c. 5 bytes

d. 2 bytes

Answer: (d) 2 bytes

9. The cardinality of a less than 20 even positive integers set is:

a. 12

b. 9

c. 10

d. 8

Answer: (b) 9
10. If P = {2, 8, 12, 15, 16} and Q = {8, 16, 15, 18, 9}, then the union of P and Q is
___________.

a. {2, 8, 9, 12, 15, 16, 18}

b. {8, 16, 15, 18, 9}

c. {2, 8, 12, 15, 16}

d. {8, 16, 15}

Answer: (a) {2, 8, 9, 12, 15, 16, 18}

11. Consider two positive numbers a and b less than one, where the maximum
values of Ceil(a+b) and Floor(a+b) is:

a. Ceil(a+b) is 1 and Floor(a+b) is 2

b. Ceil(a+b) is 2 and Floor(a+b) is 1

c. Ceil(a+b) is 0 and Floor(a+b) is 1

d. Ceil(a+b) is 1 and Floor(a+b) is 0

Answer: (b) Ceil(a+b) is 2 and Floor(a+b) is 1

12. What is the negation of the “1001011” bits?

a. 0110100

b. 1100100

c. 10110100

d. 11011011

Answer: (a) 0110100

13. If the bits of Y = 100110 and the bits of X = 001101, then the output of the X (Ex-
or) Y will be:

a. 101011

b. 1101010

c. 101000

d. 0010101

Answer: (a) 101011

14. Which of these Law of Boolean would prove the X.X=X:

a. Idempotent Law

b. Complement Law

c. Double Complement Law

d. Identity Law

Answer: (a) Idempotent Law

15. Which of these conditions is apt if one wants to add two matrices?

a. Columns of both of those matrices that we would add are equal.

b. The columns and rows of the matrices that we want to add are similar.

c The total number of the rows of the first matrix must be equal to the total number of
columns in the second matrix that we want to add.

d. The rows of both of those matrices that we would add are similar.

Answer: (a) Columns of both of those matrices that we would add are equal.
16. _____________ is the Universal logic gate:

a. AND

b. NAND

c. NOT

d. OR

Answer: (b) NAND

17. For a Boolean Expression, the canonical forms have _______ types.

a. Four

b. Three

c. Five

d. Two

Answer: (d) Two

18. In complexity theory, which case does NOT exist?

a. Worst Case

b. Best Case

c. Null Case

d. Average Case

Answer: (c) Null case

19. The primary use of the Boolean algebra is ____________:

a. to design the digital computers

b. in circuit theory

c. to build the logic symbols

d. to build algebraic functions

Answer: (a) to design the digital computers

20. The _______________ search compares every element against the searching
element until it is not found:

a. Binary

b. Merge

c. Sequential

d. none of the above

Answer: (c) Sequential