adplus-dvertising
frame-decoration

Question

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)}

Posted under Discrete Mathematics

Answer: (d).{(0,1), (0,2), (1,2), (2,2), (3,4), (5,3), (5,4)}

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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 _______

Similar Questions

Discover Related MCQs

Q. Amongst the properties {reflexivity, symmetry, antisymmetry, transitivity} the relation R={(a,b) ∈ N² | a!= b} satisfies _______ property.

Q. The number of equivalence relations of the set {3, 6, 9, 12, 18} is ______

Q. Let R₁ and R₂ be two equivalence relations on a set. Is R₁ ∪ R₂ an equivalence relation?

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 ______

Q. The binary relation U = Φ (empty set) on a set A = {11, 23, 35} is _____

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 __________

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 _________

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 ____________

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?

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?

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?

Q. The time complexity of computing the transitive closure of a binary relation on a set of n elements should be ________

Q. Let A and B be two non-empty relations on a set S. Which of the following statements is false?

Q. Determine the characteristics of the relation aRb if a² = b².

Q. Let R be a relation between A and B. R is asymmetric if and only if ________

Q. Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is ______

Q. The less-than relation, <, on a set of real numbers is ______

Q. If the longest chain in a partial order is of length l, then the partial order can be written as _____ disjoint antichains.

Q. Suppose X = {a, b, c, d} and π1 is the partition of X, π₁ = {{a, b, c}, d}. The number of ordered pairs of the equivalence relations induced by __________

Q. A partial order P is defined on the set of natural numbers as follows. Here a/b denotes integer division. i)(0, 0) ∊ P. ii)(a, b) ∊ P if and only if a % 10 ≤ b % 10 and (a/10, b/10) ∊ P. Consider the following ordered pairs:

i. (101, 22) ii. (22, 101) iii. (145, 265) iv. (0, 153)

The ordered pairs of natural numbers are contained in P are ______ and ______