adplus-dvertising
frame-decoration

Question

Let R be a relation on the set of ordered pairs of positive integers such that ((p, q), (r, s)) ∈ R if and only if p–s = q–r. Which one of the following is true about R?

a.

Both reflexive and symmetric

b.

Reflexive but not symmetric

c.

Not reflexive but symmetric

d.

Neither reflexive nor symmetric

Answer: (c).Not reflexive but symmetric

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Let R be a relation on the set of ordered pairs of positive integers such that ((p, q), (r, s)) ∈ R if and only if p–s = q–r. Which one of the following is true about R?

Similar Questions

Discover Related MCQs

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 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?  

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?  

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?

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?

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

Q. Given a boolean function f (x1, x2, ..., xn), which of the following equations is NOT true

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

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)

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

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

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 ?

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

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

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?

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

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

Q. A relation R is defined on the set of integers as xRy if f(x + y) is even. Which of the following state­ments is true?

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

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?

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?