 
			 
			MCQOPTIONS
 Saved Bookmarks
				This section includes 10 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. | A relation R is defined on the set of integers as aRb if and only if a+b is even and R is termed as ______ | 
| A. | an equivalence relation with one equivalence class | 
| B. | an equivalence relation with two equivalence classes | 
| C. | an equivalence relation | 
| D. | an equivalence relation with three equivalence classes | 
| Answer» C. an equivalence relation | |
| 3. | 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 | |
| 4. | The number of equivalence relations of the set {3, 6, 9, 12, 18} is ______ | 
| A. | 4 | 
| B. | 25 | 
| C. | 22 | 
| D. | 90 | 
| Answer» B. 25 | |
| 5. | Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) ∈ N2 | a!= b} satisfies _______ property. | 
| A. | symmetry | 
| B. | ∈ N2 | a!= b} satisfies _______ property.a) symmetryb) transitivity | 
| C. | antisymmetry | 
| D. | reflexivity | 
| Answer» B. ∈ N2 | a!= b} satisfies _______ property.a) symmetryb) transitivity | |
| 6. | 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. | |
| 7. | ______ 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. | 26 | 
| B. | 6 | 
| C. | 8 | 
| D. | 36 | 
| Answer» C. 8 | |
| 8. | The condition for a binary relation to be symmetric is _______ | 
| A. | s(R) = R | 
| B. | R ∪ R = R | 
| C. | R = Rc | 
| D. | f(R) = R | 
| Answer» D. f(R) = R | |
| 9. | If R1 and R2 are binary relations from set A to set B, then the equality ______ holds. | 
| A. | (Rc)c = Rc | 
| B. | (A x B)c = Φ | 
| C. | c = Rcb) (A x B)c = Φc) (R1 U R2)c = R1c ∪ R2c | 
| D. | (R1 U R2)c = R1c ∩ R2c | 
| Answer» D. (R1 U R2)c = R1c ∩ R2c | |
| 10. | R is a binary relation on a set S and R is reflexive if and only if _______ | 
| A. | r(R) = R | 
| B. | s(R) = R | 
| C. | t(R) = R | 
| D. | f(R) = R | 
| Answer» B. s(R) = R | |