Discrete Structure Solved MCQs

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

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

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

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

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

6. The graph representing universal relation is called?

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

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

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

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

11. Ceil function maps the real number to the

12. Universal logic gate is?

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

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

15. Floor function maps the real number to the

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

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

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

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

20. 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.