Discrete Structure Solved MCQs

Discrete Structure Solved MCQs for Computer Instructor B-17 | AJKPSC & PPSC Exam Prep

Get ready for the Computer Instructor B-17 exams with our collection of Discrete Structure MCQs. Crafted for AJKPSC and PPSC exams, these solved questions focus on key concepts in discrete mathematics.

0%

Discrete Structure MCQS

Discrete Structure Solved MCQs for Computer Instructor B-17 | AJKPSC & PPSC Exam Prep

1 / 20

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

2 / 20

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

3 / 20

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

4 / 20

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

5 / 20

5. Floor function maps the real number to the

6 / 20

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

7 / 20

7. The graph representing universal relation is called?

8 / 20

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

9 / 20

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

10 / 20

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

11 / 20

11. Ceil function maps the real number to the

12 / 20

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

13 / 20

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

14 / 20

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

15 / 20

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

16 / 20

16. Universal logic gate is?

17 / 20

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

18 / 20

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

19 / 20

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

20 / 20

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

Your score is

The average score is 51%

0%

Scroll to Top