Maths Unit1&2

KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION
(Deemed to be University)
Anand Nagar, Krishnankoil – 626 126.
OFFICE OF THE CONTROLLER OF EXAMINATIONS
MAT18R207 - Discrete Mathematics
Online Assessment -MCQ - Question Bank Report
Questions in Unit-1
Topic: FUNCTIONS
205382 Domain of R is denoted by
Options - Correct answer: 3
(1) I(A)
(2) R(R)
(3) D(R)
(4) None of these
205606 Let f and g be the function from the set of integers to itself, defined by f(x) = 2x + 1 and g(x) =
3x + 4. Then the composition of f and g is ____________
(1) 6x + 9
(2) 6x + 7
(3) 6x + 6
(4) 6x + 8
https://edu.kalasalingam.ac.in/exam_quiz_report/658 1/133
205618 The inverse of function f(x) = x3 + 2 is ____________.
(1) f -1 (x) = (x – 2) 1/2
(2) f -1 (x) = (x – 2) 1/3
(3) f -1 (x) = (x) 1/3
(4) f -1 (x) = (x– 2)
205626 In a function, if y = f (x) then x is called
(1) Domain element
(2) Image element
(3) Preimage element
(4) None of these
205633 In a function, if y = f (x) then y is called
(1) Domain element
(2) Image element
(3) Preimage element
(4) None of these
205658 In a function f : X → Y where X is the
–––––
of f
(1) Domain
(2) Codomain
(3) Relation
(4) None of these
205664 In a function f : X → Y where Y is called the
(1) Domain
(2) Codomain
(3) Relation
(4) None of these
205669 In a function f : X → Y the set of the images of all elements of X is called the
–––––
of f
(1) Range
(2) Domain
(3) Image
(4) None of these
205676 Every bijective function is Invertible
(1) False
(2) True
(3) neither True nor False
(4) None of these
205680 In a function f : X → Y , the range of f is denoted by
(1) f
(2) D j
(3) R j
(4) None of these
205688 A function f : X → Y is called

–––––––
if distinct elements of X is mapped into distinct elements
of Y
(1) One to one
(2) Onto
(3) into
(4) None of these
205693 In a function, f (x 1) = f (x2 ) whenever x 1 = x2 then f is
(1) One to one
(2) Onto
(3) n
(4) None of these
205711 f is one to one if
(1) f (x 1) = f (x2 ) whenever x1 ≠ x2
(2) f (x 1) ≠ f (x2 ) whenever x1 = x2
(3) f (x 1) = f (x2 ) whenever x1 = x2
(4) None of these
205715 If f (a) = f (d) = 2 but a ≠ d then function f is said to be
(1) One to one
(2) Not One to one
(3) Onto
(4) None of these
205721 If the Range R j = Y then the function f : X → Y is
(1) Bijective
(2) Disjunction
(3) Surjective
(4) None of these
205725 A function f : X → Y is called

–––
if the range R j = Y
(1) Preimage
(2) One to one
(3) Onto
(4) None of these
205733 Onto or surjective is otherwise called as
(1) One to one
(2) Into
(3) Range
(4) None of these
205743 A function f : X → Y is both one to one and onto then f is said to be
(1) Surjective
(2) Disjunction
(3) Bijective
(4) None of these
205747 The function f(x)=x+1 from the set of integers to itself is onto. Is it True or False?
(1) True
(2) False
(3) Neither True nor False
(4) None of these
205756 If f : X → Y is bijective then X and Y have the

–––––
number of elements
(1) Mapping
(2) Same
(3) Different
(4) None of these
205799 A function f from a set X to a set Y is surjective, if for every element y in the codomain Y of f,
there is at least one element x in the domain X of f such that ______________.
(1) f (x) ≠ y
(2) f(x) = y
(3) x=y
(4) None of these
205812 If f : A → B and g : B → C then the composition of f and g is a new function from
(1) A to C
(2) B to B
(3) A to B
(4) None of these
205824 (g ∘ f ) (x)=
(1) f (g(x))
(2) g(f (x))
(3) g(x)
(4) None of these
205831 When f and g are bijective, g ∘ f is
(1) Injective
(2) Surjective
(3) Bijective
(4) None of these
205847 If f : R → R and g : R → R defined as f (x) = x 2

− 2 and g(x) = x + 4 then g ∘ f (x) is
(1) x 2
+ 2
(2) x 2
+ 14
(3) x + 12
(4) None of these
205854 If f : R → R defined as f (x) = x 2

− 2 , then f is
(1) one to one
(2) not one to one
(3) onto
(4) None of these
205869 Check whether the function f (x) = x 2
− 11 from R to R is
(1) one to one
(2) onto
(3) not one to one
(4) None of these
205879 The function f : A → A where f (x) = x, x ∈ A is called the
(1) identity function
(2) inverse function
(3) bijection
(4) None of these
205886 Identity function is denoted by
(1) f
(2) R
(3) I A
(4) None of these
205899 A function f : A → B and g : B → A, if g ∘ f = IA and f ∘ g = IB then the function g is called
the
(1) identity of f
(2) inverse of f
(3) associative of f
(4) None of these
205905 The inverse of a function f, if it exists is
(1) Unique
(2) Different
(3) Equal
(4) None of these
205911 The necessary and sufficient conditions for the function f : A → B to be invertible is that f is
(1) Image and Pre image
(2) Domain and Codomain
(3) One to one and onto
(4) None of these
205933 If f : A → B, g : B → C and h : C → D are functions then h ∘ (g ∘ f ) is function from
(1) A → D
(2) A → C
(3) B → D
(4) None of these
205936 Composition of function is
(1) Commutative
(2) Associative
(3) Range
(4) None of these
205942 If h ∘ (g ∘ f ) : A → D and (h ∘ g) ∘ f : A → D then the domain and codomain of the

h ∘ (g ∘ f ) and (h ∘ g) ∘ f are
(1) same
(2) different
(3) limited
(4) None of these
205946 If g ∘ f : A → C and h : C → D then h ∘ (g ∘ f ) is
(1) A → D
(2) A → C
(3) C → C
(4) None of these
205956 If f : A → B and g : B → C are functions then f ∘ g : A → C is

–––––––
as f and g are
surjective
(1) surjective
(2) disjunction
(3) not mapping
(4) None of these
214113 Every one to one function is onto
(1) True
(2) False
(3) Neither True nor False
(4) None of these
626040 Function is a special case of
(1) Relation
(2) Set
(3) Range
(4) All of the above
626041 For finding inverse of a function or f −1

.'f' should be
(1) 1 to 1
(2) onto
(3) both
(4) none
626042 Is the relation '<' in the set of all real numbers a

(1) function
(2) not a function
(3) 1 -1 function
(4) onto function
626043 Two functions f:A→ B;g:A→B are said to be same f=g if
(1) f(x)=g(x)
(2) f(x)≠g(x)
(3) f(x)> g(x)
(4) f(x)< g(x)
626044 If the function f is defined by f(x)=x 2
+ 1 on the set {-2,-1,0,1,2}.range of f is
(1) {5,2,1}
(2) {-5,2,1}
(3) {5,-2,1}
(4) {5,2,-1}
626045 Let f:A→ B be a function . For f to be an onto function
(1) f(A)=B
(2) f(A)⊂ B
(3) f(A)⊇ B
(4) f(A)≠B
626046 Every relation R from a set A into a set B has an inverse relation from
(1) A→B to
(2) B→Bto
(3) A to B
(4) B to A
626047 {(b,a)/(a,b)ϵ R} is the definition of
(1) R
(2) R −1
(3) both
(4) none
626048 (R
−1)
−1
(1) R
(2) R −1
(3) R0R
(4) none
626049 Let R be a relation from A to B.Then the complement of the relation R is R ={(a,b)ϵAxB/(a,b)∉
c
R} is the
(1) Complement of the relation
(2) union of the relation
(3) intersection
(4) negation
626050 ________=R{(a,b)ϵ AXB/(a,b)ϵR and (a,b)ϵ S is the
(1) R∩ S
(2) R∪ S
(3) R^{C}
(4) R^{-1}
626051 Let A={1,2,3,4}.The relation R on μ = R
1 0 1 0
⎛ ⎞
⎜
0 0 1 0 ⎟
⎜
⎟
⎜1 0 0 0⎟
⎝ ⎠
1 1 0 1
.Then
(1) R={(1,1),(1,3),(2,3),(3,1),(4,1),(4,2),(4,4)}
(2) R={(1,2),(1,3),(2,3),(3,1),(4,1),(4,2),(3,4)
(3) R={(1,1),(1,4),(2,3),(3,1),(4,1),(4,2),(3,4)
(4) R={(1,1),(1,3),(2,3),(3,1),(4,1),(4,2),(4,3)
626052 Given A={1,2,3,4};B={x,y,z}.R={(1,y),(1,z),(3,y),(4,x),(4,z)}.Then the matrix is
(1)
0 1 1
⎛ ⎞
⎜0 0 0⎟
⎝ ⎠
1 0 1
(2)
1 1 1
⎛ ⎞
⎜0 0 0⎟
⎝ ⎠
1 0 1
(3)
1 2 1
⎛ ⎞
⎜0 0 0⎟
⎝ ⎠
1 0 1
(4)
1 2 3
⎛ ⎞
⎜0 0 0⎟
⎝ ⎠
1 0 1
626054 Let R be the relation from A={1,3,5,7,9}; B={2,4,6,8} which is defined as aRb iff a> b
(1) {(3,2),(5,4)}
(2) {(3,4),(5,4)}
(3) {3,3),(5,3)}
(4) {(3,1),(5,1)}
626055 If S={1,2,3};T=[X,Y].List all the elements of SxT
(1) {(1,x),(2,x)}
(2) {(1,x)(2,y)(3,x)}
(3) {(1,x),(2,x),(3,x)}
(4) {(1,x),(2,x),(3,x)(1,y)(2,y)(3,y)}
626056 Sets A and B have respectively m and n elements. How many elements has AxB.
(1) mXn or mn
(2) m+n
(3) m\n
(4) m
626057 How many different relations are there from AxB
(1) 2 mn
(2) 2 m+n
(3) 2 m/n
(4) mn
626058 Relation is a R on A,B is a subset of the
(1) Cartesian product AxB
(2) A+B
(3) A\B
(4) AB
626059 Let A ={1,2,3,4};we define a relation R on A.Then R={(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)}
(1) a=b
(2) a≠ b
(3) a< b
(4) a> b
626060 A relation R on A,B can be represented by
(1) ordered pairs
(2) matrix
(3) graph
(4) all the above
626062 ________=R{(a,b)ϵ AXB/(a,b)ϵR or (a,b)ϵ S is the
(1) R∩ S
(2) R∪ S
(3) R^{C}
(4) R^{-1}
Topic: INCLUSION-EXCLUSION PRINCIPLE

205358 The principle of inclusion and exclusion of two tasks is
(1) ∣A ∩ B∣
(2) ∣A ∪ B ∣=∣ A ∣ + ∣ B ∣ − ∣ A ∩ B∣
(3) ϕ
(4) None of these
206203 The principle of inclusion and exclusion of three tasks is
(1) ∣A ∩ B ∩ C∣
(2) ∣A ∪ B ∪ C ∣=∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ + ∣ A ∩ B ∩ C∣
(3) ∣A ∪ B ∪ C ∣=∣ A ∣ + ∣ B ∣ + ∣ C ∣ − ∣ A ∩ B ∣ − ∣ A ∩ C ∣ − ∣ B ∩ C ∣ − ∣ A ∩ B ∩ C∣
(4) ∣A ∪ B ∪ C ∣=∣ A ∣ + ∣ B ∣ + ∣ C ∣ + ∣ A ∩ B ∣ + ∣ A ∩ C ∣ + ∣ B ∩ C ∣ + ∣ A ∩ B ∩ C∣
214107 The integer function of x is defined by
(1) x
(2) [x]
(3) 0
(4) None of these
214115 The value of ⌊3.991⌋ is
(1) 4
(2) 2
(3) 3
(4) 0
214118 How many positive integers not exceeding 1000 are divisible by 7 or 11?
(1) 220
(2) 320
(3) 420
(4) 520
214126 How many positive integers not exceeding 1000 are not divisible by 7 or 11?
(1) 880
(2) 780
(3) 680
(4) 980
214132 How many positive integers not exceeding 1000 are divisible by 7 and 11?
(1) 12
(2) 14
(3) 16
(4) 20
214136 Determine n such that 1 ≤ n ≤ 100 which are divisible by 5 or 7.
(1) 42
(2) 32
(3) 52
(4) 62
214144 Determine n such that 1 ≤ n ≤ 100 which are not divisible by 5 or 7.
(1) 78
(2) 88
(3) 68
(4) 90
214151 Determine n such that 1 ≤ n ≤ 100 which are divisible by 5 and 7.
(1) 2
(2) 3
(3) 5
(4) 0
214156 How many integers between 1 and 100 that are divisible by 3 but not by 7.
(1) 31
(2) 29
(3) 23
(4) 13
214165 How many positive integers not exceeding 500 are divisible by 7 or 11?
(1) 110
(2) 130
(3) 230
(4) 330
214166 How many positive integers not exceeding 500 are divisible by 7 and 11?
(1) 2
(2) 4
(3) 6
(4) 8
214172 How many positive integers not exceeding 500 are not divisible by 7 or 11?
(1) 390
(2) 490
(3) 190
(4) 290
214179 How many positive integers not exceeding 500 are divisible by 7?
(1) 81
(2) 71
(3) 91
(4) 41
Topic: RELATIONS
205423 (a, b) ∈ R and (b, a) ∈ R ⇒
––––––––
∀a, b ∈ R
(1) a ≠ b
(2) a=b
(3) a=c
(4) None of these
205426 A binary relation R on a set A is said to be
––––––––
relation if R is a reflexive, anti symmetric
and transitive
(1) Partially ordering
(2) Equivalence
(3) Bijective
(4) None of these
205437 A relation R on a set A to itself that is R = A × A is called an
(1) inverse relation
(2) universal relation
(3) identity relation
(4) None of these
205545 A Relation R on a set A is said to be symmetric if (a, b) ∈ R then
(1) (a, a) ∈ R
(2) (b, a) ∈ R
(3) (b, b) ∈ R
(4) None of these
205552 If (a, b) ∈ R and (b, c) ∈ R then (a, c) ∈ R then the relation on R is said to be
(1) Symmetric
(2) Reflexive
(3) Transitive
(4) None of these
205563 A relation R on a set is said to be

––––––––
if it satisfies reflexive,symmetric and transitive.
(1) Equivalence
(2) Complement
(3) Bijection
(4) None of these
205921 If x ∈ A is related to an element y ∈ B under some relation R, then we write
(1) x ∈ B
(2) x R y
(3) y ∈ A
(4) None of these
206032 If A = {1, 2, 3} then relation S = {(1, 1), (2, 2), (3, 3)} is
(1) symmetric
(2) anti – symmetric
(3) reflexive
(4) both symmetric & anti – symmetric
206050 Each element in the co-domain of f has a ____________. in onto function
(1) image
(2) pre-image
(3) symmetric
(4) None of these
206076 Let A = {0, 1, 2, 3, 4}, B = {0, 1, 2, 3}, given relation R = {(1, 3), (2, 2)(3, 1)(4, 0)} Find the
Range?
(1) {1, 2, 3}
(2) {2, 3}
(3) {1, 3}
(4) {0, 1, 2, 3}
206108 Let A = {0, 1, 2, 3, 4}, B = {0, 1, 2, 3}, given relation R = {(1, 3), (2, 2)(3, 1)(4, 0)} Find the
Domain?
(1) {1, 2, 3}
(2) {1, 2, 3, 4}
(3) {2, 3, 4}
(4) {2, 4}
206143 If a + b = 4, the order pair in the relation A from B, A = {0, 1, 2, 3, 4}, B = {0, 1, 2, 3} where
(a, b) ∈ R, what is the relation R?
(1) R = {(1, 3)(2, 2)(3, 1)(4, 0)}
(2) R = {(1, 3)(2, 2)}
(3) R = {(1, 3)(2, 2)(3, 1)}
(4) R = {(3, 1)(4, 0)}
Topic: Set theory

205459 A ∩ A
′
=
(1) ϕ
(2) A
(3) U
(4) None of these
205464 A ∪ A
′
=
(1) ϕ
(2) A
(3) U
(4) None of these
205471 The set consists of finite number of elements is called
(1) infinite set
(2) finite set
(3) empty set
(4) None of these
205480 The set which contains the elements that belongs to A and do not belong to B is the
––––––––
of a
set
(1) Union
(2) Intersection
(3) Difference
(4) None of these
205526 A ∪ (B ∩ C) = (A ∪ B) ∩ (A ∪ C) is known as
(1) Associate law
(2) Communicative law
(3) Distributive law
(4) None of these
205540 The number of elements in the set is called
(1) Cardinality
(2) Commutative
(3) Complement
(4) None of these
205574 ¯¯¯¯¯¯¯¯¯¯¯¯¯¯
A ∪ B = A ∩ B
¯
¯¯¯ ¯
¯¯¯
is known as
(1) Demorgan's law
(2) Associative law
(3) Commutative law
(4) None of these
205578 A ∩ B =
¯¯¯¯¯¯¯¯¯¯¯¯¯¯
(1) A ∩ B
(2) A ∪ B
¯
¯¯¯ ¯
¯¯¯
(3) A ∪ B
(4) None of these
205926 A ∪ U =
(1) A
(2) U
(3) B
(4) None of these
205982 The number of proper subset of the set {1, 2, 3} is
(1) 5
(2) 6
(3) 7
(4) 8
206002 Empty set is a
(1) infinite set
(2) invalid set
(3) finite set
(4) none of these
206019 A set has n elements, then the number of elements in its power set is
(1) 2 n
(2) 2 mn
(3) 2 m+n
(4) 2 m−n
Questions in Unit-2
Topic: EQUIVALENCE OF PROPOSITIONS
179033 ┐(P ∨ Q) ⇔
(1) ┐P ∨ ┐Q
(2) P ∨ Q
(3) ┐P ∧ ┐Q
(4) P ∧ Q
206002 Empty set is a
(1) infinite set
(2) invalid set
(3) finite set
(4) none of these
206019 A set has n elements, then the number of elements in its power set is
(1) 2 n
(2) 2 mn
(3) 2 m+n
(4) 2 m−n
Questions in Unit-2
Topic: EQUIVALENCE OF PROPOSITIONS
179033 ┐(P ∨ Q) ⇔
(1) ┐P ∨ ┐Q
(2) P ∨ Q
(3) ┐P ∧ ┐Q
(4) P ∧ Q
179057 ┐(P ∧ Q) ⇔
(1) ┐P ∧ ┐Q
(2) ┐P ∨ ┐Q
(3) P ∨ Q
(4) P ∧ Q
Topic: IMPLICATION
179173 Symbolize the statement:
If either Ram takes C++ or Kumar takes ORACLE, then Latha will take JAVA.
(1) P ∨ Q ∨ R
(2) (P ∨ Q) → R
(3) P ∧ Q ∧ R
(4) P ⇔ ┐Q
179251 Let P: It is raining, Q: The sun is shining, R: There are clouds in the sky.
Symbolize the statement:
If it is not raining then the sun is not shining and there are clouds in the sky.
(1) ┐P → (┐Q ∧ R)
(2) R → (P ∨ Q)
(3) Q → (P ∧ R)
(4) R → (Q ∨ P )
The sun is shining if and only if it is not raining.
(1) P ↔ ┐Q
(2) ┐P ↔ ┐Q
(3) Q ↔ ┐P
(4) P → ┐Q
179342 Let P: The moon is out. Q: It is not snowing. R: Ram goes out for a walk.
If the moon is out and it is not snowing, then Ram goes out for a walk.
(1) R → (P ∨ Q)
(2) Q → (P ∧ R)
(3) R → (Q ∨ P )
(4) (P ∧ ┐Q) → R
179630 Let P: I finish writing my computer program before lunch. Q: I shall play tennis in the
afternoon. R: The sun is shining. S: The boundary is low.
Low boundary and sunshine are sufficient to play Tennis in this afternoon.
(1) (S ∨ R) → Q
(2) (S ∧ ┐R) → ┐Q
(3) (┐S ∧ ┐R) → ┐Q
(4) (S ∧ R) → Q
Topic: LAWS
177642 The law of logic P ∨ Q ⇔ Q ∨ P is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Absorption
177660 The law of logic P ∧ Q ⇔ Q ∧ P is called
(1) Distributive
(2) Commutative
(3) Idempotent
(4) Absorption
177690 The law of logic P ∨ (Q ∨ R) ⇔ (P ∨ Q) ∨ R is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177735 The law of logic P ∧ (Q ∧ R) ⇔ (P ∧ Q) ∧ R is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177756 The law of logic P ∧ (Q ∨ R) ⇔ (P ∧ Q) ∨ (P ∧ R) is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177823 The law of logic P ∨ (Q ∧ R) ⇔ (P ∨ Q) ∧ (P ∨ R) is called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Associative
177875 The law of logic P ∨ (P ∧ Q) ⇔ P is called
(1) Absorption
(2) Commutative
(3) Distributive
(4) Idempotent
178027 The law of logic P ∧ (P ∨ Q) ⇔ P is called
(1) Absorption
(2) Commutative
(3) Distributive
(4) Idempotent
178367 The laws of logic (P ∧ P ) ⇔ P ; (P ∨ P ) ⇔ P are called
(1) Commutative
(2) Distributive
(3) Idempotent
(4) Absorption
Topic: NEGATION
178512 The product of variables and their negations is called the elementary
(1) product
(2) sum
(3) complete
(4) inverse
178541 The sum of variables and their negations is called the elementary
(1) product
(2) sum
(3) complete
(4) inverse
179075 If P is a proposition, then its negation is denoted by
(1) ┐P
(2) P
(3) T
(4) F
179444 Let P:The moon is out. Q: It is snowing. R : Ram goes out for a walk.
Symbolize the statement
It is not the case that Ram goes out for a walk if and only if it is not snowing or the moon is
out.
(1) P → (┐Q → R)
(2) ┐(R ↔ (┐Q ∨ P ))
(3) (P ∧ ┐Q) → R)
(4) R → (P ∨ Q)
179809 Let p: Ram is a graduate. q: Ram will get a job.

If Ram is not a graduate then he will not get a job.
(1) p → q
(2) ┐p → q
(3) ┐p → ┐q
(4) p → ┐q
Topic: PDNF AND PCNF

178582 Product consisting of all variables are called
(1) minterms
(2) maxterms
(3) minmaxterms
(4) maxminterms
178616 Sum consisting of all variables are called
(1) minterms
(2) maxterms
(3) minmaxterms
(4) maxminterms
178640 A formula which is equivalent to a given formula and which consists of a sum of elementary
products is called the
(1) Conjunctive Normal Form
(2) functionally complete
(3) Disjunctive Normal Form
(4) All the above
178681 A formula which is equivalent to a given formula and which consists of a product of
elementary sums is called the
(3) functionally complete
(4) All the above
178728 The Principle Disjunctive Normal Form of a given formula P is an equivalent given formula
consisting of disjunction of
(1) maxterms only
(2) minmaxterms only
(3) minterms only
(4) maxminterms only
178766 The Principle Conjunctive Normal Form of a given formula P is an equivalent given formula
consisting of conjunction of
(1) minterms only
(2) minmaxterms only
(3) maxminterms only
(4) maxterms only
178800 If a given formula is tautology, then its Principle Disjunctive Normal Form includes all the
possible
(1) maxterms of the variable.
(2) minmaxterms of the variable.
(3) maxminterms of the variable.
(4) minterms of the variable.
178942 P ∧ F ⇔
(1) P
(2) T
(3) F
(4) None of the above
179389 Consider the logical expression (P ∨ Q) ∧ (P ∨ R) ∧ (7Q ∨ P ) . The given logical expression
is
(3) Principal Conjunctive Normal Form
(4) Principal Disjunctive Normal Form
Topic: PROPOSITIONS
177207 A declarative statement is called
(1) proposition
(2) not proposition
(3) Truth values
(4) inverse
177234 A proposition consisting of two or more simple propositions is called
(1) not proposition
(2) compound proposition
(3) not compound proposition
(4) inverse proposition
177264 The disjunction of two propositions P and Q is denoted by
(1) P ∧ Q
(2) P ⊕ Q
(3) P ∨ Q
(4) P ⊖ Q
177303 The conjunction of two propositions P and Q is denoted by
(1) P ∨ Q
(2) P ⊕ Q
(3) P ⊖ Q
(4) P ∧ Q
177329 The conditional statement of P and Q is denoted by
(1) P→Q
(2) P←Q
(3) P ⊕ Q
(4) P ⊖ Q
177353 The biconditional statement of P and Q is denoted by
(1) P→Q
(2) P↔Q
(3) P ⊕ Q
(4) P ⊖ Q
177386 Symbolize the statement: If Ram is a computer science student, then he will study DBMS.
(1) P←Q
(2) P ⊕ Q
(3) P→Q
(4) P ⊖ Q
177413 Symbolize the statement: Raju appointed in Wipro or HCL
(1) P ∧ Q
(2) P ⊕ Q
(3) P ⊖ Q
(4) P ∨ Q
177452 Symbolize the statement: Rani wears a ring and chain.
(1) P ∨ Q
(2) P ∧ Q
(3) P ⊕ Q
(4) P ⊖ Q
177483 Symbolize the statement: You can take the flight if and only if you buy a ticket.
(1) P↔Q
(2) P←Q
(3) P ⊕ Q
(4) P ⊖ Q
177585 If P→ Q is a conditional statement then ┐Q → ~┐P is called
(1) Contradiction
(2) Equivalence
(3) Contrapositive
(4) Inverse
179115 P: The file system is full. Q : The automated reply can be sent.
Symbolize the statement
If the file system is full then the automated reply can not be sent.
(1) P → ┐Q
(2) P ∨ Q
(3) P ∧ Q
(4) P ⇔ ┐Q
If it is raining then there are clouds in the sky.
(1) R → P
(2) Q → P
(3) R → Q
(4) P → R
afternoon. R: The sun is shining. S: The boundary is low.
Symbolize the statement: If the sun is shining then I shall play tennis in the afternoon.
(1) R → Q
(2) R ∨ Q
(3) R ∧ Q
(4) R ⊕ Q
afternoon.
R: The sun is shining. S: The boundary is low.
Finishing the writing of my computer program before lunch is necessary for playing tennis in
this afternoon.
(1) R ∨ Q
(2) Q → P
(3) R ∧ P
(4) R ⊕ P
Topic: TAUTOLOGY AND CONTRADICTION

177516 A statement formula which is always true is called
(1) Contradiction
(2) Equivalence
(3) Tautology
(4) Contrapositive
177554 A statement formula which is always false is called
(1) Tautology
(2) Contradiction
(3) Equivalence
(4) Contrapositive
177609 P and Q are logically equivalent if P⇔Q is a
(1) Contradiction
(2) Implication
(3) Contrapositive
(4) Tautology
178480 Which of the following is tautology?
(1) P → Q
(2) P → 7Q
(3) (P → Q) ⇔ (7Q → 7P )
(4) None of these
Topic: TRUTH TABLE
179676 If p → q is a conditional statement then q → p is called
(1) converse
(2) contrapositive
(3) inverse
(4) equivalence
179706 If p → q is a conditional statement then ┐p → ┐q is called
(1) converse
(2) contrapositive
(3) inverse
(4) equivalence
179762 Let p: Ram is a graduate. q: Ram will get a job.

If Ram is a graduate then he will get a job.
(1) ┐p → q
(2) ┐p → ┐q
(3) p → q
(4) p → ┐q
179839 If p: T and q: F then p ∨ q is
(1) T
(2) F
(3) converse
(4) inverse
179866 If p: T and q: F then p → q is
(1) T
(2) F
(3) converse
(4) inverse
179891 If p: T and q: F then p ↔ q is
(1) T
(2) F
(3) converse
(4) inverse
179918 If p: F and q: F then p ↔ q is
(1) T
(2) F
(3) converse
(4) inverse
179949 If p: T and q: F then p ∧ q is
(1) T
(2) F
(3) converse
(4) inverse
179989 If p: T , q: F and r: F then (p ∧ q) ∧ r is
(1) F
(2) T
(3) converse
(4) inverse
180040 If p: T , q: F and r: T then (p ∧ q) ∧ r is
(1) T
(2) F
(3) converse
(4) inverse
Topic: TRUTH VALUES

178417 (P ∧ ┐P ) ⇔
(1) F
(2) T
(3) ┐P
(4) P
178451 P ∨ ┐P ⇔
(1) F
(2) T
(3) ┐P
(4) P
178829 P ∨ F ⇔
(1) P
(2) T
(3) F
178862 P ∧ T ⇔
(1) T
(2) P
(3) F
178892 P ∨ T ⇔
(1) P
(2) F
(3) T
178969 ┐(┐P ) ⇔
(1) P
(2) T
(3) F
213034 If p: T and q: F then ¬p ∨ q is
(1) T
(2) F
(3) converse
(4) inverse
213046 If p: T , q: F and r: F then (p ∨ q) ∨ r is
(1) T
(2) F
(3) converse
(4) inverse
213058 If p: T , q: F and r: F then (p ∧ q) ↔ r is
(1) T
(2) F
(3) converse
(4) inverse
213072 If p: T , q: F and r: T then (p ∨ q) ↔ r is
(1) F
(2) T
(3) converse
(4) inverse
213095 If p: T , q: F then p → (q → p) is
(1) converse
(2) inverse
(3) F
(4) T
213118 If p: T , q: F then (p ∧ q) → (p ∨ q) is
(1) converse
(2) inverse
(3) T
(4) F
213127 If p: T , q: F then (p ∧ q) → (p → q) is
(1) T
(2) F
(3) converse
(4) inverse
213143 If p: F , q: T then (p ∧ q) → (p → q) is
(1) T
(2) F
(3) converse
(4) inverse
213150 If p: F , q: T then p → (q → p) is
(1) T
(2) F
(3) converse
(4) Inverse
213167 If p: T then ¬(¬p)
(1) F
(2) T
(3) converse
(4) inverse
Questions in Unit-3
Topic: GENERATING FUNCTIONS
49907 The generating function of the sequence 1 n
,n ≥ 0 is ________.
(1) 1−x
1
(2) 1
(3) 2−x
1
(4) 1−x
2

Maths Unit1&amp;2

Uploaded by

Copyright:

Available Formats

You might also like

Maths Unit1&amp;2

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Maths Unit1&amp;2

Uploaded by

Copyright:

Available Formats

KALASALINGAM ACADEMY OF RESEARCH AND EDUCATION

Options - Correct answer: 3

(4) None of these

Options - Correct answer: 1

Options - Correct answer: 2

(1) f -1 (x) = (x – 2) 1/2

(2) f -1 (x) = (x – 2) 1/3

(3) f -1 (x) = (x) 1/3

(4) f -1 (x) = (x– 2)

205626 In a function, if y = f (x) then x is called

Options - Correct answer: 3

(1) Domain element

(2) Image element

(3) Preimage element

(4) None of these

205633 In a function, if y = f (x) then y is called

Options - Correct answer: 2

(1) Domain element

(2) Image element

(3) Preimage element

(4) None of these

Options - Correct answer: 1

(4) None of these

205664 In a function f : X → Y where Y is called the

Options - Correct answer: 2

(4) None of these

Options - Correct answer: 1

(4) None of these

Options - Correct answer: 2

(3) neither True nor False

(4) None of these

205680 In a function f : X → Y , the range of f is denoted by

Options - Correct answer: 3

(4) None of these

205688 A function f : X → Y is called

Options - Correct answer: 1

(1) One to one

(4) None of these

Options - Correct answer: 1

(1) One to one

(4) None of these

205711 f is one to one if

Options - Correct answer: 3

(1) f (x 1) = f (x2 ) whenever x1 ≠ x2

(2) f (x 1) ≠ f (x2 ) whenever x1 = x2

(3) f (x 1) = f (x2 ) whenever x1 = x2

(4) None of these

205715 If f (a) = f (d) = 2 but a ≠ d then function f is said to be

Options - Correct answer: 2

(1) One to one

(2) Not One to one

(4) None of these

Options - Correct answer: 3

(4) None of these

205725 A function f : X → Y is called

Options - Correct answer: 3

(2) One to one

(4) None of these

205733 Onto or surjective is otherwise called as

Maths Unit1&2

Maths Unit1&2

Maths Unit1&2