MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)

II B.Tech I Semester (MR21-2021-22 Batch)

I Mid Subjective Question Bank
Subject: DISCRETE MATHEMATICS Code:B0507
Branch: CSE, AIML,CSE(CS), CSE(DS), CSE(IOT),IT,CSE(AI&ML)

Module – I
1(a) Explain briefly about different connectives.

(b) Obtain P.C.N.F of the following formula (a) (𝑃 ↔ 𝑄) → 𝑅 (b) (𝑃 → 𝑄) ↔ (𝑄 → ¬ 𝑅)

2(a) Prove the Logical equivalence without using truth table

 p  q    p  q  r     p  q 
(b) Obtain the product of sums canonical form of the formula
(¬𝑆 ∧ ¬𝑃 ∧ 𝑅 ∧ 𝑄) ∨ (𝑆 ∧ 𝑃 ∧ ¬𝑅 ∧ ¬𝑄) ∨ (¬𝑆 ∧ 𝑃 ∧ 𝑅 ∧ ¬𝑄)
∨ (𝑄 ∧ ¬𝑃 ∧ ¬𝑅 ∧ 𝑆) ∨ (𝑃 ∧ ¬𝑆 ∧ ¬𝑅 ∧ 𝑄)
3(a) Obtain P.D.N.F of the following formula ((¬𝑃 → 𝑅) ∧ ( 𝑄 ↔ 𝑃)

(b) Obtain the P.C.N.F of ( P  R)  Q  P 

4(a) Translate the following statements in symbolic logic

(i) Some integers are divisible by 5 (ii) All real numbers are complex numbers

(iii) Every real number is rational or irrational but not both

(b) Show that the following equivalence without constructing the truth table

((𝑃 ∧ 𝑄 ∧ 𝐴) → 𝐶) ∧ (𝐴 → ( 𝑃 𝑉 𝑄 𝑉 𝐶 )) ⇔ (𝐴 ∧ (𝑃 ↔ 𝑄)) → 𝐶

(c) Obtain a Conjunctive normal form of  p  q    p  q 

5(a) Define Tautology, Contradiction and Contingency. Also Give an example

(b) Check Whether the formula (∼ 𝑝 ∧ (∼ 𝑞 ∧∼ 𝑟)) ∨ (𝑞 ∧ 𝑟) ∨ (𝑝 ∧ 𝑟) is a Tautology

(c) Obtain P.C.N.F and P.D.N.F of the following formula

(𝑃 → (𝑄 ∧ 𝑅)) ∧ (¬ 𝑃 → (¬ 𝑄 ∧ ¬ 𝑅))

6(a) Explain about (i) Quantifiers (ii) Predicates (iii) Normal Forms (iv) Logical Equivalence

Give an example.
 (c) Obtain the PDNF of  p  q    p  r    q  r 

7(a) Show that the logical equivalence (𝑃 → 𝐶 ) ∧ (𝑄 → 𝐶 ) ⇔ ( 𝑃 ∨ 𝑄) → 𝐶

(b) Construct the truth table for (( p  q)  (p  (q  r )))  (p  q)  (p  r )

(c) Obtain a D.N.F of ¬(𝑃 ∨ 𝑄) ↔ ( 𝑃 ∧ 𝑄)

8(a) Translate each of the following sentence into a formula

If one is interested in acquiring good knowledge, then it is pleasure to study in a library

If the library is equipped with books and journals and the library atmosphere is good

(b) Write converse, inverse and contrapositive of the Conditional “ If P is a square then P is a

rectangle”

(c) Construct the truth table for the formula¬(𝑃 ∨ (𝑄 ∧ 𝑅)) ↔ ((𝑃 ∨ 𝑄) ∧ (𝑃 ∨ 𝑅))
(d) Show that the logical equivalence 𝐴 → (𝑃 𝑉 𝐶 ) ⇔ (𝐴 ∧ ¬ 𝑃) → 𝐶

9(a) Define (i) Converse (ii) Inverse (iii) Contrapositive . Give an example.

(b) Find PCNF, PDNF for (PɅQ) V(~𝑃Ʌ𝑄) V (QɅR)

10(a) Find PCNF of (P(QɅR)Ʌ(~𝑃(~𝑄Ʌ~𝑅))

(b) Find PDNF of P V (~𝑃−>(QV(~𝑄−>R)))

Module – II

1. (a) Show that the following premises are inconsistent.

If Rushika misses many classes through illness, then she fails high school.
If Rushika fails high school, then she is uneducated.
If Rushika reads a lot of books, then she is not uneducated.
Rushika misses many classes through illness and reads a lot of books.
(b) Let A = {2,4,8,16,32 }on A define the relation R by aRb iff a divides b. Draw the
Hasse diagram for the poset and determine whether the poset is total ordered or not write
the relation matrix for R.
2. (i) Show that from
(a) (∃𝑥) (𝐹 (𝑥 ) ∧ 𝑆(𝑥)) → (∀𝑦) (𝑀(𝑦) → 𝑊(𝑦))
(b) (∃𝑦) (𝑀(𝑦) ∧ ¬ 𝑊(𝑦))

The conclusion (∀𝑥) (𝐹(𝑥 ) → ¬𝑆(𝑥)) follows.

(ii) Let 𝑆 = { 1, 2, 3} and 𝑃(𝑆) be the power set of S. on 𝑃(𝑆) define the relation R by
𝑥𝑅𝑦 iff 𝑥 ≤ 𝑦 show that this relation is a partial order on 𝑃(𝑆) draw its Hasse diagram.
3. (a) Show that
(((¬𝑃 ∨ 𝑄) → 𝑅) ∧ (𝑅 → (𝑆 ∨ 𝑇)) ∧ (¬𝑆 ∧ ¬𝑈) ∧ (¬𝑈 → ¬𝑇) ) ⇒ 𝑃
(b) Demonstrate that R is a valid inference from the premises P→ 𝑄 , Q→ 𝑅 and P.
4. (a) Using indirect method of proof show that if
P → (𝑄 ∧ 𝑅), (𝑄 ∨ 𝑆) → 𝑇 and 𝑃 ∨ 𝑆 then T
(b) Explain about Lattice and write some properties.
5. (a) Using rule CP, derive 𝑃 → 𝑄 from the premises 𝑅 → (𝑆 → 𝑄) and ¬𝑃 ∨ 𝑅 and S.
(b) Using indirect method of proof show that 𝑝 → 𝑞, 𝑞 → 𝑟, ∼ (𝑝 ∧ 𝑟), (𝑝 ∨ 𝑟) leads to
conclusion r.
6. (a) Let A = {2,3,6,12,24, 36} on A define the relation R by aRb iff a divides b.
Draw the Hasse diagram for the poset . Determine whether the poset is total ordered or
not. Write the relation matrix for R.
(b) Demonstrate different properties of a binary relation
7. (a) Discuss about Hasse diagram.
(c) Given A = {1, 2, 3, 4} and a relation R on A defined by

R = {(1, 2)(4,3)(2,2)(2,1)(3,1)} show that R is not transitive. Find a relation 𝑅1 ⊇ 𝑅

such that 𝑅1 is transitive. Can you find the another relation 𝑅2 ⊇ 𝑅 which is also

transitive.

8. (a) If R is relation in the set of integers Z defined by R = {(𝑥, 𝑦)/ 𝑥 ∈ 𝑍, 𝑦 ∈ 𝑍, 𝑥 − 𝑦 is

multiple of 3}. Show that it is an equivalence relation.

(b) Verify the validity of the following argument

“Every living thing is a plant or an animal.

Joe’s gold fish is alive and it is not a plant.
All animals have hearts.
Therefore Joe’s gold fish has a heart.
 MODULE III

1. (a) ) Let f,g,h be functions R to R defined by f(x) = x+2 , g(x) = x-2 and h(x) = 3x. Find
fog, ,fof, gog, foh, hog and hof.
(b) Let f:R+ R be defined by f(x) = logx and g:R+ R defined by g(x) = ex when Ris the set of
all real numbers and R+ is set of all positive real numbers. Show that fog and gof are identity
functions
2. (a) Discuss about one-one function, Bijective function,I nverse function, composition
function and Recursive function with examples
(b) Let f and g be functions from R to R defined by f(x) = ax+b and g(x) = 1-x+x2
If (gof)(x)= 9x2-9x+3, determine a,b.
3. (a)Let f: R→R and g: R→R, where R is the set of real numbers. Find 𝑓𝜊𝑔and g f
where f(x) = x2 and g(x) = x+4. State where these functions are injective, surjective,
bijective?
(b) Consider the functions f and g defined by f(x) = x3 and g(x) = x2 + 1, ∀x∈ 𝑅, find
gof,fog,f2,g2.
 1 2 3 4
4. (a) If f    then find f 1 and show that 𝑓𝑜𝑓 −1 = 𝑓 −1 𝑜𝑓 = 𝐼
 2 4 3 1 
(b) Find the inverse of the function f(x) = ex defined from R R+ .
 MALLA REDDY ENGINEERING COLLEGE (AUTONOMOUS)
II B.Tech I Semester (MR21-2021-22 Batch)
I Mid Objective Question Bank
Subject: DISCRETE MATHEMATICS Code:B0507
Branch: CSE, AIML,CSE(CS), CSE(DS), CSE(IOT),IT,CSE(AI&ML).
S.No Questions Ans
1 The Conditional 𝑝 → 𝑞 is false when
a) Both p and q are false b) Both p and q are true
c) p is true and q is false d) p is false and q is true
2 The Compound proposition PVQ is true when
a) P is false and Q is true b) Both P and Q are true
c) P is true and Q is false d) All the above
3 𝑝 → 𝑞 indicates that
a) If p then q b) p If and only if q c) p and q d) p or q
4 p  q indicates
a) If p then q b) p If and only if q c) P and q d) P or q
5 When the Compound proposition p  q is false
a) Both statements are true b) Both statements are false
c) Either one of the statement is true d) None
6 When the Compound proposition p  q is true
a) Both statements are true b) Both statements are false
c) Either one of the statement is true d) All the above
7 The proposition p  p _______
a) Contingency b) Contradiction c)Tautology d) None
8 p  p
a) Contingency b) Contradiction c)Tautology d) None
9 The Conditional p  q is logically equivalent to _____
a) p  q b) p  q c) p  q d) All the above
10 The Converse of the conditional “ If 4 is an even number then 4 is divisible by
2” is _____
a) “ If 4 is not an even number then 4 is not divisible by 2”
b) “ If 4 is divisible by 2 then 4 is an even number”
c) “ If 4 is not divisible by 2 then 4 is not even number”
d) None

11 The inverse of the conditional “ If 4 is an even number then 4 is divisible by 2”

is _____
a) “ If 4 is not an even number then 4 is not divisible by 2”
b) “ If 4 is divisible by 2 then 4 is even number”
c) “ If 4 is not divisible by 2 then 4 is not even number”
d)None

12 Let D: Today is a week day, S: I am a student, Then the symbolic form of the
Compound proposition ” Today is a week day and I am a student is
a) D  S b) D  S c) D  S d) D  S
13 The Contrapositive of the conditional “ If 4 is an even number then 4 is
divisible by 2” is _____
a) “ If 4 is not an even number then 4 is not divisible by 2”
 b) “ If 4 is divisible by 2 then 4 is even number”
c) “ If 4 is not divisible by 2 then 4 is not even number”
d) None
14 (𝑃 ∧ 𝑄 ) ⇒
a) P b) P  Q c) Q d)  P
15 ¬(¬𝑃) ⇔
a) P b) ¬𝑃 c) Both d) None
16 P   Q  R  is logically equivalent to
a) P   Q  R  b) P   Q  R 
b) c)  P  Q   R d) All the above
17  P  Q 
a) Q  P b) P c) Q d) Q  P
18 P∨F⇔
a) F b) T c) P d) All the above
19 P ∧ ¬𝑃
a) T b) P c) F d) None
20 P ∨ (P ∧ Q)
a) Q b) P c) P ∧ Q d) None
21 ¬ (P ∨ Q) ⇔
a) ¬ (P ∧ Q) b) (¬P ∨ ¬Q) c) (¬P ∧ ¬Q) d) (P ∨ Q)
22 (P → Q) ∧ (Q → R) ⇒
a) P → Q b) Q → R c) P → R d) R → P
23 P→ Q ⇔
a) ¬Q → ¬P b) ¬Q → P c) Q → ¬P d) Q → P
24 p  q 
a) p  q b) p  q c) p  q d) p  q
25 Conjunction of two tautologies is a ………………….
a) Tautology b) Contradiction c) Contingency d) None
26 Disjunction of two tautologies is a
a) Tautology b) Contradiction c) Contra positive d) None
27 P ⟷ Q Equivalent Value
a) (P → Q) ∧ (Q → P) b) (P∧ Q) ∧ (¬Q ∧¬P)
c) (P ∨ Q) ∧ (¬Q ∨ P) d) All the above
28 Let D: Today is a week day, S: I am a student, Then the symbolic form of the
Compound proposition ” If Today is a week day then I am a student” is
D  S b) D  S c) D  S d) D  S
29 For the P,Q statements min terms are
a) P∧ ¬Q b) ¬P ∧ Q c) ¬P ∧ ¬ Q d) All the above
30 For the P, Q statements max terms are
a) ¬P ∨ ¬Q b) ¬P ∨ Q c) PVQ d) All the above
31 ¬(P→Q) is logically equivalent to
a)¬ P ∧ Q b) P ∨ Q c) P ∧ ¬Q d) None
32 (P ⟶Q) is logically equivalent to
a) P ⟶ ¬Q b) ¬P ⟶ Q c) P ⟷ Q d) None
33 P ∧ (Q ∨ R) is logically equivalent to
a)(P ∧ Q) ∨ (P ∧ R) b) P ∨ (Q ∧ R) c) (P ∨ Q) ∧ (P ∨ R) d) None
34 (P ∨ (~ P ∧ Q)) is logically equivalent to
a) ( ~ P ∧ ~ Q) b) ( P ∨ Q) c) ( ~P ∧ ~ Q) d) ( ~ P ∧ Q)
35 (P ∧ Q) → R ⇔
 a) (P ∧ (Q ∧ R)) b) (P → (Q V R))
c) (P ∨ (Q → R)) d) (P → (Q → R))
36  P  Q 
 P  Q  b)  Q  P  c)  Q  P  d) Q  P 
37 The Biconditional P ⟷ Q is true when
a) Both p and q are false b) Both p and q are true
c) p is true and q is false d) a and b

38 P  Q  R  
a)  P  Q   R b)  P  Q   P c) (𝑃 ∧ 𝑄) → 𝑄 d) (𝑃 ∧ 𝑄) → 𝑅
39 P ∨ (P ∧ (P ∨ Q)) is logically equivalent to
a) P b) Q c) P ∨ Q d) P ∧ Q
40 The negation of “Some birds can fly” is
a) All birds can fly b) All birds can not fly
c) Their exist only few birds can fly d) One bird can fly
41 The negation of (∀x)(P(x) ∨ Q(x)) is
a) ∃ (x) P(x) ∨ Q(x) b) (∀ (x) P(x) ∨ Q(x)
c) P(x) ∨ Q(x) d) None
42 The negation of (∃x)(P(x)→Q(x)) is
a) ¬P(x) → Q(x) b) ∀ (x) P(x) → Q(x) c) P(x)→ ¬Q(x) d) None
43 The symbolic form of the statement “ All roses are beautiful “
a) ∃x(R(x) → Q(x)) b) R(x) → Q(x)
c) ∀x(R(x) → Q(x)) d) None
44 The Disjunctive normal form of P∧(P→ 𝑄) is
a) (P∧~P) ∨ (P ∧ Q) b) (P∧~P) ∨ (P ∧ ~Q)
c) (P∧~P) ∨ (~P ∧ Q) d) None
45 P, P  Q 
a)P b)  P c) Q d) Q
46 Q, P  Q 
a) Q b) P  Q c) ¬𝑄 ∨ 𝑃 d)  P
47 𝑃 → 𝑄, 𝑄 → 𝑅 ⇒
a) P  R b) 𝑃 → ¬𝑅 c) 𝑃 → ¬𝑄 d) P  Q
48 If P(x): x is a prime number, then which of the following is true
a) P(1) b) P(5) c) P(8) d) P(9)
49 (P ∨ Q) ∧ ¬P = > Q
a) Modus ponens b) Modus tollens
c) Hypothetical syllogism d) disjunctive syllogism
50 P , P  Q 
a) Q b) P c) Q d)  P
51 Which of the following is not a well formed formula?
a) 𝑃 → 𝑄 ∧ 𝑅 b)  P  Q   R c) 𝑃 → (𝑄 ∧ 𝑅) d) 𝑃 → (𝑄 ∨ 𝑅)
52 Let A be the finite having m elements and B be the finite set having n
elements then number of elements in cartesian product of A and B is____
a)mn b)m+n c)m-n d)None

53 What is the Cartesian product of A = {1, 2} and B = {a, b}?

a) {(1, a), (1, b), (2, a), (b, b)} b) {(1, 1), (2, 2), (a, a), (b, b)}
c) {(1, a), (2, a), (1, b), (2, b)} d) {(1, 1), (a, a), (2, a), (1, b)}
54
55 Let R be a relation defined on A={1,2,3,4}. The relation R={ (1,2), (1,3),
(3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)}Then which of the following is
true?
a) Reflexive b) Transitive c) Symmetric d) None
56 Let R be the Relation defined on X. The Relation R is said to be Reflexive if
a) for every x Є X, x R x b) for every x Є X, y R x
c) for every x Є X, x R y d) None
57 Let A and B be finite sets with |𝐴| = m and |𝐵| = n then the number of B
relations from A to B is ______
a) 2mn b) 2m c) 2n d)None
58 Let A be finite set with |𝐴| = m then the number of binary relations on A is D
______
2
a) 2m b) m2 c) 2𝑚 d) None
59 Let A and B be finite sets with |𝐴| = 2 and |𝐵| = 2 then the number of D
relations from A to B is ______

a)12 b) 16 c) 64 d)None
60 Let A be the finite set with |𝐴| = 2 then the number of binary relations on A A
is ______
a) 16 b) 32 c)64 d) None
61 If a finite set A has 2 elements, then number of reflexive relations on A is B

a)4 b) 8 c)3 d) 6
62 If a finite set A has 2 elements, then number of symmetric relations on A is D

a)4 b) 8 c)3 d) 6
63 If a finite set A has 2 elements, then number of antisymmetric relations on A D
is ________
a)4 b) 8 c)12 d) 6
64 Let A and B be finite sets with |𝐴| = m and |𝐵| = n then the number of C
possible functions from A to B is ______
a) nm b) mn c) m2 d) n2
65 Let A and B be finite sets with |𝐴| = 4 and |𝐵| = 6 then the number of A
possible One-One functions from A to B is ______
a)360 b)300 c)256 d) None
66 Let A and B be finite sets with |𝐴| = m and |𝐵| = n then the number of C
possible functions from B to A is ______
a) nm b) mn c) m2 d) n2
67 If a finite set A has 2 elements, then number of Compatibility relations on A is D
______
a)4 b) 8 c)3 d) 2
68 If a finite set A has 2 elements, then number of irreflexive relations on A is A
a)8 b) 4 c)3 d) 6
69 Which of the following is Example for reflexive property
a) The relation equality of set is also reflexive
b) The relation is parallel in the set lines in a plane.
c) Both (a) and (b)
d) None
70 Let R be the Relation defined on X. The Relation R is said to be Symmetric if
a) for every x or y in X, whenever x R X, then y R Y
b) for every x, y in X, whenever x R Y, then y R X
c) for every x and y in X, whenever x R y, then y R x
d) None
71 Which of the following is Example for Symmetric
a) The relation equality of set is symmetric
b) The relation of similarity in the set of triangles in a plane is symmetric
c) The relation division on the set of integers is symmetric
d) Both (a) and (b)
72 Let R be the Relation defined on X. The Relation R is said to be Transitive if
a) for every x, y, and z are in X, whenever x R y and y R z , then x R z
b) for every x, y, and z are in X, whenever x R y and z R x , then y R z
c) for every x, y, and z are in X, whenever x R y and x R z , then x R z
d) None
73 Let A and be finite set with |𝐴| = 3 then the number of binary relations on A A
is ______

a)512 b) 256 c) 64 d)None

74 Let A and B be finite sets with |𝐴| = 3 and |𝐵| = 4 then the number of A
relations from A to B is ______
a)512 b) 256 c) 64 d)None
75 Let R be the relation defined on X. The Relation R is said to be equivalence
relation if
a) R is Reflexive b) R is Transitive c) R is Symmetric
d)All the above
76 Partial order relation
a) irreflexive, anti-symmetric, and transitive
b) reflexive, symmetric, and transitive.
c) reflexive, anti-symmetric, and transitive.
d)None
77 What is the Cardinality of the Power set of the set {2, 1}. D
a)8 b)5 c)7 d)4
78 What is the Cardinality of the Power set of the set {1,2,3,4,5}. A
a)32 b)5 c)64 d)6
79 If A= {1,2,3,4} and R={(1,1),(2,2), (3,3),(4,4), (1,2),(2,1)} then R is A
a)Reflexive and symmetric b) Reflexive but not symmetric
c)symmetric but not transitive d) Ir reflexive and symmetric
80 A relation R is compatible if it is A
a) Reflexive and symmetric b) Reflexive but not symmetric
c) symmetric but not transitive d) Ir reflexive and symmetric
81 The members of the set S = {x | x is the square of an integer and x < 100} is B
a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12}
b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}
c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99}
d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}
82 What is the Cardinality of the Power set of the set {0, 1, 2}. A
a)8 b)5 c)7 d)6
83 Power set of empty set has exactly _____ subset.
a)One b)Two c)Zero d)Three
84 The relation { (1,2), (1,3), (3,1), (1,1), (3,3), (3,2), (1,4), (4,2), (3,4)} is C
a) Reflexive b)Transitive c)Symmetric d)Asymmetric
85 A partial ordered relation is transitive, reflexive and A
a)Antisymmetric b)Bisymmetric c)Anti Reflexive d)Asymmetric
86 The set O of odd positive integers less than 10 can be expressed by ________ B
a) {1, 2, 3} b) {1, 3, 5, 7, 9} c) {1, 2, 5, 9} d) {1, 5, 7, 9, 11}
87 Let S = {1,3,5,7,9,11,13,15,17,19,21}. What is the smallest integer N >0 such D
that for any set of N integers, chosen from S, there must be two distinct
integers that divide each other?
 a)10 b)7 c)9 d)8
88 Consider the divides relation, m|n, on the set A={2,3,4,5,6,7,8,9,10}. The D
cardinality of the covering relation for this partial order relation (i.e., the
number of edges in the Hasse Diagram) is
a)4 b)6 c)5 d)7
89 Let A be a finite set with n elements. Then the number of elements in power A
set of A is _____
a) 2n b) 2n-1 c) 2n+1 d)None
90 Let A and B be finite sets with |𝐴| = 7 and |𝐵| = 4 then the number of onto A
functions from A to B is ______
a) 8400 b)8300 c)8200 d)None

91 Let A and B be finite sets with |𝐴| = m and |𝐵| = n then the number of A
elements in AXB is ______
a)mn b)m2 c)n2 d)None

92 Let A be finite set with |𝐴| = 3 then the number of binary relations on A is A
______
a) 512 b) 32 c)64 d) None
93 Let A={1,2,3}, R be the relation defined on A. R={(1,1),(1,2)}then which of B
the following is true
a) R is reflexive b)R is not reflexive c)R is irreflexive d)None
94 Let A={1,2,3,4}, R be the relation defined on A.
R={(2,1),(1,2),(1,3),(3,1)(1,4),(4,1),(1,1)} then which of the following is true
a) R is reflexive b)R is not reflexive c)R is irreflexive d)None
95 Let A={1,2,3,4}, R be the relation defined on A.
R={(2,1),(1,2),(1,3),(3,1),(1,4)} then which of the following is true
a) R Symmetric b) R is not Symmetric c) R is asymmetric d) None
96 Let A = {1,2,3}, R be the relation defined on A.
R={(1,1),(2,2),(3,3),(1,3),(3,1)}then which of the following is true
a) R is reflexive and symmetric b) R is reflexive but not symmetric
c) R is symmetric but not reflexive d)None

97 Let A={1,2,3}, R be the relation defined on A. R={(1,1),(2,2),(3,3),(1,3)}then

which of the following is true
a) R is reflexive and symmetric b) R is reflexive but not symmetric
c) R is symmetric but not reflexive d) None

98 Let A = {1,2,3,4}, R be the relation defined on A.

R={(2,1),(1,2),(1,3),(3,1)(1,4),(4,1)} then which of the following is true
a) R Symmetric b)R is antisymmetric c)R is asymmetric d)None
99 Let A={1,2,3}, R be the relation defined on A. R={(1,1),(2,2),(3,3)}then
which of the following is true
a) R is reflexive b) R is not reflexive c) R is irreflexive d)None
100 Let A be a finite set with 3 elements . Then the number of elements in power A
set of A is _____
a)8 b)12 c)16 d)None
101 If f: RR is a function defined by f(x) = x2 Then f is _____ D

a) f is one-one b) f is onto c) f is one -one and onto d) f is not one-one

102 If f: RR is a function defined by f(x) = ex Then inverse of the function f is A

_____
a) logx b) ex c) x+1 d)None
103 If f: RR is a function defined by f(x) = ex Then which of the following is B
true
a) f is not one-one and onto b) f is both one-one and onto.
c) f is not one-one but onto d) f is not one-one but onto
104 If f: RR is a function defined by f(x) = x3 Then f is _____ C
a) f is one-one b) f is onto c) f is one -one and onto d) None

105 If 𝑓: 𝐴 → 𝐴 and 𝑔: 𝐴 → 𝐴, where A= {1, 2, 3}, are given by C

f = {(1, 2), (2, 3), (3, 1)} and g = {(1, 3), (2, 2), (3, 1)} Then 𝑓𝜊𝑔 =
a) {(1, 2), (2, 1), (3, 3)}, b) {(1, 1), (2, 2), (3, 3)}
c) {(1, 1), (2, 3), (3, 2)} d) {(1, 3), (2, 1), (3, 2)}
106 If 𝑓: 𝐴 → 𝐴and 𝑔: 𝐴 → 𝐴, where A= {1, 2, 3}, are given by D
f = {(1, 2), (2, 3), (3, 1)} and g = {(1, 3), (2, 2), (3, 1)} Then gof =
a) {(1, 1), (2, 3), (3, 2)} b) {(1, 1), (2, 2), (3, 3)}
c) {(1, 3), (2, 1), (3, 2)} d) {(1, 2), (2, 1), (3, 3)},

107 If 𝑓: 𝐴 → 𝐴and 𝑔: 𝐴 → 𝐴, where A= {1, 2, 3}, are given by A

f = {(1, 2), (2, 3), (3, 1)} and g = {(1, 3), (2, 2), (3, 1)} Then 𝑓𝜊𝑓 =
a) {(1, 3), (2, 1), (3, 2)} b) {(1, 1), (2, 2), (3, 3)}
c) {(1, 1), (2, 3), (3, 2)} d) {(1, 2), (2, 1), (3, 3)},
108 If f : A  A and g : A  A , where A= {1, 2, 3}, are given by A
f = {(1, 2), (2, 3), (3, 1)} and g = {(1, 3), (2, 2), (3, 1)} Then 𝑔𝜊𝑔 =
a) {(1, 1), (2, 2), (3, 3)} b) {(1, 3), (2, 1), (3, 2)}
c) {(1, 1), (2, 3), (3, 2)} d) (1, 2), (2, 1), (3, 3)},
109 If f: Z Z, f(x)=2x+1 then f is ______ B
a) A function but not one – one b) One – one and onto function
c) One – one but not onto function d) Onto but not onto
110 A function is said to be ______________, if and only if f(a) = f(b) implies that B
a = b for all a and b in the domain of f.
a) One-to-many b) One-to-one c) Many-to-many d) Many-to-one
If f  x   x  2 , then f 1 ( x) =
111 A

a) x  2 b) x c) x  2 d)All the above

−1
112 If f and g are two functions then (𝑔𝜊𝑓) = A
a) 𝑓 −1 𝜊𝑔−1 b) 𝑓 −1 𝜊𝑓 −1 c) 𝑔−1 𝜊𝑓 −1 d)none
3
113 The inverse of function 𝑓(𝑥 ) = 𝑥 + 2 is __________. B
1 1
a)𝑓 −1 (𝑦) = (𝑦 − 2) 2 b) 𝑓 −1 (𝑦) = (𝑦 − 2) 3
1
c) 𝑓 −1 (𝑦) = (𝑦) 3 d)𝑓 −1 (𝑦) = (𝑦 − 2)
114 If A={1,2,3} B={-1,0} Then R={( 1,-1),(1,0),( 2,-1),( 3,0)}is a______ C
a) Function b) One -One function c) Relation d) None
115 If f: Z Z The function 𝑓 (𝑥 ) = 𝑥 + 1 Then f is _____ B
a) A function but not one – one b) One – one and onto function
c) One – one function but not onto d) Onto but not onto

116 Let f and g be the function from the set of integers to itself, defined by A
f(x) = 2x + 1 and g(x) = 3x + 4. Then fog(x) = ________.
a)6x+9 b)6x+7 c) 6x+6 d)6x+8
117 If f : A  A and g : A  A , where A= {1, 2, 3}, are given by C
f = {(1, 2), (2, 3), (3, 1)} and g = {(1, 3), (2, 2), (3, 1)}, 𝑔𝜊𝑓 =____
a) {(1, 1), (2, 2), (3, 3)} b) {(1, 3), (3, 1), (1, 2)}
c) {(1, 2), (2, 1), (3, 3)} d)None
 118 f  x   x  2 , g  x   x  2 and h  x   3x , h  g f  x  = A
a) 3x b) 3x 2 c) x  2 d) x  2
119 f  x   x  2 , g  x   x  2 then f  g  x  = A
a) x b)x+2 c)x-2 d)None
120 If f: R R𝑓 (𝑥 ) = 3𝑥 + 2 then 𝑓 −1 (𝑥 )=_____________ C
 x  2
a) x  2 b) x  3 c) d)None
3 2 3
121 Which of the following is Identity function B
a) S={(1,2),(2,1),(2,2)} b) S={(1,1),(2,2),(3,3)}
c) S={(1,3),(2,2),(3,1)} d) S={(1,2),(2,3),(3,1)}
122 If A={1,2,3} B={a,b,c} and S:AB be the function is given by D
S={(1,c),(2,c),(3,c)}Then
a) S is One -One function b) S is Onto function
c) S is Bijective function d) None
123 If A = {1,2,3,4} B={a, b, c, d} and S:AB be the function, Then A
Which of the following is true
a) S={(1,a),(2,b),(3,c),(4,d)} is onto b) S={(1,a),(2,b),(3,c),(3,d)} is onto
c) S={(1,a),(2,b),(3,a)} is onto d) None
124 Let 𝑓(𝑥 ) = 3𝑥 − 4 be the function then 𝑓 −1 (𝑥 )= C
a) x  4 b) x  3 c) x  4 d) None
3 4 3
125 If f:RR, g:RR are defined by f(x) = x4 – x, g(x) = 3x+7 then which of the A
following is true.
a) f is not one-one, g is one-one b) f is one-one, g is one-one
c) f is not one-one, g is is not one-one d) f is one-one, g is not one-one

Prepared By Name:
Signature: HOD Signature