The Transitive Closure of a relation R is denoted by----

Related MCQs

• Define a binary relation R = {(0, 1), (1, 2), (2, 3), (3, 2), (2, 0)} on A = {0, 1, 2, 3}. The directed graph (including loops) of the transitive closure of this relation has
• The alternative method to find transitive closure of R* is-------.
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• A relation that is reflexive, anti-symmetric and transitive is a
• A partial ordered relation is transitive, reflexive and
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not transitive.
• Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is
• The Relation is----------if a has relation with b and b has relation with a.
• Let R be a relation on a set A = {1, 2, 3, 4} given by R = {(1, 1), (1, 2), (1, 3), (2, 1), (2,2), (2, 3), (3, 1), (3, 2), (3, 3)}. Then the relation is:
• Consider the recurrence relation ak = -8ak-1 - 15ak-2 with initial conditions a0 = 0 and a1 = 2. Which of the following is an explicit solution to this recurrence relation?