Question
1. An element x in A is related to an element y in B (under R1) if x + y is divisible by 3.
2. An element x in B is related to an element y in C (under R2) if x + y is even but not divisible by 3.
Which is the composite relation R1R2 from A to C?
a.
R1R2 = {(1, 2), (1, 4), (3, 3), (5, 4), (7, 3)}
b.
R1R2 = {(1, 2), (1, 3), (3, 2), (5, 2), (7, 3)}
c.
R1R2 = {(1, 2), (3, 2), (3, 4), (5, 4), (7, 2)}
d.
R1R2 = {(3, 2), (3, 4), (5, 1), (5, 3), (7, 1)}
Posted under GATE cse question paper Engineering Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Let R1 be a relation from A = {1, 3, 5, 7} to B = {2, 4, 6, 8} and R2 be another relation from B to C = {1, 2, 3, 4} as defined below: 1. An element x in A is related to an...
Similar Questions
Discover Related MCQs
Q. Let f be a function from a set A to a set B, g a function from B to C, and h a function from A to C, such that h(a) = g(f(a)) for all a ∈ A. Which of the following statements is always true for all such functions f and g?
View solution
Q. Let A be a set with n elements. Let C be a collection of distinct subsets of A such that for any two subsets S1 and S2 in C, either S1 ⊂ S2 or S2⊂ S1. What is the maximum cardinality of C?
View solution
Q. A binary relation R on N x N is defined as follows:
(a, b) R (c, d) if a <= c or b <= d.
Consider the following propositions:
P: R is reflexive
Q: R is transitive
Which one of the following statements is TRUE?
View solution
Q. For the set N of natural numbers and a binary operation f : N x N → N, an element z ∊ N is called an identity for f, if f (a, z) = a = f(z, a), for all a ∊ N. Which of the following binary operations have an identity?
1. f (x, y) = x + y - 3
2. f (x, y) = max(x, y)
3. f (x, y) = x^y
View solution
Q. Given a boolean function f (x1, x2, ..., xn), which of the following equations is NOT true
View solution
Q. Consider the following first order logic formula in which R is a binary relation symbol. ∀x∀y (R(x, y) => R(y, x)) The formula is
View solution
Q. Let P, Q and R be sets let Δ denote the symmetric difference operator defined as PΔQ = (P U Q) - (P ∩ Q). Using Venn diagrams, determine which of the following is/are TRUE? PΔ (Q ∩ R) = (P Δ Q) ∩ (P Δ R) P ∩ (Q ∩ R) = (P ∩ Q) Δ (P Δ R)
View solution
Q. What is the cardinality of the set of integers X defined below? X = {n | 1 ≤ n ≤ 123, n is not divisible by either 2, 3 or 5} ?
View solution
Q. Let A = {a, b, c, d }, B = { p, q, r, s } denote sets. R : A –> B, R is a function from A to B. Then which of the following relations are not functions ?
(i) { (a, p) (b, q) (c, r) }
(ii) { (a, p) (b, q) (c, s) (d, r) }
(iii) { (a, p) (b, s) (b, r) (c, q) }
View solution
Q. Let A = { 1,2,3,4,…….∞ } and a binary operation ‘+’ is defined by a + b = ab ∀ a,b ∈ A. Which of the following is true ?
View solution
Q. The minimum number of cards to be dealt from an arbitrarily shuffled deck of 52 cards to guarantee that three cards are from some same suit is
View solution
Q. An n x n array v is defined as follows:
v[i, j] = i-j for all i, j, 1 <= i <= n, 1 <= j <= n
The sum of the elements of the array v is
View solution
Q. X, Y and Z are closed intervals of unit length on the real line. The overlap of X and Y is half a unit. The overlap of Y and Z is also half a unit. Let the overlap of X and Z be k units. Which of the following is true?
View solution
Q. E1 and E2 are events in a probability space satisfying the following constraints:
Pr(E1) = Pr(E2)
Pr(EI U E2) = 1
E1 and E2 are independent
The value of Pr(E1), the probability of the event E1 is
View solution
Q. A polynomial p(x) satisfies the following:
p(1) = p(3) = p(5) = 1
p(2) = p(4) = -1
The minimum degree of such a polynomial is
View solution
Q. A relation R is defined on the set of integers as xRy if f(x + y) is even. Which of the following statements is true?
View solution
Q. Let a, b, c, d be propositions. Assume that the equivalences a ↔ (b V-b) and b ↔ c hold. Then the truth value of the formula (a ∧ b) → (a ∧ c) ∨ d) is always
View solution
Q. Let G be an undirected connected graph with distinct edge weight. Let emax be the edge with maximum weight and emin the edge with minimum weight. Which of the following statements is false?
View solution
Q. Let G be an undirected graph. Consider a depth-first traversal of G, and let T be the resulting depth-first search tree. Let u be a vertex in G and let v be the first new (unvisited) vertex visited after visiting u in the traversal. Which of the following statements is always true?
View solution
Q. Consider the following statements:
S1: The sum of two singular n × n matrices may be non-singular
S2: The sum of two n × n non-singular matrices may be singular.
Which of the following statements is correct?
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Engineering 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!