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:

Related MCQs

• If a has relation with b and b has relation with c then a has relation with c is………………..Relation.
• Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation on A. Let C denote the length of the maximal chain, M the number of maximal elements, and m the number of minimal elements. Which is true?
• Let p be “He is tall” and let q “He is handsome”. Then the statement “It is false that he is short or handsome” is:
• 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 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
• Let N+ denote the nonzero natural numbers. Define a binary relation R on N+ × N+ by (m, n)R(s, t) if gcd(m, n) = gcd(s, t). The binary relation R is
• Let f : X →Y and g : Y → Z. Let h = go f : X → Z. Suppose g is one-to-one and onto. Which of the following is FALSE?
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not reflexive and not symmetric.
• Let R = {(a, a), (a, b)} be a relation on S = {a, b, c}. Then R is not transitive.
• Let P(S) denote the power set of set S. which of the is always true