0% found this document useful (0 votes)
419 views2 pages

Relations and Functions Assignment

This document contains 10 multiple choice questions and 10 subjective questions about relations and functions. The multiple choice questions test properties of relations like equivalence, reflexivity, symmetry, and transitivity. They also contain questions about functions being one-to-one, onto, bijective, and compositions of functions. The subjective questions ask to prove or determine properties of specific relations and functions, find equivalence classes of relations, and determine if functions are one-to-one, onto or bijective.

Uploaded by

Sleepy Cutie
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
0% found this document useful (0 votes)
419 views2 pages

Relations and Functions Assignment

This document contains 10 multiple choice questions and 10 subjective questions about relations and functions. The multiple choice questions test properties of relations like equivalence, reflexivity, symmetry, and transitivity. They also contain questions about functions being one-to-one, onto, bijective, and compositions of functions. The subjective questions ask to prove or determine properties of specific relations and functions, find equivalence classes of relations, and determine if functions are one-to-one, onto or bijective.

Uploaded by

Sleepy Cutie
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Fahaheel Al-Watanieh Indian Private School, Ahmadi, Kuwait

XII Relations and functions Assignment


1. In order that a relation R defined on a non-empty set A is a equivalence relation, it is sufficient if R
(a) is reflexive (b) is symmetric
(c) is transitive (d) possesses all the above three properties. Ans d
2. With reference to a universal set, the inclusion of a subset in another is a relation which is
(a) symmetric only (b) equivalence only (c) reflexive only (d)None of these
Ans : C
3. Let A = {1, 2, 3}. Then number of equivalence relation containing (1, 2) is
(a) 1 (b) 2 (c) 3 (d) 4
Ans: b
4. Let R = {(3, 3), (6, 6), (9, 9), (12, 12), (6,1 2), (3, 9), (3, 6)} be a relation on the set A = {3, 6, 9, 12}.
The relation is
(a) reflexive only (b) reflexive and transitive only
(c) reflexive and symmetric only (d) an equivalence relation
Ans: a
5. Let A = {1, 2, 3}. Then the number of relations containing (1, 2) and (2, 3) which are reflexive and
transitive but not symmetric is
(a) 1 (b) 2 (c) 3 (d) 4
Ans: C
6. Given the relation R = {(1, 2), (2, 3)} in the set A = {1, 2, 3}. Then the minimum number of ordered
pairs which when added to R makes it an equivalence relation is
(a) 5 (b) 6 (c) 7 (d) 8
Ans: C
7. Let R be the real line. Consider the following subsets of the plan R × R.
S = {(x, y): y = x + 1 and 0 < x < 2}
T = {(x, y): x − y is an integer} which one of the following is true?
(a) T is an equivalence relation on R but S is not
(b) Neither S nor T is an equivalence relation on R
(c) Both S and T are equivalence relation on R
(d) S is an equivalence relation on R but T is not.
Ans: A
8. Let f: R → R and g: R → R be two functions such that
fog(x) = sin x 2 and gof = sin2 x, then f(x) and g(x) are
(a)f(x) = x 2 and gof = sin x (b) f(x) = sin x and g(x) = x 2
(c) f(x) = sin2 x and g(x) = √x (d) f(x) = sin x and g(x) = √x
Ans: b
9. If f and g are two functions from R to R defined as 𝑓(𝑥) = |𝑥| + 𝑥 𝑎𝑛𝑑 g(x) =
|x| – x, then fog (x) for x < 0 𝑖𝑠
(A) 4x (B) 2x (C) 0 (D) – 4x
Ans: d
1
10. Let f: R → R be defined by f(x) = x , ∀ x ∈ R then f is
(a) one-one (b) onto (c) bijective (d) f is not defined
Ans: d
11. Which of the following functions from Z to Z are bijections?
(a) 𝑓(𝑥) = 𝑥 3 (b) 𝑓(𝑥) = 𝑥 + 2
(c) 𝑓(𝑥) = 2𝑥 + 1 (d) 𝑓(𝑥) = 𝑥 2 + 1
Ans: b
12. For real x, let f(x) = x 3 + 5x + 1. Then
(a) F is one-one but not onto in R. (b) F is onto R but not one-one in R.
(c)F is one-one and onto in R. (d)F is neither one-one and onto in R.
Ans:C

CASE STUDY
A relation R in a set A is called:
Reflexive, if (a, a) ∈ R, for every a ∈ A.
Symmetric, if (a1 , a2 ) ∈ R, implies that (a2 , a1 ) ∈ R, for all a1 , a2 ∈ A.
Transitive, if (a1 , a2 ) ∈ R and (a2 , a3 ) ∈ R implies that (a1 , a3 ) ∈ R for all a1 , a2 , a3 ∈ A.
Based on the above information, answer the following questions.
1. If R = {(a, b): a and b work at the same place), then R is
(a) Reflexive (b) symmetric (c) transitive (d) an equivalence
relation
2. If R = {(x, y): x is father of y}, then R is
(a) Reflexive but not symmetric (b) symmetric and transitive
(c) Neither reflexive nor symmetric nor transitive (d) symmetric but not reflexive
3. Let R be the relation in the set A of all books in a library of a college given by R =
{(x, y): x and y have same number of pages}. Then, R is
(a) not Reflexive (b)not symmetric (c) not transitive (d) an equivalence
relation
4. If R = {(x, y): x is exactly 7 cm taller than y}, then R is
(a) not symmetric (b) reflexive
(c) symmetric but not transitive (d) an equivalence relation
5. The relation R in the set A = {1, 2, 3} given by R = {(1, 2), (2, 1)} is
(a) Reflexive (b) symmetric (c) transitive (d) reflexive and symmetric
Ans: d, c, d, a, b

Subjective Questions
1. Let A = {1, 2, 3, … . ,9} and R be the relation in A × A defined by
(a, b)R(c, d)if a + d = b + c for a, b, c, d ∈ A prove that R is an equivalence relation. Also
obtain the equivalence class [(2, 5)].
Ans: {(1, 4), (2, 5), (3, 6), (4, 7), (5, 8), (6, 9)}
2. Consider f: R + → [−5, ∞) given by f(x) = 9x 2 + 6x − 5. Show that f is Bijective .
3 Let 𝐴 = {−1,0,1,2}, 𝐵 = {−4, −2,0,2} and 𝑓, 𝑔: 𝐴 → 𝐵 be functions defined by
1
f (x) = 𝑥 2 − 𝑥, 𝑥 ∈ 𝐴 and 𝑔(𝑥) = 2 |𝑥 − 2| − 1, 𝑥 ∈ 𝐴. Find gof (x) and hence show that
𝑓 = 𝑔 = 𝑔𝑜𝑓
x−2
4. Let A = R − {3} and B = R − {1}. Consider the function f: A → B defined by f(x) = (x−3).
Is f one-one and onto? Justify your answer.
5. Show that the function f: R → R given by f(x) = x 3 + x is bijective.
1 1 x
6.Check whether a function f: R → [− 2 , 2] defined by f(x) = (1+𝑥 2 ) is one-one and onto or not.
7. Prove that the function f: N → N, defined by f(x) = x 2 + x + 1 is one − one but not onto.
x
8. Show that the function f: ℝ → {x ∈ R: −1 < x < 1}defined by f(x) = 1+|x| x ∈ R, one −
one and onto function.

9. Determine whether the relation R defined on the set R of all real numbers as
𝑅 = {(a, b): a, b ∈ R and a − b + √3 ∈ S, where S is the set of all irrational numbers}
is refexive, symmetric and transitive.
10.If N denotes the set of all natural numbers and R is the relation on N×N defined by
(a,b) R (c,d) if ad(b+c) = bc(a+d). Show that R is an equivalence relation.

You might also like