If A is any non-empty set and R is a partial ordered relation on set A, then the ordered pair (A,R) is called -------

Related MCQs

• 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
• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• A partial ordered relation is transitive, reflexive and
• 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:
• Define a binary relation R on a set A to be anti- reflexive if xRx doesn’t hold for any x 2 A. The number of symmetric, anti-reflexive binary relations on a set of ten elements is
• If R is a relation defined from set A to set B then------
• If A is a set with 3 elements, how many equivalence relations are there on A? Hint: The set of equivalence classes for a given equivalence relation on A is a partition of the set A.
• Consider the recurrence relation ak = 6ak-1 - 9ak-2 with initial conditions a0 = 0 and a1 = 2. Which of the following is an explicit solution to this recurrence relation, provided the constants A and B are chosen correctly?
• Let S be a set of n elements. The number of ordered pairs in the largest and the smallest equivalence relations on S are: