Question
a.
12
b.
144
c.
136
d.
79
Posted under Relations Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. The rank of smallest equivalence relation on a set with 12 distinct elements is _______
Similar Questions
Discover Related MCQs
Q. If a set A has 8 elements and a set B has 10 elements, how many relations are there from A to B?
View solution
Q. Synonym for binary relation is _______
View solution
Q. R is a binary relation on a set S and R is reflexive if and only if _______
View solution
Q. If R₁ and R₂ are binary relations from set A to set B, then the equality ______ holds.
View solution
Q. The condition for a binary relation to be symmetric is _______
View solution
Q. ______ 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.
View solution
Q. 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 _______
View solution
Q. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) ∈ N² | a!= b} satisfies _______ property.
View solution
Q. The number of equivalence relations of the set {3, 6, 9, 12, 18} is ______
View solution
Q. Let R₁ and R₂ be two equivalence relations on a set. Is R₁ ∪ R₂ an equivalence relation?
View solution
Q. 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 ______
View solution
Q. The binary relation U = Φ (empty set) on a set A = {11, 23, 35} is _____
View solution
Q. The binary relation {(1,1), (2,1), (2,2), (2,3), (2,4), (3,1), (3,2)} on the set {1, 2, 3} is __________
View solution
Q. Consider the relation: R’ (x, y) if and only if x, y>0 over the set of non-zero rational numbers,then R’ is _________
View solution
Q. Let S be a set of n>0 elements. Let be the number Bᵣ of binary relations on S and let Bf be the number of functions from S to S. The expression for Bᵣ and Bf, in terms of n should be ____________
View solution
Q. Let A be a set of k (k>0) elements. Which is larger between the number of binary relations (say, Nr) on A and the number of functions (say, Nf) from A to A?
View solution
Q. Consider the binary relation, A = {(a,b) | b = a – 1 and a, b belong to {1, 2, 3}}. The reflexive transitive closure of A is?
View solution
Q. Let R₁ be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R₂ be another relation from B to C = {1, 2, 3, 4} as defined below:
i. An element a in A is related to an element b in B (under R₁) if a * b is divisible by 3.
ii. An element a in B is related to an element b in C (under R₂) if a * b is even but not divisible by 3. Which is the composite relation R₁R₂ from A to C?
View solution
Q. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________
View solution
Q. Let A and B be two non-empty relations on a set S. Which of the following statements is false?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
Cyber Security
Understand the fundamentals of safeguarding digital assets with our Cyber Security...
Operating System
Dive deep into the core of computers with our Operating System MCQs. Learn about...