The smallest equivalence relation on the set A = {a, b, c} is:
A) {(a, a), (b, b), (c, c)}
B) {(a, a), (b, b), (c, c), (a, b), (b, a)}
C) A × A
D) {(a, b), (b, c)}

Let the function f: N → N be defined by f(x) = 2x. Then f is:
A) One-to-one but not onto
B) Onto but not one-to-one
C) Both one-to-one and onto
D) Neither one-to-one nor onto

Let A = {1, 2, 3}. Which of the following relations on A is reflexive?
A) {(1, 2), (2, 1), (1, 1)}
B) {(1, 1), (2, 2), (3, 3), (1, 3)}
C) {(1, 1), (2, 2)}
D) {(1, 2), (2, 3), (3, 1)}

Let R be a relation on the set of human beings in a town at a particular time, given by R = {(x, y) : x is exactly 7 cm taller than y}. This relation is:
A) Reflexive
B) Symmetric
C) Transitive
D) None of the above

The function f: R → R defined by f(x) = 3x + 5 is:
A) One-to-one but not onto
B) Onto but not one-to-one
C) Both one-to-one and onto
D) Neither one-to-one nor onto

The function f: R → R defined by f(x) = x² + 1 is:
A) One-to-one but not onto
B) Onto but not one-to-one
C) Both one-to-one and onto
D) Neither one-to-one nor onto

The function f: Z → Z defined by f(x) = x³ is:
A) One-to-one but not onto
B) Onto but not one-to-one
C) Both one-to-one and onto
D) Neither one-to-one nor onto

The greatest integer function f: R → R, defined by f(x) = [x], is:
A) One-to-one
B) Onto
C) Both one-to-one and onto
D) Neither one-to-one nor onto

Let R be a relation on a set A such that R = R⁻¹. Then the relation R is:
A) Reflexive
B) Symmetric
C) Transitive
D) Equivalence

The relation R in the set of real numbers R defined as R = {(a, b) : a ≤ b²} is:
A) Reflexive
B) Symmetric
C) Transitive
D) None of the above

Let f: R → R be defined as f(x) = x⁴. Choose the correct answer.
A) f is one-one and onto
B) f is many-one and onto
C) f is one-one but not onto
D) f is neither one-one nor onto

A function f: A → B is said to be onto (surjective) if:
A) The range of f is a proper subset of B
B) The range of f is equal to B
C) For every y ∈ B, there exists at most one x ∈ A such that f(x) = y
D) The domain of f is equal to A

The universal relation on a non-empty set A is always:
A) Not Symmetric
B) Not Transitive
C) An Equivalence Relation
D) None of the above

A relation R on the set of integers Z is defined by (x, y) ∈ R if |x – y| ≤ 1. The relation R is:
A) Reflexive and Symmetric
B) Reflexive and Transitive
C) Symmetric and Transitive
D) An Equivalence Relation

A function f is said to be one-to-one (injective) if:
A) f(x_1) = f(x_2 ) implies x_1 ≠ x_2
B) x_1 = x_2 implies f(x_1) ≠ f(x_2)
C) f(x_1) = f(x_2) implies x_1=x_2
D) x_1≠x_2 implies f(x_1)≠f(x_2)