Discrete Structure Solved MCQs

1. Universal logic gate is?

2. 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?

3. Floor function maps the real number to the

4. How many bits string of length “Four” are possible such that they contain two 1’s and two 0’s?

5. The graph representing universal relation is called?

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

7. How many elements in the Power set of set A= {{Φ}, {Φ, {Φ}}}?

8. How many types of Canonical forms for a Boolean expression?

9. If x is a set and the set contains an integer which is neither positive nor negative then the set x is?

10. Let the players who play cricket be “twelve”, the ones who play football are “Ten”, and those who play only cricket are “Six” then the number of players who play only football are? assuming there are a total of 16 players.

11. The cardinality of the Power set of the set {2, 4, 6} is?.

12. How many bytes are required for encoding 2000 bits of data?

13. Ceil function maps the real number to the

14. If x is a set and the set contains the real number between 1 and 2, then the set is?

15. How many injections are defined from set X to set Y if set X has 4 elements and set Y has 5 elements?

16. If a bit string contains {0, 1} only, having length “Five” has no more than Two 1’s in it so how many such bit strings are possible?

17. Which option is the negation of the bits “1001011”?

18. Which of the following function is not a mathematical function?

19. Let P and Q be statements then P<->Q is logically equivalent to?

20. If n(A) = 20 and n(B) = 30 and n(A U B) = 40 then n(A ∩ B) is?