

MCQOPTIONS
Saved Bookmarks
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Discrete Mathematics knowledge and support exam preparation. Choose a topic below to get started.
1. |
The binary relation U = (empty set) on a set A = {11, 23, 35} is _____ |
A. | Neither reflexive nor symmetric |
B. | Symmetric and reflexive |
C. | Transitive and reflexive |
D. | Transitive and symmetric |
Answer» E. | |
2. |
Let R1 and R2 be two equivalence relations on a set. Is R1 R2 an equivalence relation? |
A. | an equivalence relation |
B. | reflexive closure of relation |
C. | not an equivalence relation |
D. | partial equivalence relation |
Answer» B. reflexive closure of relation | |
3. |
Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) N2 | a!= b} satisfies _______ property. |
A. | symmetry |
B. | transitivity |
C. | antisymmetry |
D. | reflexivity |
Answer» B. transitivity | |
4. |
The transitive closure of the relation {(0,1), (1,2), (2,2), (3,4), (5,3), (5,4)} on the set {1, 2, 3, 4, 5} is _______ |
A. | {(0,1), (1,2), (2,2), (3,4)} |
B. | {(0,0), (1,1), (2,2), (3,3), (4,4), (5,5)} |
C. | {(0,1), (1,1), (2,2), (5,3), (5,4)} |
D. | {(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)} |
Answer» E. | |
5. |
______ number of reflexive closure exists in a relation R = {(0,1), (1,1), (1,3), (2,1), (2,2), (3,0)} where {0, 1, 2, 3} A. |
A. | 2<sup>6</sup> |
B. | 6 |
C. | 8 |
D. | 36 |
Answer» C. 8 | |
6. |
If R1 and R2 are binary relations from set A to set B, then the equality ______ holds. |
A. | (R<sup>c</sup>)<sup>c</sup> = R<sup>c</sup> |
B. | (A x B)<sup>c</sup> = |
C. | (R<sub>1</sub> U R<sub>2</sub>)<sup>c</sup> = R<sub>1</sub><sup>c</sup> R<sub>2</sub><sup>c</sup> |
D. | (R<sub>1</sub> U R<sub>2</sub>)<sup>c</sup> = R<sub>1</sub><sup>c</sup> R<sub>2</sub><sup>c</sup> |
Answer» D. (R<sub>1</sub> U R<sub>2</sub>)<sup>c</sup> = R<sub>1</sub><sup>c</sup> R<sub>2</sub><sup>c</sup> | |