Ma8351 Discrete Mathematics MCQ 4

MA8351 DISCRETE MATHEMATICS www.studymaterialz.
in
CSE - Regulations 2017
Answer: a
Explanation: Hypothesis is false, thus the
MA8351 DISCRETE whole statement is true.
MATHEMATICS 4. What is the value of x after this statement,

assuming the initial value of x is 5?
‘If x equals to one then x=x+2 else x=0’.
CSE - SEMESTER 5 a) 1
b) 3
c) 0
d) 2
Answer: c
UNIT I LOGIC AND Explanation: If condition is false so value
decided according to else condition.
PROOFS
5. Let P: I am in Bangalore.; Q: I love
TOPIC 1.1 PROPOSITIONAL cricket.; then q -> p(q implies p) is?
a) If I love cricket then I am in Bangalore
LOGIC b) If I am in Bangalore then I love cricket
c) I am not in Bangalore
1. Which of the following statement is a d) I love cricket
proposition?
a) Get me a glass of milkshake Answer: a
b) God bless you! Explanation: Q is hypothesis and P is
c) What is the time now? conclusion. So the compound statement will
d) The only odd prime number is 2 be if hypothesis then conclusion.
Answer: d 6. Let P: If Sahil bowls, Saurabh hits a

Explanation: Only this statement has got the century.; Q: If Raju bowls, Sahil gets out on
truth value which is false. first ball. Now if P is true and Q is false then
which of the following can be true?
2. The truth value of ‘4+3=7 or 5 is not a) Raju bowled and Sahil got out on first ball
prime’. b) Raju did not bowled
a) False c) Sahil bowled and Saurabh hits a century
b) True d) Sahil bowled and Saurabh got out
Answer: b Answer: c
Explanation: Compound statement with ‘or’ Explanation: Either hypothesis should be
is true when either of the statement is true. false or both (hypothesis and conclusion)
Here the first part of the statement is true, should be true.
hence the whole is true.
7. The truth value ‘9 is prime then 3 is even’.
3. Which of the following option is true? a) False
a) If the Sun is a planet, elephants will fly b) True
b) 3 +2 = 8 if 5-2 = 7
c) 1 > 3 and 3 is a positive integer Answer: b
d) -2 > 3 or 3 is a negative integer Explanation: The first part of the statement is
Downloaded from: https://cse-r17.blogspot.com 1

MA8351 DISCRETE MATHEMATICS www.studymaterialz.in
false, hence whole is true. 1. The compound propositions p and q are

called logically equivalent if ________ is a
8. Let P: I am in Delhi.; Q: Delhi is clean.; tautology.
then q ^ p(q and p) is? a) p ↔ q
a) Delhi is clean and I am in Delhi b) p → q
b) Delhi is not clean or I am in Delhi c) ¬ (p ∨ q)
c) I am in Delhi and Delhi is not clean d) ¬p ∨ ¬q
d) Delhi is clean but I am in Mumbai
Answer: a
Answer: a Explanation: Definition of logical
Explanation: Connector should be ‘and’, that equivalence.
is q and p.
2. p → q is logically equivalent to ________
9. Let P: This is a great website, Q: You a) ¬p ∨ ¬q
should not come back here. Then ‘This is a
b) p ∨ ¬q
great website and you should come back
c) ¬p ∨ q
here.’ is best represented by?
a) ~P V ~Q d) ¬p ∧ q
b) P ∧ ~Q
Answer: c
c) P V Q
Explanation: (p → q) ↔ (¬p ∨ q) is
d) P ∧ Q
tautology.
Answer: b
3. p ∨ q is logically equivalent to ________
Explanation: The second part of the
statement is negated, hence negation operator a) ¬q → ¬p
is used. b) q → p
c) ¬p → ¬q
10. Let P: We should be honest., Q: We d) ¬p → q
should be dedicated., R: We should be
overconfident. Then ‘We should be honest or Answer: d
dedicated but not overconfident.’ is best Explanation: (p ∨ q) ↔ (¬p → q) is
represented by? tautology.
a) ~P V ~Q V R
b) P ∧ ~Q ∧ R 4. ¬ (p ↔ q) is logically equivalent to
c) P V Q ∧ R ________
a) q↔p
d) P V Q ∧ ~R b) p↔¬q
c) ¬p↔¬q
Answer: d d) ¬q↔¬p
Explanation: The third part of the statement
is negated, hence negation operator is used, Answer: b
for (‘or’ –V) is used and for(’but’- ∧). Explanation: ¬(p↔q)↔(p↔¬q) is tautology.
TOPIC 1.2 PROPOSITIONAL 5. p ∧ q is logically equivalent to ________

a) ¬ (p → ¬q)
EQUIVALENCES b) (p → ¬q)
c) (¬p → ¬q)
d) (¬p → q)

Answer: a 10. ¬ (p ↔ q) is logically equivalent to

Explanation: (p ∧ q) ↔ (¬(p → ¬q)) is ________
tautology. a) p ↔ ¬q
b) ¬p ↔ q
6. Which of the following statement is c) ¬p ↔ ¬q
correct? d) ¬q ↔ ¬p
a) p ∨ q ≡ q ∨ p
b) ¬(p ∧ q) ≡ ¬p ∨ ¬q Answer: a
c) (p ∨ q) ∨ r ≡ p ∨ (q ∨ r) Explanation: (¬ (p ↔ q)) ↔ (p ↔ ¬q) is
tautology.
d) All of mentioned
Answer: d TOPIC 1.3 PREDICATES AND

Explanation: Verify using truth table, all are QUANTIFIERS
correct.
7. p ↔ q is logically equivalent to ________ 1. Let P (x) denote the statement “x >7.”

a) (p → q) → (q → p) Which of these have truth value true?
b) (p → q) ∨ (q → p) a) P (0)
c) (p → q) ∧ (q → p) b) P (4)
d) (p ∧ q) → (q ∧ p) c) P (6)
d) P (9)
Answer: c
Answer: d
Explanation: (p ↔ q) ↔ ((p → q) ∧ (q → p))
Explanation: Put x=9, 9>7 which is true.
is tautology.
2. Let Q(x) be the statement “x < 5.” What is
8. (p → q) ∧ (p → r) is logically equivalent to the truth value of the quantification ∀xQ(x),
________ having domains as real numbers.
a) p → (q ∧ r) a) True
b) p → (q ∨ r) b) False
c) p ∧ (q ∨ r)
d) p ∨ (q ∧ r) Answer: b
Explanation: Q(x) is not true for every real
Answer: a number x, because, for instance, Q(6) is false.
Explanation: ((p → q) ∧ (p → r)) ↔ (p → (q That is, x = 6 is a counterexample for the
∧ r)) is tautology. statement ∀xQ(x). This is false.
9. (p → r) ∨ (q → r) is logically equivalent to 3. Determine the truth value of ∀n(n + 1 > n)

________ if the domain consists of all real numbers.
a) (p ∧ q) ∨ r a) True
b) (p ∨ q) → r b) False
c) (p ∧ q) → r
Answer: a
d) (p → q) → r Explanation: There are no elements in the
domain for which the statement is false.
Answer: c
Explanation: ((p → r) ∨ (q → r)) ↔ ((p ∧ q) 4. Let P(x) denote the statement “x = x + 7.”
→ r) is tautology. What is the truth value of the quantification

∃xP(x), where the domain consists of all real 8. ”Everyone wants to learn cosmology.” This
numbers? argument may be true for which domains?
a) True a) All students in your cosmology class
b) False b) All the cosmology learning students in the
world
Answer: b c) Both of the mentioned
Explanation: Because P(x) is false for every d) None of the mentioned
real number x, the existential quantification
of Q(x), which is ∃xP(x), is false. Answer: c
Explanation: Domain may be limited to your
5. Let R (x) denote the statement “x > 2.” class or may be whole world both are good as
What is the truth value of the quantification it satisfies universal quantifier.
∃xR(x), having domain as real numbers?
a) True 9. Let domain of m includes all students, P
b) False (m) be the statement “m spends more than 2
hours in playing polo”. Express ∀m ¬P (m)
Answer: a quantification in English.
Explanation: Because “x > 2” is sometimes a) A student is there who spends more than 2
true—for instance, when x = 3–the existential hours in playing polo
quantification of R(x), which is ∃xR(x), is b) There is a student who does not spend
true. more than 2 hours in playing polo
c) All students spends more than 2 hours in
6. The statement,” Every comedian is funny” playing polo
where C(x) is “x is a comedian” and F (x) is d) No student spends more than 2 hours in
“x is funny” and the domain consists of all playing polo
people.
a) ∃x(C(x) ∧ F (x)) Answer: d
b) ∀x(C(x) ∧ F (x)) Explanation: There is no student who spends
more than 2 hours in playing polo.
c) ∃x(C(x) → F (x))
d) ∀x(C(x) → F (x)) 10. Determine the truth value of statement ∃n
(4n = 3n) if the domain consists of all
Answer: d
integers.
Explanation: For every person x, if comedian
a) True
then x is funny. b) False
7. The statement, “At least one of your Answer: a
friends is perfect”. Let P (x) be “x is perfect” Explanation: For n=0, 4n=3n hence, it is
and let F (x) be “x is your friend” and let the true.
domain be all people.
a) ∀x (F (x) → P (x))
b) ∀x (F (x) ∧ P (x)) TOPIC 1.4 NESTED
c) ∃x (F (x) ∧ P (x)) QUANTIFIERS
d) ∃x (F (x) → P (x))
1. Let Q(x, y) denote “M + A = 0.” What is
Answer: c the truth value of the quantifications ∃A∀M
Explanation: For some x, x is friend and Q(M, A).
funny.

a) True 5. Let L(x, y) be the statement “x loves y,”

b) False where the domain for both x and y consists of
all people in the world. Use quantifiers to
Answer: b express, “Joy is loved by everyone.”
Explanation: For each A there exist only one a) ∀x L(x, Joy)
M, because there is no real number A such b) ∀y L(Joy,y)
that M + A = 0 for all real numbers M. c) ∃y∀x L(x, y)
d) ∃x ¬L(Joy, x)
2. Translate ∀x∃y(x < y) in English,
considering domain as a real number for both
Answer: a
the variable.
Explanation: Joy is loved by all the people in
a) For all real number x there exists a real
the world.
number y such that x is less than y
b) For every real number y there exists a real 6. Let T (x, y) mean that student x likes dish
number x such that x is less than y y, where the domain for x consists of all
c) For some real number x there exists a real students at your school and the domain for y
number y such that x is less than y consists of all dishes. Express ¬T (Amit,
d) For each and every real number x and y South Indian) by a simple English sentence.
such that x is less than y a) All students does not like South Indian
dishes.
Answer: a
b) Amit does not like South Indian people.
Explanation: Statement is x is less than y.
c) Amit does not like South Indian dishes.
Quantifier used are for each x, there exists a
d) Amit does not like some dishes.
y.
Answer: d
3. “The product of two negative real numbers
Explanation: Negation of the statement Amit
is not negative.” Is given by?
like South Indian dishes.
a) ∃x ∀y ((x < 0) ∧ (y < 0) → (xy > 0))
b) ∃x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0)) 7. Express, “The difference of a real number
c) ∀x ∃y ((x < 0) ∧ (y < 0) ∧ (xy > 0)) and itself is zero” using required operators.
d) ∀x ∀y ((x < 0) ∧ (y < 0) → (xy > 0)) a) ∀x(x − x! = 0)
b) ∀x(x − x = 0)
Answer: d c) ∀x∀y(x − y = 0)
Explanation: For every negative real number d) ∃x(x − x = 0)
x and y, the product of these integer is
positive. Answer: b
Explanation: For every real number x,
4. Let Q(x, y) be the statement “x + y = x − difference with itself is always zero.
y.” If the domain for both variables consists
of all integers, what is the truth value of 8. Use quantifiers and predicates with more
∃xQ(x, 4). than one variable to express, “There is a pupil
a) True in this lecture who has taken at least one
b) False course in Discrete Maths.”
a) ∃x∃yP (x, y), where P (x, y) is “x has taken
Answer: b y,” the domain for x consists of all pupil in
Explanation: There exist no integer for this class, and the domain for y consists of all
which x+4=x-4. Discrete Maths lectures

b) ∃x∃yP (x, y), where P (x, y) is “x has taken 1. Which rule of inference is used in each of
y,” the domain for x consists of all Discrete these arguments, “If it is Wednesday, then the
Maths lectures, and the domain for y consists Smartmart will be crowded. It is Wednesday.
of all pupil in this class Thus, the Smartmart is crowded.”
c) ∀x∀yP(x, y), where P (x, y) is “x has taken a) Modus tollens
y,” the domain for x consists of all pupil in b) Modus ponens
this class, and the domain for y consists of all c) Disjunctive syllogism
Discrete Maths lectures d) Simplification
d) ∃x∀yP(x, y), where P (x, y) is “x has taken
Answer: b
y,” the domain for x consists of all pupil in
Explanation: (M ∧ (M → N)) → N is Modus
this class, and the domain for y consists of all
Discrete Maths lectures ponens.
Answer: a 2. Which rule of inference is used in each of

Explanation: For some x pupil, there exists a these arguments, “If it hailstoday, the local
course in Discrete Maths such that x has office will be closed. The local office is not
taken y. closed today. Thus, it did not hailed today.”
a) Modus tollens
9. Determine the truth value of ∃n∃m(n + m = b) Conjunction
5 ∧ n − m = 2) if the domain for all variables c) Hypothetical syllogism
d) Simplification
consists of all integers.
a) True
Answer: a
b) False
Explanation: (¬N ∧ (M → N)) → ¬M is
Answer: b Modus tollens.
Explanation: The equation does not satisfy
3. Which rule of inference is used, ”Bhavika
any value of m and n in the domain consist of
will work in an enterprise this summer.
integers.
Therefore, this summer Bhavika will work in
10. Find a counterexample of ∀x∀y(xy > y), an enterprise or he will go to beach.”
a) Simplification
where the domain for all variables consists of
b) Conjunction
all integers.
a) x = -1, y = 17 c) Addition
d) Disjunctive syllogism
b) x = -2 y = 8
c) Both x = -1, y = 17 and x = -2 y = 8 Answer: c
d) Does not have any counter example
Explanation: p → (p ∨ q) argument is
Answer: c ‘Addition’.
Explanation: Putting x=-1, y=17; -17>17
which is wrong. Putting x=-2, y=8; -16>8 4. What rule of inference is used here?
“It is cloudy and drizzling now. Therefore, it
which is wrong.
is cloudy now.”
a) Addition
TOPIC 1.5 RULES OF b) Simplification
INFERENCE c) Resolution
d) Conjunction

Answer: b 8. The premises (p ∧ q) ∨ r and r → s imply

Explanation: (p ∧ q) → p argument is which of the conclusion?
Simplification. a) p ∨ r
b) p ∨ s
5. What rule of inference is used in this c) p ∨ q
argument? d) q ∨ r
“If I go for a balanced diet, then I will be fit.
If I will be fit, then I will remain healthy.
Answer: b
Therefore, if I go for a balanced diet, then I
Explanation: The premises (p ∧ q) ∨ r has
will remain healthy.”
a) Modus tollens two clauses: p ∨ r, and q ∨ r. We can also
b) Modus ponens replace r → s with the equivalent clause r ∨ s.
c) Disjunctive syllogism Using the two clauses p ∨ r and r ∨ s, we can
d) Hypothetical syllogism conclude p ∨ s.
Answer: d 9. What rules of inference are used in this

Explanation: ((p → q) ∧ (q → r)) → (p → r) argument?
argument is ‘Hypothetical syllogism’. “Jay is an awesome student. Jay is also a
good dancer. Therefore, Jay is an awesome
6. What rules of inference are used in this student and a good dancer.”
argument? a) Conjunction
“All students in this science class has taken a b) Modus ponens
course in physics” and “Marry is a student in c) Disjunctive syllogism
this class” imply the conclusion “Marry has d) Simplification
taken a course in physics.”
a) Universal instantiation Answer: a
b) Universal generalization Explanation: ((p) ∧ (q)) → (p ∧ q) argument
c) Existential instantiation is conjunction.
d) Existential generalization
10. “Parul is out for a trip or it is not
Answer: a snowing” and “It is snowing or Raju is
Explanation: ∀xP (x), ∴ P (c) Universal playing chess” imply that __________
instantiation. a) Parul is out for trip
b) Raju is playing chess
7. What rules of inference are used in this c) Parul is out for a trip and Raju is playing
argument? chess
“It is either colder than Himalaya today or the d) Parul is out for a trip or Raju is playing
pollution is harmful. It is hotter than chess
Himalaya today. Therefore, the pollution is
harmful.” Answer: d
a) Conjunction Explanation: Let p be “It is snowing,” q be
b) Modus ponens “Parul is out for a trip,” and r the proposition
c) Disjunctive syllogism “Raju is playing chess.” The hypotheses as
d) Hypothetical syllogism ¬p ∨ q and p ∨ r, respectively. Using
resolution, the proposition q ∨ r is, “Parul is
Answer: c out for a trip or Raju is playing chess.”
Explanation: ((p ∨ q) ∧ ¬p) → q argument is
Disjunctive syllogism.

TOPIC 1.6 INTRODUCTION TO b) Contrapositive proofs

c) Vacuous proof
PROOFS, PROOF METHODS d) Mathematical Induction
AND STRATEGY.
Answer: c
1. Let the statement be “If n is not an odd Explanation: Definition of vacuous proof.
integer then square of n is not odd.”, then if
5. In proving √5 as irrational, we begin with
P(n) is “n is an not an odd integer” and Q(n)
assumption √5 is rational in which type of
is “(square of n) is not odd.” For direct proof
proof?
we should prove _________
a) Direct proof
a) ∀nP ((n) → Q(n))
b) Proof by Contradiction
b) ∃ nP ((n) → Q(n)) c) Vacuous proof
c) ∀n~(P ((n)) → Q(n)) d) Mathematical Induction
d) ∀nP ((n) → ~(Q(n)))
Answer: b
Answer: a Explanation: Definition of proof by
Explanation: Definition of direct proof. contradiction.
2. Which of the following can only be used in 6. A proof covering all the possible cases,
disproving the statements? such type of proofs are known as
a) Direct proof ___________
b) Contrapositive proofs a) Direct proof
c) Counter Example b) Proof by Contradiction
d) Mathematical Induction c) Vacuous proof
d) Exhaustive proof
Answer: c
Explanation: Counter examples cannot be Answer: d
used to prove results. Explanation: Definition of exhaustive proof.
3. Let the statement be “If n is not an odd 7. Which of the arguments is not valid in
integer then sum of n with some not odd proving sum of two odd number is not odd.
number will not be odd.”, then if P(n) is “n is a) 3 + 3 = 6, hence true for all
an not an odd integer” and Q(n) is “sum of n b) 2n +1 + 2m +1 = 2(n+m+1) hence true for
with some not odd number will not be odd.” all
A proof by contraposition will be ________ c) All of the mentioned
a) ∀nP ((n) → Q(n)) d) None of the mentioned
b) ∃ nP ((n) → Q(n))
c) ∀n~(P ((n)) → Q(n)) Answer: a
d) ∀n(~Q ((n)) → ~(P(n))) Explanation: Some examples are not valid in
proving results.
Answer: d
8. A proof broken into distinct cases, where
Explanation: Definition of proof by
these cases cover all prospects, such proofs
contraposition.
are known as ___________
4. When to proof P→Q true, we proof P false, a) Direct proof
that type of proof is known as ___________ b) Contrapositive proofs
a) Direct proof

c) Vacuous proof 343 > 27 as a base case and it is true for n =

d) Proof by cases 3.
Answer: c 2. In the principle of mathematical induction,

Explanation: Definition of proof by cases. which of the following steps is mandatory?
a) induction hypothesis
9. A proof that p → q is true based on the fact b) inductive reference
that q is true, such proofs are known as c) induction set assumption
___________ d) minimal set representation
a) Direct proof
b) Contrapositive proofs Answer: a
c) Trivial proof Explanation: The hypothesis of Step is a
d) Proof by cases must for mathematical induction that is the
statement is true for n = k, where n and k are
Answer: c any natural numbers, which is also called
Explanation: Definition of trivial proof. induction assumption or induction hypothesis.
10. A theorem used to prove other theorems 3. For m = 1, 2, …, 4m+2 is a multiple of

is known as _______________ ________
a) Lemma a) 3
b) Corollary b) 5
c) Conjecture c) 6
d) None of the mentioned d) 2
Answer: a Answer: d
Explanation: Definition of lemma. Explanation: For n = 1, 4 * 1 + 2 = 6, which
is a multiple of 2. Assume that 4m+2 is true
for m=k and so 4k+2 is true based on the
assumption. Now, to prove that 4k+2 is also a
multiple of 2 ⇒ 4(k+1)+2 ⇒ 2 * 4k – 4k + 6
UNIT II ⇒ 2*4k+4 – 4k+2 ⇒ 2(4k+2) – 2(2k+1).
COMBINATORICS Here, the first term 2(4k+2) is true as per
assumption and the second term 2(4k+2) is
must to be a multiple of 2. Hence, 4(k+1)+2
TOPIC 2.1 MATHEMATICAL is a multiple of 2. So, by induction
INDUCTION hypothesis, (4m+2) is a multiple of 2, for m =
1,2,3,…
1. What is the base case for the inequality 7n 4. For any integer m>=3, the series 2+4+6+…
> n3, where n = 3? +(4m) can be equivalent to ________
a) 652 > 189 a) m2+3
b) 42 < 132 b) m+1
c) 343 > 27
c) mm
d) 42 <= 431
d) 3m2+4
Answer: c
Explanation: By the principle of Answer: a
mathematical induction, we have 73 > 33 ⇒ Explanation: The required answer is m2+3.

Now, by induction assumption, we have to 22 + 32 + … + b2 + (b + 1)2 =

prove 2+4+6+…+4(k+1) = (k+1)2+3 also can . Hence it is proved that 12 +
(b+1)[(b+2)(2b+3)]
be true, 2+4+6+…+4(k+1) = 2+4+6+⋯+ 6
22 + 32 + … + p2 = .
p∗(p+1)∗(2p+1)
(4k+4) and by the subsequent steps, we can 6
prove that (m+1)2+3 also holds for m=k. So, 7. For any positive integer m ______ is
it is proved. divisible by 4.
5. For every natural number k, which of the a) 5m2 + 2
following is true? b) 3m + 1
a) (mn)k = mknk c) m2 + 3
b) m*k = n + 1 d) m3 + 3m
c) (m+n)k = k + 1
Answer: d
d) mkn = mnk
Explanation: The required answer is, m3 +
Answer: a 3m. Now, by induction hypothesis, we have
Explanation: In the first step, for k = 1, to prove for m=k, k3+3k is divisible by 4. So,
(mn)1 = m1n1 = mn, hence it is true. Let us (k + 1)3 + 3 (k + 1) = k3 + 3 k2 + 6 k + 4
assume the statement is true for k = l, Now by = [k3 + 3 k] + [3 k2 + 3 k + 4] = 4M + (12k2
induction assumption, (mn)1 = m1n1 is true. + 12k) – (8k2 + 8k – 4), both the terms are
So, to prove, (mn)l+1 = ml + 1nl+1, we have divisible by 4. Hence (k + 1)3 + 3 (k + 1) is
(mn)l = mlnl and multiplying both sides by also divisible by 4 and hence it is proved for
(mn) ⇒ (mn)1(mn)=(m1n1)(mn) any integer m.
⇒ (mn)l+1 = (mm1)(nn1) ⇒ (mn)l+1 = 8. According to principle of mathematical
(ml+1nl+1). Hence, it is proved. So, (mn)k = induction, if P(k+1) = m(k+1) + 5 is true then
mknk is true for every natural number k. _____ must be true.
a) P(k) = 3m(k)
6. By induction hypothesis, the series 12 + 22 b) P(k) = m(k) + 5
+ 32 + … + p2 can be proved equivalent to c) P(k) = m(k+2) + 5
____________ d) P(k) = m(k)
2
a) p +2
b)
p∗(p+1)∗(2p+1)
Answer: b
6
Explanation: By the principle of
c)
p∗(p+1)
4 mathematical induction, if a statement is true

d) p+p2 for any number m = k, then for its successor
m = k + 1, the statement also satisfies,
Answer: b provided the statement is true for m = 1. So,
Explanation: By principle of mathematical the required answer is p(k) = mk + 5.
induction, we now assume that p (b) is true 12
+ 22 + 32 + … + b2 =
b(b+1)(2b+1)
9. Which of the following is the base case for
4n+1 > (n+1)2 where n = 2?
6
so to prove P(b+1): 12 + 22 + 32 + … + b2 +
a) 64 > 9
(b + 1)2 = + (b + 1)2
b(b+1)(2b+1)
6 b) 16 > 2
By induction assumption it is shown that 12 + c) 27 < 91
d) 54 > 8

Answer: a b) 10
Explanation: Statement By principle of c) 5
mathematical induction, for n=2 the base case d) 12
of the inequation 4n+1 > (n+1)2 should be 64
> 9 and it is true. Answer: b
Explanation: A simple polygon with n sides
10. What is the induction hypothesis can be triangulated into n-2 triangles, where n
assumption for the inequality m ! > 2m where > 2.
m>=4? 4. Let P(n) be the statement that postage of n
a) for m=k, k+1!>2k holds cents can be formed using just 3-cents stamps
b) for m=k, k!>2k holds and 5-cents stamps. Is the statements P(8) and
c) for m=k, k!>3k holds P(10) are Correct?
a) True
d) for m=k, k!>2k+1 holds
b) False
Answer: b
Answer: a
Explanation: By the induction hypothesis,
Explanation: We can form 8 cent of postage
assume that p (k) = k! > 2k is true, for m=k with one 3-cent stamp and one 5-cent stamp.
and we need to prove this by the principle of P(10) is true because we can form it using
mathematical induction. two 5-cent stamps.
TOPIC 2.2 STRONG INDUCTION 5. Which amount of postage can be formed

using just 4-cent and 11-cent stamps?
AND WELL ORDERING a) 2
b) 5
1. A polygon with 7 sides can be triangulated c) 30
into ________ d) 10
a) 7
b) 14 Answer: d
c) 5 Explanation: We can form 30 cent of postage
d) 10 with two 4-cent stamp and two 11-cent stamp.
Answer: c 6. 22-cent of postage can be produced with

Explanation: A simple polygon with n sides two 4-cent stamp and one 11-cent stamp.
can be triangulated into n-2 triangles, where n a) True
> 2. b) False
2. Every simple polynomial has an interior Answer: b

diagonal. Explanation: By using two 4-cent stamp and
a) True one 11-cent stamp, 27-cent postage is
b) False produced.
Answer: a 7. Which amount of postage can be formed

Explanation: By using Strong Induction. using just 3-cent stamp and 10-cent stamps?
a) 27
3. A polygon with 12 sides can be b) 20
triangulated into _______
a) 7

c) 11 can be triangulated into n-2 triangles, where n

d) 5 > 2.
Answer:a
Explanation: We can form 27 cent of postage TOPIC 2.3 THE BASICS OF
with nine 3-cent stamp and 20-cent postage COUNTING
can be formed by using two 10-cent stamps.
1. How many even 4 digit whole numbers are
8. Suppose that P(n) is a propositional there?
function. Determine for which positive a) 1358
integers n the statement P(n) must be true if: b) 7250
P(1) is true; for all positive integers n, if P(n) c) 4500
is true then P(n+2) is true. d) 3600
a) P(3)
b) P(2) Answer: c
c) P(4) Explanation: The thousands digit cannot be
d) P(6) zero, so there are 9 choices. There are 10
possibilities for the hundreds digit and 10
Answer: a possibilities for the tens digit. The units digit
Explanation: By induction we can prove that can be 0, 2, 4, 6 or 8, so there are 5 choices.
P(3) is true but we can’t conclude about P(2), By the basic counting principle, the number
p(6) and P(4). of even five digit whole numbers is 9 × 10 ×
10 × 5 = 45,00.
9. Suppose that P(n) is a propositional
function. Determine for which positive 2. In a multiple-choice question paper of 15
integers n the statement P(n) must be true if: questions, the answers can be A, B, C or D.
P(1) and P(2) is true; for all positive integers The number of different ways of answering
n, if P(n) and P(n+1) is true then P(n+2) is the question paper are ________
true.
a) 65536 x 47
a) P(1)
b) P(2) b) 194536 x 45
c) P(4) c) 23650 x 49
d) P(n) d) 11287435
Answer: d Answer: a
Explanation: By induction, we can prove that Explanation: There are 415 = 65536 x 47
P(n) is true. different ways of answering the exam paper
of 15 MCQs.
10. A polygon with 25 sides can be
triangulated into _______ 3. How many words with seven letters are
a) 23 there that start with a vowel and end with an
b) 20 A? Note that they don’t have to be real words
c) 22 and letters can be repeated.
d) 21 a) 45087902
b) 64387659
Answer: a c) 12765800
Explanation: A simple polygon with n sides d) 59406880

Answer: d c) 12000
Explanation: The first letter must be a vowel, d) 10500
so there are 5 choices. The second letter can
be any one of 26, the third letter can be any Answer: d
one of 26, the fourth letter can be any one of Explanation: By the Basic Counting
26 and fifth and sixth letters can be any of 26 Principle, the number of different choices is
choices. The last letter must be an A, so there 10 × 15 × 7 = 10500.
is only 1 choice. By the basic counting
principle, the number of ‘words’ is 5 × 26 × 7. There are two different Geography books,
26 × 26 × 26 × 26 × 1 = 59406880. five different Natural Sciences books, three
different History books and four different
4. Neela has twelve different skirts, ten Mathematics books on a shelf. In how many
different tops, eight different pairs of shoes, different ways can they be arranged if all the
three different necklaces and five different books of the same subjects stand together?
bracelets. In how many ways can Neela dress a) 353450
up? b) 638364
a) 50057 c) 829440
b) 14400 d) 768700
c) 34870
d) 56732 Answer: c
Explanation: There are four groups of books
Answer: b which can be arranged in 4! different ways.
Explanation: By the basic counting principle, Among those books, two are Geography
the number of different ways = 12 × 10 × 8 × books, five are Natural Sciences books, three
3 × 5 = 14400. Note that shoes come in pairs. are History books and four are Mathematics
So she must choose one pair of shoes from books. Therefore, there are 4! × 2! × 5! × 3! ×
ten pairs, not one shoe from twenty. 4! = 829440 ways to arrange the books.
5. How many five-digit numbers can be made 8. The code for a safe is of the form
from the digits 1 to 7 if repetition is allowed? PPPQQQQ where P is any number from 0 to
a) 16807 9 and Q represents the letters of the alphabet.
b) 54629 How many codes are possible for each of the
c) 23467 following cases? Note that the digits and
d) 32354 letters of the alphabet can be repeated.
a) 874261140
Answer: a b) 537856330
Explanation: 75 = 16807 ways of making the c) 549872700
numbers consisting of five digits if repetition d) 456976000
is allowed.
Answer: d
6. For her English literature course, Ruchika Explanation: 103 × 264 = 456976000
has to choose one novel to study from a list of possible codes are formed for the safe with
ten, one poem from a list of fifteen and one the alphanumeric digits.
short story from a list of seven. How many
different choices does Rachel have? 9. Amit must choose a seven-digit PIN
a) 34900 number and each digit can be chosen from 0
b) 26500 to 9. How many different possible PIN
numbers can Amit choose?

a) 10000000 2. The least number of computers required to

b) 9900000 connect 10 computers to 5 routers to
c) 67285000 guarantee 5 computers can directly access 5
d) 39654900 routers is ______
a) 74
Answer: a b) 104
Explanation: By the basic counting principle, c) 30
the total number of PIN numbers Amit can d) 67
choose is 10 × 10 × 10 × 10 × 10 × 10 × 10 =
10,000000. Answer: c
Explanation: Since each 5 computer need
10. A head boy, two deputy head boys, a head directly connected with each router. So 25
girl and 3 deputy head girls must be chosen connections + now remaining 5 computer,
out of a student council consisting of 14 girls each connected to 5 different routers, so 5
and 16 boys. In how many ways can they are connections = 30 connections. Hence,
chosen?
a) 98072 c1->r1, r2, r3, r4, r5
b) 27384 c2->r1, r2, r3, r4, r5
c) 36428
d) 44389 c3->r1, r2, r3, r4, r5
Answer: b c4->r1, r2, r3, r4, r5

Explanation: There are 16 × 15 × 14 + 14 ×
c5->r1, r2, r3, r4, r5
13 × 12 × 11 = 27384 ways to choose from a
student council. c6->r1
c7->r2
TOPIC 2.4 THE PIGEONHOLE
PRINCIPLE c8->r3
c9->r4
1. A drawer contains 12 red and 12 blue
socks, all unmatched. A person takes socks c10->r5
out at random in the dark. How many socks
must he take out to be sure that he has at least
Now, any pick of 5 computers will have a
two blue socks? direct connection to all the 5 routers.
a) 18
b) 35 3. In a group of 267 people how many friends
c) 28 are there who have an identical number of
d) 14 friends in that group?
a) 266
Answer: d
b) 2
Explanation: Given 12 red and 12 blue socks
c) 138
so, in order to take out at least 2 blue socks,
d) 202
first we need to take out 12 shocks (which
might end up red in worst case) and then take Answer: b
out 2 socks (which would be definitely blue). Explanation: Suppose each of the 267
Thus we need to take out total 14 socks. members of the group has at least 1 friend. In
this case, each of the 267 members of the

group will have 1 to 267-1=266 friends. Now, pigeonhole principle = we need to choose 1
consider the numbers from 1 to n-1 as holes more element so that sum will definitely be 7.
and the n members as pigeons. Since there is So Number of elements must be 4 + 1 = 5.
n-1 holes and n pigeons there must exist a
hole which must contain more than one 6. During a month with 30 days, a cricket
pigeon. That means there must exist a number team plays at least one game a day, but no
from 1 to n-1 which would contain more than more than 45 games. There must be a period
1 member. So, in a group of n members there of some number of consecutive days during
must exist at least two persons having equal which the team must play exactly ______
number of friends. A similar case occurs number of games.
when there exist a person having no friends. a) 17
b) 46
4. When four coins are tossed simultaneously, c) 124
in _______ number of the outcomes at most d) 24
two of the coins will turn up as heads.
a) 17 Answer: d
b) 28 Explanation: Let a1 be the number of games
c) 11 played until day 1, and so on, ai be the no
d) 43 games played until i. Consider a sequence
like a1,a2,…a30 where 1≤ai≤45, ∀ai. Add 14
Answer: c to each element of the sequence we get a new
Explanation: The question requires you to sequence a1+14, a2+14, … a30+14 where, 15
find number of the outcomes in which at most ≤ ai+14 ≤ 59, ∀ai. Now we have two
2 coins turn up as heads i.e., 0 coins turn sequences 1. a1, a2, …, a30 and 2. a1+14,
heads or 1 coin turns head or 2 coins turn a2+14, …, a30+14. having 60 elements in
heads. The number of outcomes in which 0 total with each elements taking a value ≤ 59.
coins turn heads is 4C0 = 1 outcome. The So according to pigeon hole principle, there
number of outcomes in which 1 coin turns must be at least two elements taking the same
value ≤59 i.e., ai = aj + 14 for some i and j.
head is 4C1 = 6 outcomes. The number of
Therefore, there exists at least a period such
outcomes in which 2 coins turn heads is, as aj to ai, in which 14 matches are played.
4C = 15 outcomes. Therefore, total number
2
of outcomes = 1 + 4 + 6 = 11 outcomes. 7. In how many ways can 8 different dolls be
packed in 5 identical gift boxes such that no
5. How many numbers must be selected from box is empty if any of the boxes hold all of
the set {1, 2, 3, 4} to guarantee that at least the toys?
one pair of these numbers add up to 7? a) 2351
a) 14 b) 365
b) 5 c) 2740
c) 9 d) 1260
d) 24
Answer: d
Answer: b Explanation: Dolls are different but the
Explanation: With 2 elements pairs which boxes are identical. If none of the boxes is to
give sum as 7 = {(1,6), (2,5), (3,4), (4,3)}. So remain empty, then we can pack the dolls in
choosing 1 element from each group = 4 one of the following ways:
elements (in worst case 4 elements will be Case i. 2, 2, 2, 1, 1
either {1,2,3,4} or {6,5,4,3}). Now using Case ii. 3, 3, 1, 1

Case i: Number of ways of achieving the first persons were present at the party?
option 2, 2, 2, 1, 1. Two dolls out of the 8 can a) 15
be selected in 8C2 ways, another 2 out of the b) 14
c) 16
remaining 6 can be selected in 6C2 ways, d) 17
another 2 out of the remaining 4 can be
selected in 4C2 ways and the last two dolls Answer: b
Explanation: Let the total number of persons
can be selected in 1C1 ways each. However, present at the party be m, Then, [{x *
as the boxes are identical, the two different (x−1)}/2] = 90.
ways of selecting which box holds the first x = 14.
two dolls and which one holds the second set
of two dolls will look the same. Hence, we 10. A bag contains 25 balls such as 10 balls
need to divide the result by 2. Therefore, total are red, 7 are white and 8 are blue. What is
number of ways of achieving the 2, 2, 2, 1, 1 the minimum number of balls that must be
is = (8C2 * 6C2 * 4C2 * 1C1 * 1C1) / 2 = 1260. picked up from the bag blindfolded (without
replacing any of it) to be assured of picking at
8. A group of 20 girls plucked a total of 200 least one ball of each colour?
oranges. How many oranges can be plucked a) 10
one of them? b) 18
a) 24 c) 63
b) 10 d) 35
c) 32
Answer: b
d) 7
Explanation: Consider three buckets red,
Answer: a white and blue and we want the total number
Explanation: Suppose all of them plucked of balls such that each bucket contain at least
the different number of oranges. A girl can one ball. Now consider the state of picking up
pluck at least 0 oranges and the number of a ball without replacement : (normally you
oranges plucks by each student is distinct. So, consider the worst case scenario in these
total number of plucked oranges should be cases) Starting 10 balls all are red and thus
less than 100. But 0+1+2…..+19+20 = goes to bucket name Red. Now again picking
210>200 a contradiction. up the ball gives 7 balls which are of same
Thus there exist two girls who plucked the colour and put all of them in a bucket named
same number of oranges. If thus there exist White. The next pick will definitely be of
two girls who plucked the same number of different colour thus: we picked 10 + 7 + 1 =
oranges. It means each girl of remaining 18 18.
students plucked different number of oranges.
Number of oranges Plucked by 18 students = TOPIC 2.5 PERMUTATIONS
0+1+2+3…+17 = 153 oranges. Number of
oranges plucked by remaining 2 student =
1. How many substrings (of all lengths
200 – 153 = 47. Both students plucked same
inclusive) can be formed from a character
number of oranges. So, Number of oranges
string of length 8? (Assume all characters to
plucked by one of them = 47/2=24.
be distinct)
9. In a get-together party, every person a) 14
present shakes the hand of every other person. b) 21
If there were 90 handshakes in all, how many

c) 54 b) 24310
d) 37 c) 32654
d) 29803
Answer: d
Explanation: Let’s consider the given string Answer: a
is CLEAN, so set of string of length 1 = Explanation: First place 17 zeroes side by
{C,L,E,A,N} ; cardinality of set = 5 set of side _ 0 _ 0 _ 0 … 0 _ and 8 1’s can be placed
string of length 2 = {CL,EE,EA,NN}, set of in any of the (17+1) available gaps hence the
string of length 3 = {CLE,LEE,EAN}, set of number of ways = n+1Ck = 43758.
strings of length 4 = {CLEN,LEAN}, set of
strings of length 5 = {CLEAN} and set of 4. How many words that can be formed with
string of length 0 = {} and we cannot have the letters of the word ‘SWIMMING’ such
any substring of length 6 as given string has that the vowels do not come together?
only 5 length. So total no of substrings are Assume that words are of with or without
possible = 0 length substring + 1 length meaning.
substring + 2 length substrings +3 length a) 430
substrings + 4 length substrings + 5 length b) 623
substrings = 1 + 5 + 4 + 3 + 2 + 1 = 16 means c) 729
for 1 length string to n length substrings it d) 1239
will sum of the n natural no from 1 to n.
so 1+2+3+…+n = so total no Answer: c
n(n+1)
substrings possible = 0 length strings + Explanation: The word ‘SWIMMING

n(n+1)
= 1+ [
n(n+1)
] so total no of substrings
contains 8 letters. Of which, I occurs twice
2 2
and M occurs twice. Therefore, the number of
possible in n length string (All length
n(n+1) 8(8+1) words formed by this word = 8!
= 10080.
inclusive )= 1 + [ ] = = 37. 2!∗2!
2 2
In order to find the number of permutations
that can be formed where the two vowels I
2. The number of diagonals can be drawn in a
and I come together, we group the letters that
hexagon is ______
should come together and consider that group
a) 9
as one letter. So, the letters are S, W, M, M,
b) 32
N, G, (I, I). So, the number of letters are 7 the
c) 16
number of ways in which 7 letters can be
d) 21
arranged is 7! = 5040. In I and I, the number
Answer: a of ways in which I and I can be arranged is
Explanation: A hexagon has 6 sides. We 2!. Hence, the total number of ways in which
obtain the diagonals by joining the vertices in the letters of the ‘SWIMMING’ can be
pairs. arranged such that vowels are always together
are 7!
= 5040 ways. The number of words
Total number of sides and diagonals = 6C2 = 2!∗2!
in which the vowels do not come together is =

6∗5
2∗1
= 5×3 = 15. This includes its 6 sides also. (10080 – 5040) = 5040.
So, Diagonals = 15 – 6 = 9. Hence, the
number of diagonals is 9. 5. A number lock contains 6 digits. How
many different zip codes can be made with
3. The number of binary strings of 17 zeros the digits 0–9 if repetition of the digits is
and 8 ones in which no two ones are adjacent allowed upto 3 digits from the beginning and
is ___________ the first digit is not 0?
a) 43758 a) 254307

b) 453600 8. In how many ways can 10 boys be seated

c) 458760 in a row having 28 seats such that no two
d) 972340 friends occupy adjacent seats?
a) 13P5
Answer: b
Explanation: For the first position, there are b) 9P29
9 possible choices (since 0 is not allowed). c) 19P10
After that number is chosen, there are 10
possible choices (since 0 is now allowed) for d) 15P7
the second digit, for the third digit there are
10 possible choices, 9 possible choices for the Answer: c
fourth digit and 8 possible choices for the Explanation: First let us take the 18
fifth digit and 7 possible choices for the sixth unoccupied seats. They create 19 slots i.e.,
digit. The count of number locks = 453600. one on the left of each seat and one on the
right of the last one. So we can place the 10
6. Let M be a sequence of 9 distinct integers boys in any of these 19 slots that are, 19P10
sorted in ascending order. How many distinct ways.
pairs of sequences, N and O are there such
that i) each are sorted in ascending order, ii) 9. In how many ways can the letters of the
N has 5 and O has 4 elements, and iii) the word SANFOUNDRY be rearranged such
result of merging N and O gives that that the vowels always appear together?
sequence?
a)
(8+3)!
a) 84 2!
b) 35 b) 6!
2!
c) 194 c) 8!*3!
d) 138 d) 4!
8!
Answer: a Answer: c
Explanation: Selecting any 3 elements from Explanation: Take AOU together and treat it
given 9 elements gives 9C3 = 84 number of like 1 entity and arrange SNFNDRY in 8!
distinct pairs of sequences. Ways. Then, the AOU can be arranged in 3!
ways. So, total arrangements = 8! * 3! =
7. 14 different letters of alphabet are given, 40320 * 6 = 241920.
words with 6 letters are formed from these
given letters. How many number of words are 10. How many ways can 8 prizes be given
there which have at least one letter repeated? away to 7 students, if each student is eligible
a) 892742 for all the prizes?
b) 999988 a) 40325
c) 213216 b) 40320
d) 786730 c) 40520
d) 40720
Answer: b
Explanation: Number of words which have Answer: b
at least one letter replaced = total number of Explanation: Now the first student is eligible
words – total number of words in which no to receive any of the 8 available prizes (so 8
ways), the second student will receive a prize
letter is repeated, => 106 – 12P6 => 1000000 from rest 7 available prizes (so 7 ways), the
− 924 = 999988. third student will receive his prize from the

rest 6 prizes available(so 6 ways) and so on. 3. The number of words of 4 consonants and
So total ways would be 8! = 3 vowels can be made from 15 consonants
8*7*6*5*4*3*2*1 = 40320. Hence, the 7 and 5 vowels, if all the letters are different is
prizes can be distributed in 40320 ways. ________
a) 3! * 12C5
TOPIC 2.6 COMBINATIONS b) 16C4 * 4C4
c) 15! * 4
1. There are 6 equally spaced points A, B, C, d) 15C4 * 5C3 * 7!
D, E and F marked on a circle with radius R.
How many convex heptagons of distinctly Answer: d
different areas can be drawn using these Explanation: There are 4 consonants out of
points as vertices?
a) 7! * 6 15 can be selected in 15C4 ways and 3 vowels
b) 7C5 can be selected in 5C3 ways. Therefore, the
c) 7! total number of groups each containing 4
d) same area
consonants and 3 vowels = 15C4 * 4C3. Each
Answer: d group contains 7 letters which can be
Explanation: Since all the points are equally arranged in 7! ways. Hence, required number
spaced; hence the area of all the convex of words = 15C4 * 5C3 * 7!.
heptagons will be the same.
4. How many ways are there to arrange 7
2. There are 2 twin sisters among a group of chocolate biscuits and 12 cheesecake biscuits
15 persons. In how many ways can the group into a row of 19 biscuits?
be arranged around a circle so that there is a) 52347
exactly one person between the two sisters? b) 50388
a) 15 *12! * 2! c) 87658
b) 15! * 2! d) 24976
c) 14C2
d) 16 * 15! Answer: b
Explanation: Consider the situation as
Answer: a having 19 spots and filling them with 7
Explanation: We know that n objects can be chocolate biscuits and 19 cheesecake biscuits.
(n−1)! Then we just choose 7 spots for the chocolate
arranged around a circle in . If we
2
biscuits and let the other 10 spots have
consider the two sisters and the person in cheesecake biscuits. The number of ways to
between the brothers as a block, then there
will 12 others and this block of three people do this job is 19C7 = 50388.
to be arranged around a circle. The number of
ways of arranging 13 objects around a circle 5. If a, b, c, d and e are five natural numbers,
is in 12! ways. Now the sisters can be then find the number of ordered sets(a, b, c, d,
arranged on either side of the person who is e) possible such that a+b+c+d+e=75.
in between the sisters in 2! ways. The person a) 65C5
who sits in between the two sisters can be any
b) 58C6
of the 15 in the group and can be selected in
15 ways. Therefore, the total number of ways c) 72C7
15 *12! * 2!. d) 74C4

Answer: d groups of 2 each such that at least one group

Explanation: Let assumes that there are 75 must have only Indian countries?
identical balls which are to be arranged in 5 a) 6
different compartments (Since a, b, c, d, e are b) 45
distinguishable). If the balls are arranged in c) 12
the row. We have 74 gaps where we can place d) 76
a ball in each gap since we need 5
compartments we need to place only 4 balls. Answer: a
We can do this in 74C4 ways. Explanation: The number of ways to divide
4+4=8 countries into 4 groups of 2 each is as
6. There are 15 people in a committee. How follows: (10C2 * 10C2 * 10C2 * 10C2)/4! = 30.
many ways are there to group these 15 people Since it is required that at least one group
into 3, 5, and 4? must have only Indian countries, we need to
a) 846 subtract 30 from the number of possible
b) 2468 groupings where all 4 groups have 1 Indian
c) 658 country and 1 China country each. This is
d) 1317 equivalent to the number of ways to match
each of the 4 Indian countries with one China
Answer: d country: 4! = 24. Therefore, the answer is 30
Explanation: The number of ways to choose – 24 = 6.
3 people out of 9 is 15C3. Then, number of
9. Find the number of factors of the product
ways to choose 5 people out of (15-3) = 12 is
12C . Finally, the number of ways to choose 4 58 * 75 * 23 which are perfect squares.
5 a) 47
people out of (12-4) = 8 is 8C4. Hence, by the b) 30
rule of product, 15C3 + 12C5 + 8C4 = 1317. c) 65
d) 19
7. There are six movie parts numbered from 1
Answer: b
to 6. Find the number of ways in which they
Explanation: Any factor of this number
be arranged so that part-1 and part-3 are never
together. should be of the form 5a * 7b * 2c. For the
a) 876 factor to be a perfect square a, b, c has to be
b) 480 even. a can take values 0, 2, 4, 6, 8, b can take
c) 654 values 0, 2, 4 and c can take values 0, 2. Total
d) 237 number of perfect squares = 5 * 3 * 2 = 30.
Answer: b 10. From a group of 8 men and 6 women, five

Explanation: The total number of ways in persons are to be selected to form a
which 6 part can be arranged = 6! = 720. The committee so that at least 3 women are there
total number of ways in which part-1 and on the committee. In how many ways can it
part-3 are always together: = 5!*2! = 240. be done?
Therefore, the total number of arrangements, a) 686
in which they are not together is = 720 − 240 b) 438
= 480. c) 732
d) 549
8. How many ways are there to divide 4
Indian countries and 4 China countries into 4

Answer: a n=1 to get a system of two equations with two

Explanation: We may have (2 men and 3 unknowns: 4=a20+b180=a+b and
women) or (1 men and 4 woman) or (5 3=a21+b61=2a+6b. Solving this system gives
women only). The Required number of ways b=-1/2 and a=7/2. So the solution to the
= (8C2 × 6C3) + (8C1 × 6C4) + (6C5) = 686. recurrence relation is,
an = 7/2*2n−1/2*6n.
TOPIC 2.7 RECURRENCE
RELATIONS 3. What is the recurrence relation for 1, 7, 31,
127, 499?
a) bn+1=5bn-1+3
1. Consider the recurrence relation a1=4,
b) bn=4bn+7!
an=5n+an-1. The value of a64 is _________
c) bn=4bn-1+3
a) 10399
d) bn=bn-1+1
b) 23760
c) 75100
d) 53700 Answer: c
Explanation: Look at the differences
Answer: a between terms: 1, 7, 31, 124,…. and these are
Explanation: an=5n+an-1 growing by a factor of 4. So, 1⋅4=4, 7⋅4=28,
= 5n + 5(n-1) + … + an-2 31⋅4=124, and so on. Note that we always
end up with 3 less than the next term. So,
= 5n + 5(n-1) + 5(n − 2) +…+ a1
bn=4bn-1+3 is the recurrence relation and the
= 5n + 5(n-1) + 5(n − 2) +…+ 4 [since, a1=4]
initial condition is b0=1.
= 5n + 5(n-1) + 5(n − 2) +…+ 5.1 – 1
= 5(n + (n − 1)+…+2 + 1) – 1
= 5 * n(n+1)/ 2 – 1 4. If Sn=4Sn-1+12n, where S0=6 and S1=7,
an = 5 * n(n+1)/ 2 – 1 find the solution for the recurrence relation.
Now, n=64 so the answer is a64 = 10399. a) an=7(2n)−29/6n6n
b) an=6(6n)+6/7n6n
2. Determine the solution of the recurrence
relation Fn=20Fn-1 − 25Fn-2 where F0=4 and c) an=6(3n+1)−5n
F1=14. d) an=nn−2/6n6n
a) an = 14*5n-1
Answer: b
b) an = 7/2*2n−1/2*6n Explanation: The characteristic equation of
c) an = 7/2*2n−3/4*6n+1 the recurrence relation is → x2−4x-12=0
So, (x-6)(x+2)=0. Only the characteristic root
d) an = 3*2n−1/2*3n is 6. Therefore the solution to the recurrence
relation will have the form: an=a.6n+b.n.6n.
Answer: b
Explanation: The characteristic equation of To find a and b, set n=0 and n=1 to get a
system of two equations with two unknowns:
the recurrence relation is → x2−20x+36=0
So, (x-2)(x-18)=0. Hence, there are two real 6=a60+b.0.60=a and 7=a61+b.1.61=2a+6b.
roots x1=2 and x2=18. Therefore the solution Solving this system gives a=6 and b=6/7. So
the solution to the recurrence relation is,
to the recurrence relation will have the form:
an=6(6n)−6/7n6n.
an=a2n+b18n. To find a and b, set n=0 and

5. Find the value of a4 for the recurrence bn=b2n+c6n. To find b and c, set n=0 and n=1
relation an=2an-1+3, with a0=6. to get a system of two equations with two
a) 320 unknowns: 3=b20+c60=b+c, and
b) 221 4=b21+c61=2b+6c. Solving this system gives
c) 141 c=-1/2 and b=7/2. So the solution to the
d) 65
recurrence relation is, bn=7/2*2n−1/2*6n.
Answer: c
Explanation: When n=1, a1=2a0+3, Now 8. What is the solution to the recurrence
a2=2a1+3. By substitution, we get relation an=5an-1+6an-2?
a2=2(2a0+3)+3. a) 2n2
Regrouping the terms, we get a4=141, where b) 6n
c) (3/2)n
a0=6.
d) n!*3
6. The solution to the recurrence relation Answer: b
an=an-1+2n, with initial term a0=2 are Explanation: Check for the left side of the
_________ equation with all the options into the
a) 4n+7 recurrence relation. Then, we get that 6n is
b) 2(1+n) the required solution to the recurrence
c) 3n2 relation an=5an-1 + 6an-2.
d) 5*(n+1)/2
9. Determine the value of a2 for the
Answer: b recurrence relation an = 17an-1 + 30n with
Explanation: When n=1, a1=a0+2. By a0=3.
substitution we get, a2=a1+2 ⇒ a2=(a0+2)+2 a) 4387
and so on. So the solution to the recurrence b) 5484
relation, subject to the initial condition should c) 238
be an=2+2n=2(1+n). d) 1437
7. Determine the solution for the recurrence Answer: d

relation bn=8bn-1−12bn-2 with b0=3 and Explanation: When n=1, a1=17a0+30, Now
b1=4. a2=17a1+30*2. By substitution, we get
a) 7/2*2n−1/2*6n a2=17(17a0+30)+60. Then regrouping the
b) 2/3*7n-5*4n terms, we get a2=1437, where a0=3.
c) 4!*6n 10. Determine the solution for the recurrence
d) 2/8n relation an = 6an-1−8an-2 provided initial
Answer: a conditions a0=3 and a1=5.
Explanation: Rewrite the recurrence relation a) an = 4 * 2n – 3n
bn-8bn-1+12bn-2=0. Now from the b) an = 3 * 7n – 5*3n
characteristic equation: x2−8x+12=0 we have
c) an = 5 * 7n
x: (x−2)(x−6)=0, so x=2 and x=6 are the
characteristic roots. Therefore the solution to d) an = 3! * 5n
the recurrence relation will have the form:

Answer: b Answer: b
Explanation: The characteristic polynomial Explanation: For the sequence 1, 6, 36,
is x2−6x+8. By solving the characteristic 216,… the generating function must be 1
(1−6x
equation, x2−6x+8=0 we get x=2 and x=4, , when basic generating function: 1
1−x
.
these are the characteristic roots. Therefore
we know that the solution to the recurrence 3. What is the generating function for
relation has the form an=a*2n+b*4n, for some generating series 1, 2, 3, 4, 5,… ?
constants a and b. Now, by using the initial a) 2
(1−3x)
conditions a0 and a1 we have: a=7/2 and b) 1
(1+x)
b=-1/2. Therefore the solution to the c) 1

2
(1−x)
recurrence relation is: an = 4 * 2n – 1*3n = d) 1
(1−x2)
7/2 * 2n – 1/2*3n.
Answer: c
TOPIC 2.8 GENERATING Explanation: Basic generating function is
1
. If we differentiate term by term in the
FUNCTIONS 1−x
power series, we get (1 + x + x2 + x3 +⋯)′ =

1. What is the sequence depicted by the 1 + 2x + 3x2 + 4x3 +⋯ which is the
generating series 4 + 15x2 + 10x3 + 25x5 + generating series for 1, 2, 3, 4,….
16x6+⋯? 4. What is the generating function for the
a) 10, 4, 0, 16, 25, … generating sequence A = 1, 9, 25, 49,…?
b) 0, 4, 15, 10, 16, 25,…
a) 1+(A-x2)
c) 4, 0, 15, 10, 25, 16,…
b) (1-A)-1/x
d) 4, 10, 15, 25,…
c) (1-A)+1/x2
Answer: c d) (A-x)/x3
Explanation: Consider the coefficients of
each xn term. So a0=4, since the coefficient of Answer: b
Explanation: The generating function for the
x0 is 4 (x0=1 so this is the constant term).
sequence A. Using differencing:
Since 15 is the coefficient of x2, so 15 is the A = 1 + 9x + 25x2 + 49x3 + ⋯(1)
term a2 of the sequence. To find a1 check the
−xA = 0 + x + 9x2 + 25x3 + 49x4 + ⋯(2)
coefficient of x1 which in this case is 0. So
(1−x)A = 1 + 8x + 16x2 + 24x3 +⋯. Since 8x
a1=0. Continuing with these we have a2=15,
a3=10, a4=25, and a5=16. So we have the + 16x2 + 24x3 + ⋯ = (1-x)A-1 ⇒ 8 + 16x +
sequence 4, 0, 15, 10, 25, 16,… 24x2 +…= (1-A)-1/x.
2. What is the generating function for the 5. What is the recurrence relation for the
sequence 1, 6, 16, 216,….? sequence 1, 3, 7, 15, 31, 63,…?
(1+6x) a) an = 3an-1−2an+2
a)
b) an = 3an-1−2an-2
3
x
b) 1
(1−6x)
c) an = 3an-1−2an-1
c) 1
(1−4x)
d) an = 3an-1−2an-3
d) 1-6x2

Answer: b 9. Suppose G is the generating function for

Explanation: The recurrence relation for the the sequence 4, 7, 10, 13, 16, 19,…, the find a
sequence 1, 3, 7, 15, 31, 63,… should be an = generating function (in terms of G) for the
3an-1−2an-2. The solution for A: A=1/1 − 3x sequence of differences between terms.
a) (1−x)G−4/x
+ 2x2.
b) (1−x)G−4/x3
6. What is multiplication of the sequence 1, 2, c) (1−x)G+6/x
3, 4,… by the sequence 1, 3, 5, 7, 11,….? d) (1−x)G−x2
a) 1, 5, 14, 30,…
b) 2, 8, 16, 35,… Answer: a
c) 1, 4, 7, 9, 13,… Explanation: (1−x)G = 4 + 3x + 6x2 + 9x3
d) 4, 8, 9, 14, 28,… +⋯ which can be accepted. We can compute
it like this:
Answer: a 3 + 6x + 9x2 + ⋯ = (1−x)G−4/x.
Explanation: The first constant term is 1⋅1,
next term will be 1⋅3 + 2⋅1 = 5, the next term: 10. Find the sequence generated by
1⋅5 + 2⋅3 + 3⋅1 = 14, another one: 1⋅7 + 2⋅5 +
1/1−x2−x4.,assume that 1, 1, 2, 3, 5, 8,… has
3⋅3 + 4⋅1 = 30. The resulting sequence is 1, 5,
generating function 1/1−x−x2.
14, 30,…
a) 0, 0, 1, 1, 2, 3, 5, 8,…
b) 0, 1, 2, 3, 5, 8,…
7. What will be the sequence generated by the
c) 1, 1, 2, 2, 4, 6, 8,…
generating function 4x/(1-x)2? d) 1, 4, 3, 5, 7,…
a) 12, 16, 20, 24,…
b) 1, 3, 5, 7, 9,… Answer: a
c) 0, 4, 8, 12, 16, 20,… Explanation: Based on the given generating
d) 0, 1, 1, 3, 5, 8, 13,… function, the sequence will be 0, 0, 1, 1, 2, 3,
5, 8,… which is generated by 1/1−x2−x4.
Answer: c
Explanation: The sequence should be 0, 4, 8,
12, 16, 20,…for the generating function TOPIC 2.9 INCLUSION AND
4x/(1-x)2, when basic generating function: EXCLUSION PRINCIPLE AND
1/(1-x). ITS APPLICATIONS
8. What is the generating function for the
sequence with closed formula 1. There are 70 patients admitted in a hospital
in which 29 are diagnosed with typhoid, 32
an=4(7n)+6(−2)n?
with malaria, and 14 with both typhoid and
a) (4/1−7x)+6! malaria. Find the number of patients
b) (3/1−8x) diagnosed with typhoid or malaria or both.
c) (4/1−7x)+(6/1+2x) a) 39
d) (6/1-2x)+8 b) 17
c) 47
Answer: c d) 53
Explanation: For the given sequence after
evaluating the formula the generating formula Answer: c
will be (4/1−7x)+(6/1+2x). Explanation: By using the inclusion-
exclusion principle: |T ∪ M| = |T| + |M| – |T ∩

M| = (29 + 32) – (14) = 47. Thus 47 patients 4. In a renowned software development

are diagnosed with either typhoid or malaria. company of 240 computer programmers 102
employees are proficient in Java, 86 in C#,
2. At a software company, skilled workers 126 in Python, 41 in C# and Java, 37 in Java
have been hired for a project. Out of 75 and Python, 23 in C# and Python, and just 10
candidates, 48 of them were software programmers are proficient in all three
engineer; 35 of them were hardware engineer; languages. How many computer
42 of them were network engineer; 18 of programmers are there those are not
them had skills in all three jobs and all of proficient in any of these three languages?
them had skills in at least one of these jobs. a) 138
How many candidates were hired who were b) 17
skilled in exactly 2 jobs? c) 65
a) 69 d) 49
b) 14
c) 32 Answer: b
d) 8 Explanation: Let U denote the set of all
employed computer programmers and let J, C
Answer: b and P denote the set of programmers
Explanation: Since 18 are skilled in all 3. proficient in Java, C# and Python,
Subtract 18 from all three to get a total with respectively. So, |U| = 240, |J| = 102, |C| = 86,
single skilled and double skilled workers |P| = 126, |J ∩ C| = 41, |J ∩ P| = 37, |C ∩ P| =
including the duplicates. Software engineers 23 and |J ∩ C ∩ P| = 10. The number of
= 48 – 18 = 30, Hardware engineers = 35 – 18 computer programmers that are not proficient
= 17, Network engineers = 42 – 18 = 24 in any of these three languages is said to be
making a total of 71 and this is a total set of same as the cardinality of the complement of
single and double skilled workers including the set J ∪ C ∪ P. First, we have to calculate
duplicates. Out of 75 candidates, 18 were |J ∪ C ∪ P| = 102 + 86 + 126 – 41 – 37 – 23 +
skilled in three areas. So, 75 – 18 = 57 (actual 10 = 223. Now calculate |(J ∪ C ∪ P)’ | = |U|
no of workers skilled with single and both
– |J ∪ C ∪ P| = 240 – 223 = 17. 17
skills) Now the difference between the
number without duplicates (57) and with programmers are not proficient in any of the
three languages.
duplicates (71), 71 – 57 = 14. So, 14 are
skilled in exactly two jobs.
5. In class, students want to join sports. 15
3. The numbers between 1 and 520, including people will join football, 24 people will join
both, are divisible by 2 or 6 is _______ basketball, and 7 people will join both. How
a) 349 many people are there in the class?
b) 54 a) 19
c) 213 b) 82
c) 64
d) 303
d) 30
Answer: d
Explanation: We add the number of numbers Answer: d
that are divisible by 2 and 6 and subtract the Explanation: There are 15 people who wish
numbers which are divisible by 12. Hence, to join football, but 9 of those people also join
the required probability is basketball. By using the principle of inclusion
and exclusion, we have: 15 people joining
520
2
+
520
6
–
520
12
= 303.3 =
303(Approximately).

football + 24 people joining basketball – 9 since all the letters must be placed in the
people who will join both = 30 people total. remaining box, and T ⋂ C ⋂ P ⋂ D| = 0.
Hence, PIE implies |N| – |T U C U P U D| =
6. The sum of all integers from 1 to 520 that
49 – 4 x 29 + 4 x 19 – 0 = 260100.
are multiples of 4 or 5?
a) 187 8. A card is drawn randomly from a standard
b) 208 deck of cards. Determine the probability that
c) 421 the card drawn is a queen or a heart.
d) 52 a) 1
Answer: b b) 13
56
Explanation: PIE is used to count the c) 4
13
elements of a set and stated as the sum of d) 5
52
elements in A or B is equal to the sum of
elements in A plus the sum of elements in B Answer: c
minus the sum of elements in A and B. Let A Explanation: Let M be the event that the card
be the set of multiples of 4 and B be the set of is a queen, and let N be the event that the card
multiples of 5, then A ⋂ B is the set of is a heart. Then Since there are 13 different
multiples of 20, and hence ranks of cards in the deck, P(M) = 1
13
and
520
4
+
520
5
–
520
20
= 208. since there are 4 suits in the deck, P(N) = .
1
There is only one card that is both a queen

7. There are 9 letters having different colors and a heart, so P(M ⋂ N) = . Therefore,
1
(red, orange, yellow, green, blue, indigo, 52
P(M U N) = + –
1 1 1
=
16
=
4
.
violet) and 4 boxes each of different shapes 4 13 52 52 13
(tetrahedron, cube, polyhedron,

9. An integer from 300 through 780, inclusive
dodecahedron). How many ways are there to
is to be chosen at random. Find the
place these 9 letters into the 4 boxes such that
probability that the number is chosen will
each box contains at least 1 letter?
have 1 as at least one digit.
a) 260100
b) 878760 a) 171
900
c) 437102 b) 43
860
d) 256850 c) 231
546
d) 31
Answer: a 701
Explanation: Let N be the total number of Answer: a

ways we can distribute the letters. Each letter Explanation: The number of numbers that
can be placed into any one of the 4 boxes, so
don’t have one anywhere 93 = 729 is (9
|N| = 49. Let T be the set of ways such that possibilities for each individual digit), and
the tetrahedron box has no letters, C be the set
of ways such that the cube box has no letters, there are 9*102 = 900 numbers overall (9
P be the set of ways such that the cube box possibilities for hundreds, 10 for the tens and
units), so there are 900 – 729 = 171 numbers
has no letters, and D be the set of ways such
that the dodecahedron box has no letters. with at least a one and thus 171
900
probability.
Now, to find |N| – |T U C U P U D|. We have
10. From 1, 2, 3, …, 320 one number is
|T|=|C|=|P|=|D|=27 and since the letters can be selected at random. Find the probability that it
placed into one of the two other boxes, and is either a multiple of 7 or a multiple of 3.
|TUC| = |C U P| = |P U D| = |D U T| = 17, a) 72%

b) 42.5% Answer: a
c) 12.8% Explanation: A vertex colouring of a graph
d) 63.8% G = (V’,E’) with m colours is a mapping f:V’
-> {1,…,m} such that f(u)!=f(v) for every
Answer: b (u,v) belongs to E’. Since in worst case the
Explanation: Number of multiples of 7=45 graph can be complete, d+1 colours are
and number of multiples of 3=106 and necessary for graph containing vertices with
number of numbers which are multiples of degree at most ‘d’. So, the required answer is
both 7 and 3 = 15 Thus, P (selecting either a 24.
multiple of 7 or a multiple of 3) =
45
+
106
–
15
=
136
=
2
= 0.425 or 3. Triangle free graphs have the property of
320 320 320 320 5
clique number is __________
42.5%.
a) less than 2
b) equal to 2
c) greater than 3
d) more than 10
UNIT III GRAPHS Answer: d
Explanation: In an undirected triangle-free
TOPIC 3.1 GRAPHS AND graph no three vertices can form a triangle of
GRAPH MODELS edges. It can be described as graphs with
clique number less than 2 and the graphs with
girth greater than 4.
1. In a 7-node directed cyclic graph, the
number of Hamiltonian cycle is to be ______ 4. Berge graph is similar to ______ due to
a) 728 strong perfect graph theorem.
b) 450 a) line graph
c) 360 b) perfect graph
d) 260 c) bar graph
d) triangle free graph
Answer: c
Explanation: A Hamiltonian cycle in a Answer: b
connected graph G is defined as a closed path Explanation: In a perfect graph, the
that traverses every vertex of G exactly once chromatic number of each and every induced
except the starting vertex, at which the path subgraph is equal to the size of the largest
also terminates. In an n-complete graph, there clique of that subgraph. These perfect graphs
are (n-1)!/2 hamiltonian cycles and so the are same as Berge graphs due to strong
answer is 360. perfect graph theorem.
2. If each and every vertex in G has degree at 5. Let D be a simple graph on 10 vertices
most 23 then G can have a vertex colouring such that there is a vertex of degree 1, a
of __________ vertex of degree 2, a vertex of degree 3, a
a) 24 vertex of degree 4, a vertex of degree 5, a
b) 23 vertex of degree 6, a vertex of degree 7, a
c) 176 vertex of degree 8 and a vertex of degree 9.
d) 54 What can be the degree of the last vertex?
a) 4
b) 0

c) 2 c) 17/54
d) 5 d) 17/53
Answer: c Answer: b
Explanation: We know that sum of degrees Explanation: Here we are given a forest with
of all vertices = 2X no of edges. Say number 54 vertices and 17 components. A component
of edges is E. Degree of last vertex is x, is itself a tree and since there are 17
1+2+3+4+5+6+7++8+9+x = 2XE components means that every component has
=>45+x = 2XE a root, therefore we have 17 roots. Each new
Now putting options we get answer 0 or 5 vertex of the forest contributes to a single
But one vertex of degree 9 means it edge to a forest. So for remaining 54-17 = 37
connected to all other vertexes. So, the degree vertices we can have m-n=37 edges. Hence,
must be 5. answer is 37.
6. A ______ is a graph which has the same 9. The number of edges in a regular graph of
number of edges as its complement must have degree 46 and 8 vertices is ____________
number of vertices congruent to 4m or 4m a) 347
modulo 4(for integral values of number of b) 230
edges). c) 184
a) Subgraph d) 186
b) Hamiltonian graph
c) Euler graph Answer: c
d) Self complementary graph Explanation: In a complete graph which is
(n-1) regular (where n is the number of
Answer: d vertices) has edges n*(n-1)/2. In the graph n
Explanation: It is the definition of self vertices are adjacent to n-1 vertices and an
complementary graph. It is a graph that is edge contributes two degree so dividing by 2.
isomorphic to its complement. Hence, in a d regular graph number of edges
will be n*d/2 = 46*8/2 = 184.
7. In a ______ the vertex set and the edge set
are finite sets. 10. An undirected graph G has bit strings of
a) finite graph length 100 in its vertices and there is an edge
b) bipartite graph between vertex u and vertex v if and only if u
c) infinite graph and v differ in exactly one bit position.
d) connected graph Determine the ratio of the chromatic number
of G to the diameter of G?
Answer: b a) 1/2101
Explanation: In graph theory, most common b) 1/50
graphs are considered to be finite otherwise it c) 1/100
is an infinite graph. Now, a finite graph is a d) 1/20
graph in which the vertex set and the edge set
are described as the finite sets. Answer: b
Explanation: For the given condition we can
8. If G is the forest with 54 vertices and 17 simply design a K-Map and mark an edge
connected components, G has _______ total between every two adjacent cells in K-map.
number of edges. Hence, that will give us a Bipartite graph and
a) 38 chromatic number for this = 2. Hence the
b) 37

ratio is 2/n=2/100=1/50 and the given graph Answer: d

is actually a hypercube graph. Explanation: In an undirected triangle-free
graph no three vertices can form a triangle of
edges. It can be described as graphs with
TOPIC 3.2 GRAPH clique number less than 2 and the graphs with
TERMINOLOGY girth greater than 4.
1. In a 7-node directed cyclic graph, the 4. Berge graph is similar to ______ due to
number of Hamiltonian cycle is to be ______ strong perfect graph theorem.
a) 728 a) line graph
b) 450 b) perfect graph
c) 360 c) bar graph
d) 260 d) triangle free graph
Answer: c Answer: b
Explanation: A Hamiltonian cycle in a Explanation: In a perfect graph, the
connected graph G is defined as a closed path chromatic number of each and every induced
that traverses every vertex of G exactly once subgraph is equal to the size of the largest
except the starting vertex, at which the path clique of that subgraph. These perfect graphs
also terminates. In an n-complete graph, there are same as Berge graphs due to strong
are (n-1)!/2 hamiltonian cycles and so the perfect graph theorem.
answer is 360.
5. Let D be a simple graph on 10 vertices
2. If each and every vertex in G has degree at such that there is a vertex of degree 1, a
most 23 then G can have a vertex colouring vertex of degree 2, a vertex of degree 3, a
of __________ vertex of degree 4, a vertex of degree 5, a
a) 24 vertex of degree 6, a vertex of degree 7, a
b) 23 vertex of degree 8 and a vertex of degree 9.
c) 176 What can be the degree of the last vertex?
d) 54 a) 4
b) 0
Answer: a c) 2
Explanation: A vertex colouring of a graph d) 5
G = (V’,E’) with m colours is a mapping f:V’
-> {1,…,m} such that f(u)!=f(v) for every Answer: c
(u,v) belongs to E’. Since in worst case the Explanation: We know that sum of degrees
graph can be complete, d+1 colours are of all vertices = 2X no of edges. Say number
necessary for graph containing vertices with of edges is E. Degree of last vertex is x,
degree at most ‘d’. So, the required answer is 1+2+3+4+5+6+7++8+9+x = 2XE
24. =>45+x = 2XE
Now putting options we get answer 0 or 5
3. Triangle free graphs have the property of But one vertex of degree 9 means it
clique number is __________ connected to all other vertexes. So, the degree
a) less than 2 must be 5.
b) equal to 2
c) greater than 3 6. A ______ is a graph which has the same
d) more than 10 number of edges as its complement must have
number of vertices congruent to 4m or 4m

modulo 4(for integral values of number of b) 230

edges). c) 184
a) Subgraph d) 186
b) Hamiltonian graph
c) Euler graph Answer: c
d) Self complementary graph Explanation: In a complete graph which is
(n-1) regular (where n is the number of
Answer: d vertices) has edges n*(n-1)/2. In the graph n
Explanation: It is the definition of self vertices are adjacent to n-1 vertices and an
complementary graph. It is a graph that is edge contributes two degree so dividing by 2.
isomorphic to its complement. Hence, in a d regular graph number of edges
will be n*d/2 = 46*8/2 = 184.
7. In a ______ the vertex set and the edge set
are finite sets. 10. An undirected graph G has bit strings of
a) finite graph length 100 in its vertices and there is an edge
b) bipartite graph between vertex u and vertex v if and only if u
c) infinite graph and v differ in exactly one bit position.
d) connected graph Determine the ratio of the chromatic number
of G to the diameter of G?
Answer: b a) 1/2101
Explanation: In graph theory, most common b) 1/50
graphs are considered to be finite otherwise it c) 1/100
is an infinite graph. Now, a finite graph is a d) 1/20
graph in which the vertex set and the edge set
are described as the finite sets. Answer: b
Explanation: For the given condition we can
8. If G is the forest with 54 vertices and 17 simply design a K-Map and mark an edge
connected components, G has _______ total between every two adjacent cells in K-map.
number of edges. Hence, that will give us a Bipartite graph and
a) 38 chromatic number for this = 2. Hence the
b) 37 ratio is 2/n=2/100=1/50 and the given graph
c) 17/54 is actually a hypercube graph.
d) 17/53
Answer: b TOPIC 3.3 SPECIAL TYPES OF

Explanation: Here we are given a forest with GRAPHS
54 vertices and 17 components. A component
is itself a tree and since there are 17
1. A bridge can not be a part of _______
components means that every component has
a) a simple cycle
a root, therefore we have 17 roots. Each new
b) a tree
vertex of the forest contributes to a single
c) a clique with size ≥ 3 whose every edge is
edge to a forest. So for remaining 54-17 = 37
a bridge
vertices we can have m-n=37 edges. Hence,
d) a graph which contains cycles
answer is 37.
Answer: a
9. The number of edges in a regular graph of
Explanation: In a connected graph, a bridge
degree 46 and 8 vertices is ____________
is an edge whose removal disconnects the
a) 347
graph. In a cycle if we remove an edge, it will

still be connected. So, bridge cannot be part 4. Let G be a directed graph whose vertex set
of a cycle. A clique is any complete subgraph is the set of numbers from 1 to 50. There is an
of a graph. edge from a vertex i to a vertex j if and only if
either j = i + 1 or j = 3i. Calculate the
2. Any subset of edges that connects all the minimum number of edges in a path in G
vertices and has minimum total weight, if all from vertex 1 to vertex 50.
the edge weights of an undirected graph are a) 98
positive is called _______ b) 13
a) subgraph c) 6
b) tree d) 34
c) hamiltonian cycle
d) grid Answer: c
Explanation: Edge set consists of edges from
Answer: b i to j using either 1) j = i+1 OR 2) j=3i. The
Explanation: If all the edge weights of an trick to solving this question is to think in a
undirected graph are positive, any subset of reverse way. Instead of finding a path from 1
edges that connects all the vertices and has to 50, try to find a path from 100 to 1. The
minimum total weight is termed as a tree. In edge sequence with the minimum number of
this case, we need to have a minimum edges is 1 – 3 – 9 – 10 – 11 – 33 which
spanning tree need to be exact. consists of 6 edges.
3. G is a simple undirected graph and some 5. What is the number of vertices in an

vertices of G are of odd degree. Add a node n undirected connected graph with 39 edges, 7
to G and make it adjacent to each odd degree vertices of degree 2, 2 vertices of degree 5
vertex of G. The resultant graph is ______ and remaining of degree 6?
a) Complete bipartite graph a) 11
b) Hamiltonian cycle b) 14
c) Regular graph c) 18
d) Euler graph d) 19
Answer: d Answer: c
Explanation: In any simple undirected graph, Explanation: We know that, sum of degree of
total degree of all vertices is even (since each all the vertices = 2 * number of edges
edge contributes 2 degrees). So number of 2*7 + 5*2 + 6*x = 39*2
vertices having odd degrees must be even, x=9
otherwise, their sum would have been odd, Number of vertices = 7 + 2 + 9 = 18.
making total degree also odd. Now single
vertex n is connected to all these even number 6. ______ is the maximum number of edges
of vertices (which have odd degrees). So, in an acyclic undirected graph with k vertices.
degree of n is also even. Moreover, now a) k-1
degree of all vertices which are connected to b) k2
v is increased by 1, hence earlier vertices c) 2k+3
which had odd degree now have even degree. d) k3+4
So now, all vertices in the graph have even
degree, which is necessary and sufficient Answer: a
condition for euler graph. Explanation: This is possible with spanning
trees since, a spanning tree with k nodes has k
– 1 edges.

7. The minimum number of edges in a vertices in a component as in a star and all

connected cyclic graph on n vertices is other vertices outside this component being
_____________ isolated. Now, removing the considered
a) n – 1 vertex makes all other (v-1) vertices isolated
b) n making (v-1) components.
c) 2n+3
d) n+1 10. The 2n vertices of a graph G corresponds
to all subsets of a set of size n, for n>=4. Two
Answer: b vertices of G are adjacent if and only if the
Explanation: For making a cyclic graph, the corresponding sets intersect in exactly two
minimum number of edges have to be equal elements.
to the number of vertices. SO, the answer The number of connected components in G
should be n minimum edges. can be ___________
a) n+2
8. The maximum number of edges in a 8-
b) 3n/2
node undirected graph without self loops is
____________ c) n2
a) 45 d) 2n
b) 61
c) 28 Answer: b
d) 17 Explanation: n+1(subsets of size < 2 are all
disconnected) (subsets of size >= 2 are all
Answer: c connected)+1(subset of size >= 2 are all
Explanation: In a graph of n vertices we can connected)=n+2 is the number of connected
draw an edge from a vertex to n-1 vertex we components in G.
will do it for n vertices and so total number of
edges is n*(n-1). Now each edge is counted To practice Tricky questions and answers on
twice so the required maximum number of all areas of Discrete Mathematics, here is
edges is n*(n-1)/2. Hence, 8*(8-1)/2 = 28 complete set of 1000+ Multiple Choice
edges. Questions and Answers.
9. Let G be an arbitrary graph with v nodes

and k components. If a vertex is removed
TOPIC 3.4 MATRIX
from G, the number of components in the REPRESENTATION OF GRAPHS
resultant graph must necessarily lie down AND GRAPH ISOMORPHISM
between _____ and _____
a) n-1 and n+1 1. A graph which has the same number of
b) v and k edges as its complement must have number of
c) k+1 and v-k vertices congruent to ______ or _______
d) k-1 and v-1 modulo 4(for integral values of number of
edges).
Answer: d a) 6k, 6k-1
Explanation: If a vertex is removed from the b) 4k, 4k+1
graph, lower bound: number of components c) k, k+2
decreased by one = k-1 (remove an isolated d) 2k+1, k
vertex which was a component) and upper
bound: number of components = v-1 Answer: c
(consider a vertex connected to all other Explanation: By using invariant of

isomorphism and property of edges of graph (n−1)/2) – n. To be isomorphism, both graphs

and its complement, we have: a) number of should have equal number of edges. This
edges of isomorphic graphs must be the same. gives, (n*(n-1)/2) – n = n
b) number of edge of a graph + number of ⇒n=5
edges of complementary graph = Number of
edges in Kn(complete graph), where n is the 4. How many perfect matchings are there in a
number of vertices in each of the 2 graphs complete graph of 10 vertices?
which will be the same. So we know number a) 60
of edges in Kn = n(n-1)/2. So number of b) 945
c) 756
edges of each of the above 2 graph(a graph
d) 127
and its complement) = n(n-1)/4. So this
means the number of vertices in each of the 2 Answer: b
graphs should be of the form “4x” or “4x+1” Explanation: Perfect matching is a set of
for integral value of number of edges which is edges such that each vertex appears only once
necessary. Hence the required answer is 4x or
and all vertices appear at least once (exactly
4x+1 so that on doing modulo we get 0 which
one appearance). So for n vertices perfect
is the definition of congruence.
matching will have n/2 edges and there won’t
be any perfect matching if n is odd. For n=10,
2. Every Isomorphic graph must have
________ representation. we can choose the first edge in 10C2 = 45
a) cyclic ways, second in 8C2=28 ways, third in
b) adjacency list 6C
c) tree 2=15
ways and so on. So, the total number
d) adjacency matrix of ways 45*28*15*6*1=113400. But perfect
matching being a set, order of elements is not
Answer: d important and the permutations 5! of the 5
Explanation: A graph can exist in different edges are same only. So, total number of
forms having the same number of vertices, perfect matching is 113400/5! = 945.
edges and also the same edge connectivity,
such graphs are called isomorphic graphs. 5. A graph G has the degree of each vertex is
Two graphs G1 and G2 are said to be ≥ 3 say, deg(V) ≥ 3 ∀ V ∈ G such that 3|V| ≤
isomorphic if −> 1) their number of 2|E| and 3|R| ≤ 2|E|, then the graph is said to
components (vertices and edges) are same be ________ (R denotes region in the graph)
and 2) their edge connectivity is retained. a) Planner graph
Isomorphic graphs must have adjacency b) Polyhedral graph
matrix representation. c) Homomorphic graph
d) Isomorphic graph
3. A cycle on n vertices is isomorphic to its
complement. What is the value of n? Answer: b
a) 5 Explanation: A simple connected planar
b) 32 graph is called a polyhedral graph if the
c) 17 degree of each vertex is(V) ≥ 3 such that
d) 8 deg(V) ≥ 3 ∀ V ∈ G and two conditions must
satisfy i) 3|V| ≤ 2|E| and ii) 3|R| ≤ 2|E|.
Answer: a
Explanation: A cycle with n vertices has n 6. A complete n-node graph Kn is planar if
edges. Number of edges in cycle = n and and only if _____________
number of edges in its complement = (n*

a) n ≥ 6 9. What is the grade of a planar graph

b) n2 = n + 1 consisting of 8 vertices and 15 edges?
c) n ≤ 4 a) 30
d) n + 3 b) 15
c) 45
Answer: c d) 106
Explanation: Any graph with 4 or less
vertices is planar, any graph with 8 or less Answer: a
edges is planar and a complete n-node graph Explanation: If G is a planar graph with n
Kn is planar if and only if n ≤ 4. vertices and m edges then r(G) = 2m i.e. the
grade or rank of G is equal to the twofold of
7. A graph is ______ if and only if it does not the number of edges in G. So, the rank of the
contain a subgraph homeomorphic to k5 or graph is 2*15=30 having 8 vertices and 15
edges.
k3,3.
a) bipartite graph 10. A _______ is a graph with no
b) planar graph homomorphism to any proper subgraph.
c) line graph a) poset
d) euler subgraph b) core
c) walk
Answer: b d) trail
Explanation: A graph is known as planar
graph if and only if it does not contain a Answer: b
subgraph homeomorphic to k5 or k3,3. Explanation: A core can be defined as a
graph that does not retract to any proper
8. An isomorphism of graphs G and H is a subgraph. Every graph G is homomorphically
bijection f the vertex sets of G and H. Such equivalent to a unique core called the core of
that any two vertices u and v of G are G.
adjacent in G if and only if ____________
a) f(u) and f(v) are contained in G but not To practice all written questions on Discrete
contained in H Mathematics, here is complete set of 1000+
b) f(u) and f(v) are adjacent in H Multiple Choice Questions and Answers.
c) f(u * v) = f(u) + f(v)
d) f(u) = f(u)2 + f(v)2 TOPIC 3.5 CONNECTIVITY -
Answer: b
EULER AND HAMILTON PATHS
Explanation: Two graphs G and H are said to
be isomorphic to each other if there exist a 1. Which of the following algorithm can be
one to one correspondence, say f between the used to solve the Hamiltonian path problem
vertex sets V(G) and V(H) and a one to one efficiently?
correspondence g between the edge sets E(G) a) branch and bound
and E(H) with the following conditions:- b) iterative improvement
(i) for every vertex u in G, there exists a c) divide and conquer
vertex u’ in H such that u’=f(u) and vice d) greedy algorithm
versa.
(ii) for every edge uv in G, Answer: a
g(uv)=f(u)*f(v)=u’v’ is H. Explanation: The Hamiltonian path problem
can be solved efficiently using branch and

bound approach. It can also be solved using a Answer: c

backtracking approach. Explanation: Hamiltonian path problem is
similar to that of a travelling salesman
2. The problem of finding a path in a graph problem since both the problem traverses all
that visits every vertex exactly once is called? the nodes in a graph exactly once.
a) Hamiltonian path problem
b) Hamiltonian cycle problem 6. Who formulated the first ever algorithm for
c) Subset sum problem solving the Hamiltonian path problem?
d) Turnpike reconstruction problem a) Martello
b) Monte Carlo
Answer: a c) Leonard
Explanation: Hamiltonian path problem is a d) Bellman
problem of finding a path in a graph that
visits every node exactly once whereas Answer: a
Hamiltonian cycle problem is finding a cycle Explanation: The first ever problem to solve
in a graph. the Hamiltonian path was the enumerative
algorithm formulated by Martello.
3. Hamiltonian path problem is _________
a) NP problem 7. In what time can the Hamiltonian path
b) N class problem problem can be solved using dynamic
c) P class problem programming?
d) NP complete problem a) O(N)
b) O(N log N)
Answer: d c) O(N2)
Explanation: Hamiltonian path problem is
d) O(N2 2N)
found to be NP complete. Hamiltonian cycle
problem is also an NP- complete problem.
Answer: d
Explanation: Using dynamic programming,
4. There is no existing relationship between a
the time taken to solve the Hamiltonian path
Hamiltonian path problem and Hamiltonian
circuit problem. problem is mathematically found to be O(N2
a) true 2N).
b) false
8. In graphs, in which all vertices have an odd
Answer: b degree, the number of Hamiltonian cycles
Explanation: There is a relationship between through any fixed edge is always even.
Hamiltonian path problem and Hamiltonian a) true
circuit problem. The Hamiltonian path in b) false
graph G is equal to Hamiltonian cycle in
graph H under certain conditions. Answer: a
Explanation: According to a handshaking
5. Which of the following problems is similar lemma, in graphs, in which all vertices have
to that of a Hamiltonian path problem? an odd degree, the number of Hamiltonian
a) knapsack problem cycles through any fixed edge is always even.
b) closest pair problem
c) travelling salesman problem 9. Who invented the inclusion-exclusion
d) assignment problem principle to solve the Hamiltonian path
problem?

a) Karp a) 1
b) Leonard Adleman b) 2
c) Andreas Bjorklund c) 3
d) Martello d) 4
Answer: c Answer: a
Explanation: Andreas Bjorklund came up Explanation: The above graph has only one
with the inclusion-exclusion principle to Hamiltonian path that is from a-b-c-d-e.
reduce the counting of number of
Hamiltonian cycles. 13. How many Hamiltonian paths does the
following graph have?
10. For a graph of degree three, in what time
can a Hamiltonian path be found?
a) O(0.251n)
b) O(0.401n)
c) O(0.167n)
d) O(0.151n)
Answer: a a) 1
Explanation: For a graph of maximum b) 2
degree three, a Hamiltonian path can be found c) 0
in time O(0.251n). d) 3
11. What is the time complexity for finding a Answer: c
Hamiltonian path for a graph having N Explanation: The above graph has no
vertices (using permutation)? Hamiltonian paths. That is, we cannot
a) O(N!) traverse the graph with meeting vertices
b) O(N! * N) exactly once.
c) O(log N)
d) O(N)
Answer: b
Explanation: For a graph having N vertices UNIT IV ALGEBRAIC
traverse the permutations in N! iterations and
it traverses the permutations to see if adjacent STRUCTURES
vertices are connected or not takes N
iterations (i.e.) O(N! * N). TOPIC 4.1 ALGEBRAIC
12. How many Hamiltonian paths does the SYSTEMS
following graph have?
1. Let C and D be two sets then which of the
following statements are true?
i) C U D = D U C
ii) C ∩ D = D ∩ C

a) Both of the statements Answer: d

b) Only i statement Explanation: (A U B)’ = A’ ∩ B’.
c) Only ii statement
d) None of the statements 6. Let C = {1,2,3,4} and D = {1, 2, 3, 4} then
which of the following hold not true in this
Answer: a case?
Explanation: Commutative laws hold good a) C – D = D – C
in sets. b) C U D = C ∩ D
c) C ∩ D = C – D
2. If set C is {1, 2, 3, 4} and C – D = Φ then d) C – D = Φ
set D can be ___________
a) {1, 2, 4, 5} Answer: c
b) {1, 2, 3} Explanation: C ∩ D = {1, 2, 3, 4} ≠ Φ.
c) {1, 2, 3, 4, 5}
d) None of the mentioned 7. If C’ U (D ∩ E’) is equivalent to
__________
Answer: c a) (C ∩ (D U E))’
Explanation: C ∩ D should be equivalent to b) (C ∩( D∩ E’))’
C for C – D = Φ. c) (C ∩( D’ U E))’
d) (C U ( D ∩ E’)’
3. Let C and D be two sets then C – D is
equivalent to __________ Answer: c
a) C’ ∩ D Explanation: (C’)’≡ C, (C∩ D)’ ≡ C’ U D’.
b) C‘∩ D’
c) C ∩ D’ 8. Let Universal set U is {1, 2, 3, 4, 5, 6, 7,
d) None of the mentioned 8}, (Complement of A) A’ is {2, 5, 6, 7}, A ∩
B is {1, 3, 4} then the set B’ will surely have
Answer: c of which of the element?
Explanation: Set C-D will be having those a) 8
elements which are in C but not in D. b) 7
c) 1
4. For two sets C and D the set (C – D) ∩ D d) 3
will be __________
a) C Answer: a
b) D Explanation: The set A is {1,3,4,8} and thus
c) Φ surely B does not have 8 in it. Since 8 does
d) None of the mentioned not belong to A ∩ B. For other element like 7
we can’t be sure.
Answer: c
Explanation: C-D ≡ C ∩ D’, D ∩ D’ ≡ Φ. 9. Let a set be A then A ∩ φ and A U φ are
__________
5. Which of the following statement a) φ, φ
regarding sets is false? b) φ, A
a) A ∩ A = A c) A, φ
b) A U A = A d)None of the mentioned
c) A – (B ∩ C) = (A – B) U (A –C)
d) (A U B)’ = A’ U B’ Answer: b
Explanation: By Domination Laws on sets.

10. If in sets A, B, C, the set B ∩ C consists Answer: b

of 8 elements, set A ∩ B consists of 7 Explanation: For any three
elements and set C ∩ A consists of 7 elements(numbers) a, b and c associative
elements then the minimum element in set A property describes a × ( b × c ) = ( a × b ) × c
U B U C will be? [for multiplication]. Hence associative
a) 8 property is true for multiplication and it is
b) 14 true for multiplication also.
c) 22
d) 15 3. B1: ({0, 1, 2….(n-1)}, xm) where xn stands
for “multiplication-modulo-n” and B2: ({0, 1,
Answer: a
2….n}, xn) where xn stands for
Explanation: For minimum elements set B
and C have 8 elements each and all of the “multiplication-modulo-m” are the two
elements are same, Also set A should have 7 statements. Both B1 and B2 are considered to
elements which are already present in B and be __________
C. Thus A U B U C ≡ A ≡ B. a) groups
b) semigroups
To practice all areas of Discrete Mathematics c) subgroups
for tests, here is complete set of 1000+ d) associative subgroup
Multiple Choice Questions and Answers.
Answer: b
Explanation: Here, B1 is the group and
TOPIC 4.2 SEMI GROUPS AND
identity element is 0, means for all a∈B1,
MONOIDS
a+n.0=a. As a<n. But in B2 identity element
does not exist. Here, 0 can not be the identity
1. Let (A7, ⊗7)=({1, 2, 3, 4, 5, 6}, ⊗7) is a
element. For example, for one of the member
group. It has two sub groups X and Y. X={1, n of the set we have n+n.0=0, It will be n. So,
3, 6}, Y={2, 3, 5}. What is the order of union B2 is not a group. Both B1 and B2 are
of subgroups?
semigroups as they satisfy closure and
a) 65
associativity property.
b) 5
c) 32 4. If group G has 65 elements and it has two
d) 18 subgroups namely K and L with order 14 and
30. What can be order of K intersection L?
Answer: b
a) 10
Explanation: Given, (A7, ⊗7)=({1, 2, 3, 4, 5,
b) 42
6}, ⊗7) and the union of two sub groups X c) 5
and Y, X={1, 3, 6} Y={2, 3, 5} is X∪Y={1, d) 35
2, 3, 5, 6} i.e., 5. Here, the order of the union
can not be divided by order of the group. Answer: c
Explanation: As it is an intersection so the
2. A relation (34 × 78) × 57 = 57 × (78 × 34) order must divide both K and L. Here 3, 6, 30
can have __________ property. does not divide 14. But 5 must be the order of
a) distributive the group as it divides the order of
b) associative intersection of K and L as well as the order of
c) commutative the group.
d) closure

5. Consider the binary operations on X, a*b = c) multiplicity, associativity and closure

a+b+4, for a, b ∈ X. It satisfies the properties d) inverse and closure
of _______
a) abelian group Answer: b
b) semigroup Explanation: Closure for all a, b∈G, the
c) multiplicative group result of the operation, a+b, is also in G.
d) isomorphic group Since there is one element, hence a=b=0, and
a+b=0+0=0∈G. Hence, closure property is
Answer: a satisfied. Associative for all a, b, c∈G,
Explanation: Since * closed operation, a*b (a+b)+c=a+(b+c). For example, a=b=c=0.
belongs to X. Hence, it is an abelian group. Hence (a+b)+c=a+(b+c)
⟹(0+0)+0=0+(0+0)⟹0=0. Hence,
6. Let * be the binary operation on the
associativity property is satisfied. Suppose for
rational number given by a*b=a+b+ab.
an element e∈G such that, there exists an
Which of the following property does not
element a∈G and so the equation e+a=a+e=a
exist for the group?
a) closure property holds. Such an element is unique, the identity
b) identity property element property is satisfied. For example,
c) symmetric property a=e=0. Hence e+a = a+e⟹0+0=0+0⟹0=a.
d) associative property Hence e=0 is the identity element. For each
a∈G, there exists an element b∈G (denoted as
Answer: b a-1), such that a+b=b+a=e, where e is the
Explanation: For identity e, a+e=e+a=e, a*e identity element. The inverse element is 0 as
= a+e+ae = a => e=0 and e+a = e+a+ea = a the addition of 0 with 0 will be 0, which is
=> e=0. So e=0 will be identity, for e to be also an identity element of the structure.
identity, a*e = a ⇒ a+e+ae = a ⇒ e+ae = 0
and e(1+a) = 0 which gives e=0 or a=-1. So, 9. If (M, *) is a cyclic group of order 73, then
when a = -1, no identity element exist as e number of generator of G is equal to ______
can be any value in that case. a) 89
b) 23
7. Let G be a finite group with two sub c) 72
groups M & N such that |M|=56 and |N|=123. d) 17
Determine the value of |M⋂N|.
a) 1 Answer: c
b) 56 Explanation: We need to find the number of
c) 14 co-primes of 73 which are less than 73. As 73
d) 78 itself is a prime, all the numbers less than that
are co-prime to it and it makes a group of
Answer: a order 72 then it can be of {1, 3, 5, 7, 11….}.
Explanation: We know that gcd(56, 123)=1.
So, the value of |M⋂N|=1. 10. The set of even natural numbers, {6, 8,
10, 12,..,} is closed under addition operation.
8. A group G, ({0}, +) under addition Which of the following properties will it
operation satisfies which of the following satisfy?
properties? a) closure property
a) identity, multiplicity and inverse b) associative property
b) closure, associativity, inverse and identity c) symmetric property
d) identity property

Answer: a such that (a*e) = (e*a) = a for all a in S. This

Explanation: The set of even natural element is called identity element of S w.r.t *.
numbers is closed by the addition as the sum
of any two of them produces another even 4. A monoid is called a group if _______
number. Hence, this closed set satisfies the a) (a*a)=a=(a+c)
closure property. b) (a*c)=(a+c)
c) (a+c)=a
d) (a*c)=(c*a)=e
TOPIC 4.3 GROUPS
Answer: d
1. A non empty set A is termed as an Explanation: A monoid(B,*) is called Group
algebraic structure ________ if to each element there exists an element c
a) with respect to binary operation * such that (a*c)=(c*a)=e. Here e is called an
b) with respect to ternary operation ? identity element and c is defined as the
c) with respect to binary operation + inverse of the corresponding element.
d) with respect to unary operation –
5. A group (M,*) is said to be abelian if
Answer: a ___________
Explanation: A non empty set A is called an a) (x+y)=(y+x)
algebraic structure w.r.t binary operation “*” b) (x*y)=(y*x)
if (a*b) belongs to S for all (a*b) belongs to c) (x+y)=x
S. Therefore “*” is closure operation on ‘A’. d) (y*x)=(x+y)
2. An algebraic structure _________ is called Answer: b

a semigroup. Explanation: A group (M,*) is said to be
a) (P, *) abelian if (x*y) = (x*y) for all x, y belongs to
b) (Q, +, *) M. Thus Commutative property should hold
c) (P, +) in a group.
d) (+, *)
6. Matrix multiplication is a/an _________
Answer: a property.
Explanation: An algebraic structure (P,*) is a) Commutative
called a semigroup if a*(b*c) = (a*b)*c for all b) Associative
a,b,c belongs to S or the elements follow c) Additive
associative property under “*”. (Matrix,*) d) Disjunctive
and (Set of integers,+) are examples of
semigroup. Answer: b
Explanation: The set of two M*M non-
3. Condition for monoid is __________ singular matrices form a group under matrix
a) (a+e)=a multiplication operation. Since matrix
b) (a*e)=(a+e) multiplication is itself associative, it holds
c) a=(a*(a+e) associative property.
d) (a*e)=(e*a)=a
7. A cyclic group can be generated by a/an
Answer: d ________ element.
Explanation: A Semigroup (S,*) is defined a) singular
as a monoid if there exists an element e in S b) non-singular

c) inverse covers all the elements of this group. Hence,

d) multiplicative it is a cyclic group.
Answer: a
Explanation: A singular element can TOPIC 4.4 SUBGROUPS
generate a cyclic group. Every element of a
cyclic group is a power of some specific 1. A trivial subgroup consists of
element which is known as a generator ‘g’. ___________
a) Identity element
8. How many properties can be held by a b) Coset
group? c) Inverse element
a) 2 d) Ring
b) 3
c) 5 Answer: a
d) 4 Explanation: Let G be a group under a binary
operation * and a subset H of G is called a
Answer: c subgroup of G if H forms a group under the
Explanation: A group holds five properties operation *. The trivial subgroup of any
simultaneously – group is the subgroup consisting of only the
i) Closure Identity element.
ii) associative
iii) Commutative 2. Minimum subgroup of a group is called
iv) Identity element _____________
v) Inverse element. a) a commutative subgroup
b) a lattice
9. A cyclic group is always _________ c) a trivial group
a) abelian group d) a monoid
b) monoid
c) semigroup Answer: c
d) subgroup Explanation: The subgroups of any given
group form a complete lattice under inclusion
Answer: a termed as a lattice of subgroups. If o is the
Explanation: A cyclic group is always an Identity element of a group(G), then the
abelian group but every abelian group is not a trivial group(o) is the minimum subgroup of
cyclic group. For instance, the rational that group and G is the maximum subgroup.
numbers under addition is an abelian group
but is not a cyclic one. 3. Let K be a group with 8 elements. Let H be
a subgroup of K and H<K. It is known that
10. {1, i, -i, -1} is __________ the size of H is at least 3. The size of H is
a) semigroup __________
b) subgroup a) 8
c) cyclic group b) 2
d) abelian group c) 3
d) 4
Answer: c
Explanation: The set of complex numbers Answer: d
{1, i, -i, -1} under multiplication operation is Explanation: For any finite group G, the
a cyclic group. Two generators i and -i will order (number of elements) of every subgroup

L of G divides the order of G. G has 8 7. The group of matrices with determinant

elements. Factors of 8 are 1, 2, 4 and 8. Since _________ is a subgroup of the group of
given the size of L is at least 3(1 and 2 invertible matrices under multiplication.
eliminated) and not equal to G(8 eliminated), a) 2
the only size left is 4. Size of L is 4. b) 3
c) 1
4. __________ is not necessarily a property d) 4
of a Group.
a) Commutativity Answer: c
b) Existence of inverse for every element Explanation: The group of real matrices with
c) Existence of Identity determinant 1 is a subgroup of the group of
d) Associativity invertible real matrices, both equipped with
matrix multiplication. It has to be shown that
Answer: a the product of two matrices with determinant
Explanation: Grupoid has closure property; 1 is another matrix with determinant 1, but
semigroup has closure and associative; this is immediate from the multiplicative
monoid has closure, associative and identity property of the determinant. This group is
property; group has closure, associative, usually denoted by(n, R).
identity and inverse; the abelian group has
group property and commutative. 8. What is a circle group?
a) a subgroup complex numbers having
5. A group of rational numbers is an example magnitude 1 of the group of nonzero complex
of __________ elements
a) a subgroup of a group of integers b) a subgroup rational numbers having
b) a subgroup of a group of real numbers magnitude 2 of the group of real elements
c) a subgroup of a group of irrational numbers c) a subgroup irrational numbers having
d) a subgroup of a group of complex numbers magnitude 2 of the group of nonzero complex
elements
Answer: b d) a subgroup complex numbers having
Explanation: If we consider the abelian magnitude 1 of the group of whole numbers
group as a group rational numbers under
binary operation + then it is an example of a Answer: a
subgroup of a group of real numbers. Explanation: The set of complex numbers
with magnitude 1 is a subgroup of the
6. Intersection of subgroups is a nonzero complex numbers associated with
___________ multiplication. It is called the circle group as
a) group its elements form the unit circle.
b) subgroup
c) semigroup 9. A normal subgroup is ____________
d) cyclic group a) a subgroup under multiplication by the
elements of the group
Answer: b b) an invariant under closure by the elements
Explanation: The subgroup property is of that group
intersection closed. An arbitrary (nonempty) c) a monoid with same number of elements of
intersection of subgroups with this property, the original group
also attains the similar property. d) an invariant equipped with conjugation by
the elements of original group

Answer: d b) H is monoid of a group

Explanation: A normal subgroup is a c) H is a cyclic group
subgroup that is invariant under conjugation d) H is subgroup of an abelian group
by any element of the original group that is, K
is normal if and only if gKg-1=K for any g Answer: d
belongs to G Equivalently, a subgroup K of G Explanation: If h is the subgroup of an
is normal if and only if gK=Kg for any g abelian group G, then the set of left cosets of
belongs to G.Normal subgroups are useful in H in G is to be set of right cosets i.e, a * H =
constructing quotient groups and in analyzing H * a. Hence, subgroup is called the normal
homomorphisms. subgroup.
10. Two groups are isomorphic if and only if 3. Lagrange’s theorem specifies __________
__________ is existed between them. a) the order of semigroup is finite
a) homomorphism b) the order of the subgroup divides the order
b) endomorphism of the finite group
c) isomorphism c) the order of an abelian group is infinite
d) association d) the order of the semigroup is added to the
order of the group
Answer: c
Explanation: Two groups M and K are Answer: b
isomorphic (M ~= K) if and only if there Explanation: Lagrange’s theorem satisfies
exists an isomorphism between them. An that the order of the subgroup divides the
isomorphism f:M -> K between two groups order of the finite group.
M and K is a mapping which satisfies two
4. A function is defined by f(x)=2x and f(x +
conditions: 1) f is a bijection and 2) for every
y) = f(x) + f(y) is called _____________
x,y belongs to M, we have f(x*My) = f(x) *
a) isomorphic
Kf(y).
b) homomorphic
c) cyclic group
TOPIC 4.5 NORMAL SUBGROUP d) heteromorphic
AND COSETS, LAGRANGE‘S
Answer: a
THEOREM Explanation: Let (G,*) and (G’,+) are two
groups. The mapping f:G->G’ is said to be
1. a * H is a set of _____ coset. isomorphism if two conditions are satisfied 1)
a) right f is one-to-one function and onto function and
b) left 2) f satisfies homomorphism.
c) sub
d) semi 5. An isomorphism of a group onto itself is
called ____________
Answer: b a) homomorphism
Explanation: Let (H, *) be the semigroup of b) heteromorphism
the group (G, *). Let a belongs to G. (a * H) c) epimorphism
is the set of a left coset of H in G and (H * a) d) automorphism
be the set of a right coset of H in G.
Answer: d
2. a * H = H * a relation holds if __________ Explanation: An automorphism is defined as
a) H is semigroup of an abelian group an isomorphism of a group onto itself.

Similarly, the homomorphism of a group onto be non-singular (determinant !=0) for the
itself is defined as the endomorphism of the inverse to exist. Hence the set of all non-
group. singular matrices forms a group under
multiplication is a true option.
6. The elements of a vector space form a/an
____________ under vector addition. 9. How many different non-isomorphic
a) abelian group Abelian groups of order 8 are there?
b) commutative group a) 5
c) associative group b) 4
d) semigroup c) 2
d) 3
Answer: a
Explanation: An example of a coset is Answer: c
associated with the theory of vector spaces. Explanation: The number of Abelian groups
The elements (vectors) form an abelian group of order Pm (let, P is prime) is the number of
under the vector addition in a vector space.
partitions of m. Here order is 8 i.e. 23 and so
Subspaces of a vector space are subgroups of
partition of 3 are {1, 1} and {3, 0}. So
this group.
number of different abelian groups are 2.
7. A set of representatives of all the cosets is
10. Consider the set B* of all strings over the
called _________
alphabet set B = {0, 1} with the concatenation
a) transitive operator for strings ________
b) reversal
a) does not form a group
c) equivalent
b) does not have the right identity element
d) transversal
c) forms a non-commutative group
d) forms a group if the empty string is
Answer: d
removed from
Explanation: A coset representative is a
representative in the equivalence class. In all
Answer: a
cosets, a set of the representative is always
Explanation: Identity element for
transversal.
concatenation is an empty string. Now, we
cannot concatenate any string with a given
8. Which of the following statement is true?
a) The set of all rational negative numbers string to get empty string there is no inverse
forms a group under multiplication for string concatenation. Only other 3 group
b) The set of all matrices forms a group under properties such as closure, associative and
multiplication existence of identity are satisfied.
c) The set of all non-singular matrices forms a
group under multiplication TOPIC 4.6 DEFINITIONS AND
d) The set of matrices forms a subgroup under EXAMPLES OF RINGS AND
multiplication
FIELDS
Answer: c
Explanation: Since multiplication of two 1. GCD(a,b) = GCD(b,a mod b)
negative rational numbers gives a positive a) True
number. Hence, closure property is not b) False
satisfied. Singular matrices do not form a
group under multiplication. Matrices have to

Answer: a Answer: d
Explanation: The statement is true. For Explanation: A ring R denoted by {R, + , x}
example, GCD(55,22) = GCD(22,55 mod 22) is a set of elements with two binary
= GCD(22,11) = 11 operations addition and multiplication and
satisfy axioms G-i to R-iii.
Consider the Following properties Properties
G-i) Closure 5. A Ring is said to be commutative if it also
G-ii) Associative satisfies the property
G-iii) Identity Element a) R-vi
G-iv) Inverse Element b) R-v
G-v) Commutative c) R-vii
d) R-iv
Consider the Following properties Properties
R-i) Closure under multiplication Answer: d
R-ii) Associativity of multiplication Explanation: A Ring is said to be
R-iii) Distributive Law commutative if it also satisfies the property
R-iv) Commutativity of multiplication R-iv: Commutativity of multiplication.
R-v) Multiplicative Identity
R-vi) No zero divisors 6. An ‘Integral Domain’ satisfies the
R-vii) Multiplicative Inverse properties
a) G-i to G-iii
2. All groups satisfy properties b) G-i to R-v
a) G-i to G-v c) G-i to R-vi
b) G-i to G-iv d) G-i to R-iii
c) G-i to R-v
d) R-i to R-v Answer: c
Explanation:An ‘Integral Domain’ satisfies
Answer: b the properties G-i to R-vi.
Explanation: Group G denoted by {G,o}, is a
set of elements that satisfy the properties G-i 7. A Field satisfies all the properties above
to G-iv. from G-i to R-vi.
a) True
3. An Abelian Group satisfies the properties b) False
a) G-i to G-v
b) G-i to R-iv Answer: a
c) G-i to R-v Explanation: A Field satisfies all the
d) R-i to R-v properties above from G-i to R-vi and is
denoted by {F, +, x}.
Answer: a
Explanation: An Abelian group is a group 8. In modular arithmetic : (a/b) = b(a^-1)
that satisfies the Commutative property also. a) True
b) False
4. A Ring satisfies the properties
a) R-i to R-v Answer: b
b) G-i to G-iv Explanation: This statement is not true. The
c) G-i to R-v correct version would be : (a/b) = a(b-1).
d) G-i to R-iii

9. a.(b.c) = (a.b).c is the representation for aabaaa

which property? bbabab
a) G-ii
b) G-iii a) Yes
c) R-ii b) No
d) R-iii c) Can’t Say
d) Insufficient Data
Answer: a
Explanation: a.(b.c) = (a.b).c represents the Answer: a
Associative property. Explanation: S is a ring as it satisfies the
properties G-i to R-iii.
10. a(b+c) = ac+bc is the representation for
which property? 14. Does the set of residue classes (mod 3)
a) G-ii form a group with respect to modular
b) G-iii addition?
c) R-ii a) Yes
d) R-iii b) No
c) Can’t Say
Answer: d d) Insufficient Data
Explanation: a(b+c) = ac+bc represents the
Distributive Property. Answer: a
Explanation: Yes. The identity element is 0,
11. For the group Sn of all permutations of n and the inverses of 0, 1, 2 are respectively 0,
distinct symbols, what is the number of 2, 1.
elements in Sn?
a) n 15. Does the set of residue classes (mod 3)
b) n-1 form a group with respect to modular
c) 2n addition?
d) n! a) Yes
b) No
Answer: d c) Can’t Say
Explanation: There there are n distinct d) Insufficient Data
symbols there will be n! elements.
Answer: b
12. For the group Sn of all permutations of n Explanation: No. The identity element is 1,
distinct symbols, Sn is an abelian group for but 0 has no inverse.
all values of n.
a) True
b) False
Answer: b UNIT V LATTICES AND

Explanation: For n>2 it does not form a
Abelian Group. BOOLEAN ALGEBRA
13. Is S a ring from the following TOPIC 5.1 PARTIAL ORDERING
multiplication and addition tables?
+abxab
1. Let a set S = {2, 4, 8, 16, 32} and <= be the
partial order defined by S <= R if a divides b.

Number of edges in the Hasse diagram of is 3. If the longest chain in a partial order is of
______ length l, then the partial order can be written
a) 6 as _____ disjoint antichains.
b) 5 a) l2
c) 9 b) l+1
d) 4 c) l
Answer: b d) ll
Explanation: Hasse Diagram is:
Answer: c
32 Explanation: If the length of the longest
chain in a partial order is l, then the elements
/ in the POSET can be partitioned into l
disjoint antichains.
16
/ 4. Suppose X = {a, b, c, d} and π1 is the

partition of X, π1 = {{a, b, c}, d}. The
8
number of ordered pairs of the equivalence
/ \ relations induced by __________
a) 15
2 4 b) 10
c) 34
So, the number of edges should be: 4. d) 5
2. The less-than relation, <, on a set of real Answer: b
numbers is ______ Explanation: The ordered pairs of the
a) not a partial ordering because it is not equivalence relations induced = {(a,a), (a,b),
asymmetric and irreflexive equals (a,c), (b,a), (b,b), (b,c), (c,a), (c,b), (c,c),
antisymmetric (d,d)}. Poset -> equivalence relations = each
b) a partial ordering since it is asymmetric partition power set – Φ.
and reflexive
c) a partial ordering since it is antisymmetric 5. A partial order P is defined on the set of
and reflexive natural numbers as follows. Here a/b denotes
d) not a partial ordering because it is not integer division. i)(0, 0) ∊ P. ii)(a, b) ∊ P if
antisymmetric and reflexive and only if a % 10 ≤ b % 10 and (a/10, b/10)
∊ P. Consider the following ordered pairs:
Answer: a
Explanation: Relation less than a set of real i. (101, 22) ii. (22, 101) iii. (145, 265) iv. (0,
numbers is not antisymmetric and reflexive. 153)
Relation is not POSET because it is The ordered pairs of natural numbers are
irreflexive. Again, aRb != bRa unless a=b and contained in P are ______ and ______
a) (145, 265) and (0, 153)
so it is antisymmetric. A relation may be ‘not
b) (22, 101) and (0, 153)
asymmetric and not reflexive but still
c) (101, 22) and (145, 265)
antisymmetric, as {(1,1) (1,2)}. So, the
d) (101, 22) and (0, 153)
relation is not a partial ordering because it is
not asymmetric and irreflexive equals Answer: d
antisymmetric.
Explanation: For ordered pair (a, b), to be in
P, each digit in a starting from unit place must

not be larger than the corresponding digit in Answer: d

b. This condition is satisfied by options (iii) Explanation: A set is called lattice if every
(145, 265) => 5 ≤ 5, 4 < 6 and 1 < 2; (iv) (0, finite subset has a least upper bound and
153) => 0 < 3 and no need to examine further. greatest lower bound. It is termed as a
complete lattice if every subset has a least
6. The inclusion of ______ sets into R = {{1, upper bound and greatest lower bound. As
2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2, 3, 4, every subset of this will not have LUB and
5}} is necessary and sufficient to make R a GLB so (N,|) is a lattice but not a complete
complete lattice under the partial order lattice.
defined by set containment.
a) {1}, {2, 4} 8. Consider the set N* of finite sequences of
b) {1}, {1, 2, 3} natural numbers with a denoting that
c) {1} sequence a is a prefix of sequence b. Then,
d) {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5} which of the following is true?
a) Every non-empty subset of has a greatest
Answer: c lower bound
Explanation: A lattice is complete if every b) It is uncountable
subset of partial order set has a supremum c) Every non-empty finite subset of has a
and infimum element. For example, here we least upper bound
are given a partial order set R. Now it will be d) Every non-empty subset of has a least
a complete lattice if whatever be the subset upper bound
we choose, it has a supremum and infimum
element. Here relation given is set Answer: a
containment, so supremum element will be Explanation: Consider any sequence like
just union of all sets in the subset we choose. “45, 8, 7, 2” – it can have many (infinite)
Similarly, the infimum element will be just an least upper bounds like “45, 8, 7, 2, 5”, “45,
intersection of all the sets in the subset we 8, 7, 2, 1” and so on but it can have only 1
choose. As R now is not complete lattice, greatest lower bound – “45, 8, 7” because we
because although it has a supremum for every are using the prefix relation. So, every non-
subset we choose, but some subsets have no empty subset has a greatest lower bound.
infimum. For example, if we take subset {{1,
3, 5}, {1, 2, 4}}, then intersection of sets in 9. A partial order ≤ is defined on the set S =
this is {1}, which is not present in R. So {x, b1, b2, … bn, y} as x ≤ bi for all i and bi ≤
clearly, if we add set {1} in R, we will solve y for all i, where n ≥ 1. The number of total
the problem. So adding {1} is necessary and orders on the set S which contain the partial
sufficient condition for R to be a complete order ≤ is ______
lattice. a) n+4
b) n2
7. Consider the ordering relation a | b ⊆ N x c) n!
N over natural numbers N such that a | b if d) 3
there exists c belong to N such that a*c=b.
Then ___________ Answer: c
a) | is an equivalence relation Explanation: To make this partial order a
b) It is a total order total order, we need the relation to hold for
c) Every subset of N has an upper bound every two element of the partial order.
under | Currently, there is no relation between any bi
d) (N,|) is a lattice but not a complete lattice and bj. So, for every bi and bj, we have to add

either (bi, bj) or (bj, bi) in total order. So, this 1. A Poset in which every pair of elements
translates to giving an ordering for n elements has both a least upper bound and a greatest
between x and y, which can be done in n! lower bound is termed as _______
ways. a) sublattice
b) lattice
10. Let (A, ≤) be a partial order with two c) trail
minimal elements a, b and a maximum d) walk
element c. Let P:A –> {True, False} be a
predicate defined on A. Suppose that P(a) = Answer: b
True, P(b) = False and P(a) ⇒ P(b) for all Explanation: A poset in which every pair of
satisfying a ≤ b, where ⇒ stands for logical elements has both a least upper bound and a
greatest lower bound is called a lattice. A
implication. Which of the following
lattice can contain sublattices which are
statements cannot be true?
a) P(x) = True for all x S such that x ≠ b subsets of that lattice.
b) P(x) = False for all x ∈ S such that b ≤ x
and x ≠ c 2. In the poset (Z+, |) (where Z+ is the set of
all positive integers and | is the divides
c) P(x) = False for all x ∈ S such that x ≠ a
relation) are the integers 9 and 351
and x ≠ c
comparable?
d) P(x) = False for all x ∈ S such that a ≤ x
a) comparable
and b ≤ x b) not comparable
c) comparable but not determined
Answer: d
d) determined but not comparable
Explanation: Here, maximum element is c
and so c is of a higher order than any other Answer: a
element in A. Minimal elements are a and b: Explanation: The two integers 9 and 351 are
No other element in A is of lower order than comparable since 9|351 i.e, 9 divides 351. But
either a or b. 5 and 127 are not comparable since 5 | 127 i.e
We are given P(a) = True. So, for all x such 5 does not divide 127.
that a≤x, P(x) must be True. We do have at
least one such x, which is c as it is the 3. If every two elements of a poset are
maximum element. So, P(x) = False for all x comparable then the poset is called ________
∈ S such that a ≤ x and b ≤ x -> cannot be a) sub ordered poset
true. P(x) = True for all x S such that x ≠ b -> b) totally ordered poset
can be True as all elements mapped to TRUE c) sub lattice
doesn’t violate the given implication. P(x) = d) semigroup
False for all x ∈ S such that x ≠ a and x ≠ c ->
can be True if a is related only to c. P(x) = Answer: b
False for all x ∈ S such that b ≤ x and x ≠ c -> Explanation: A poset (P, <=) is known as
can be True as b≤x ensures x≠a and for all totally ordered if every two elements of the
other elements P(x) can be False without poset are comparable. “<=” is called a total
violating the given implication. order and a totally ordered set is also termed
as a chain.
TOPIC 5.2 POSETS, LATTICES 4. ______ and _______ are the two binary
& PROPERTIES operations defined for lattices.
a) Join, meet
b) Addition, subtraction

c) Union, intersection non-lattice poset where b and c have common

d) Multiplication, modulo division upper bounds d, e and f but none of them is
the least upper bound.
Answer: a
Explanation: Join and meet are the binary 7. A sublattice(say, S) of a lattice(say, L) is a
operations reserved for lattices. The join of convex sublattice of L if _________
two elements is their least upper bound. It is a) x>=z, where x in S implies z in S, for every
denoted by V, not to be confused with element x, y in L
disjunction. The meet of two elements is their b) x=y and y<=z, where x, y in S implies z in
greatest lower bound. It is denoted by ∧ and S, for every element x, y, z in L
not to be confused with a conjunction. c) x<=y<=z, where x, y in S implies z in S,
for every element x, y, z in L
5. A ________ has a greatest element and a d) x=y and y>=z, where x, y in S implies z in
least element which satisfy 0<=a<=1 for S, for every element x, y, z in L
every a in the lattice(say, L).
a) semilattice Answer: c
b) join semilattice Explanation: A sublattice S of a lattice L is a
c) meet semilattice convex sublattice of L, if x ≤ z ≤ y and x, y in
d) bounded lattice S implies that z belongs to S, for all elements
x, y, z in L.
Answer: d
Explanation: A lattice that has additionally a 8. The graph is the smallest non-modular
supremum element and an infimum element lattice N5. A lattice is _______ if and only if
which satisfy 0<=a<=1, for every an in the it does not have a _______ isomorphic to N5.
lattice is called a bounded lattice. A partially
ordered set is a bounded lattice if and only if
every finite set (including the empty set) of
elements has a join and a meet.
6. The graph given below is an example of

_________
a) non-modular, complete lattice

b) moduler, semilattice
c) non-modular, sublattice
d) modular, sublattice
Answer: d
a) non-lattice poset Explanation: A lattice (L, ∨, ∧) is modular if
b) semilattice for all elements a, b, c of L, the following
c) partial lattice identity holds->modular identity: (a ∧ c) ∨ (b
d) bounded lattice ∧ c) = [(a ∧ c) ∨ b] ∧ c. This condition is
equivalent to the following axiom -> modular
Answer: a law: a ≤ c implies a ∨ (b ∧ c) = (a ∨ b) ∧ c. A
Explanation: The graph is an example of

lattice is modular if and only if it does not 2. Boolean algebra can be used
have a sublattice isomorphic to N5. ____________
a) For designing of the digital computers
9. Every poset that is a complete semilattice b) In building logic symbols
must always be a _______ c) Circuit theory
a) sublattice d) Building algebraic functions
b) complete lattice
c) free lattice Answer: a
d) partial lattice Explanation: For designing digital computers
and building different electronic circuits
Answer: b boolean algebra is accepted widely.
Explanation: A poset is called a complete
lattice if all its subsets have both a join and a 3. What is the definition of Boolean
meet. Every complete lattice is a bounded functions?
lattice. Every poset that is a complete a) An arithmetic function with k degrees such
semilattice must always be a complete lattice. that f:Y–>Yk
b) A special mathematical function with n
10. A free semilattice has the _______ degrees such that f:Yn–>Y
property. c) An algebraic function with n degrees such
a) intersection
that f:Xn–>X
b) commutative and associative
d) A polynomial function with k degrees such
c) identity
d) universal that f:X2–>Xn
Answer: d Answer: b
Explanation: Any set X may be used to Explanation: A Boolean function is a special
generate the free semilattice FX. The free mathematical function with n degrees and
semilattice is defined to consist of all of the where Y = {0,1} is the Boolean domain with
finite subsets of X with the semilattice being a non-negative integer. It helps in
operation given by ordinary set union; the describing the way in which the Boolean
free semilattice has the universal property. output is derived from Boolean inputs.
4. F(X,Y,Z,M) = X`Y`Z`M`. The degree of

TOPIC 5.3 BOOLEAN ALGEBRA the function is ________
- INTRODUCTION a) 2
b) 5
1. Algebra of logic is termed as c) 4
______________ d) 1
a) Numerical logic
Answer: c
b) Boolean algebra
Explanation: This is a function of degree 4
c) Arithmetic logic
from the set of ordered pairs of Boolean
d) Boolean number
variables to the set {0,1}.
Answer: c
5. A ________ value is represented by a
Explanation: The variables that can have two
Boolean expression.
discrete values False(0) and True(1) and the
a) Positive
operations of logical significance are dealt
b) Recursive
with Boolean algebra.

c) Negative any Boolean function without the help of 3

d) Boolean basic gate types.
Answer: d 9. The logic gate that provides high output for

Explanation: A Boolean value is given by a same inputs ____________
Boolean expression which is formed by a) NOT
combining Boolean variables and logical b) X-NOR
connectives. c) AND
d) XOR
6. Which of the following is a Simplification
law? Answer: b
a) M.(~M+N) = M.N Explanation: The logic gate which gives high
b) M+(N.O) = (M+N)(M+O) output for the same inputs, otherwise low
c) ~(M+N) = ~M.~N output is known as X-NOR or Exclusive
d) M.(N.O) = (M.N).O NOR gate.
Answer: a 10. The ___________ of all the variables in

Explanation: By Simplification Law we can direct or complemented from is a maxterm.
have X.(~X+Y) = X.Y and X+(~X.Y) = X+Y. a) addition
By, De’ Morgan’s law ~(X+Y) = ~X.~Y. By b) product
commutative law we can say that A.(B.C) = c) moduler
(A.B).C. d) subtraction
7. What are the canonical forms of Boolean Answer: a

Expressions? Explanation: The Boolean function is
a) OR and XOR expressed as a sum of the 1-minterms and the
b) NOR and XNOR inverse of function is represented as 0-
c) MAX and MIN minterms.
d) SOM and POM
Answer: d TOPIC 5.4 BOOLEAN ALGEBRA

Explanation: There are two kinds of - FUNCTIONS
canonical forms for a Boolean expression->
1)sum of minterms(SOM) form and 1. What is the use of Boolean identities?
2)product of maxterms(SOM) form. a) Minimizing the Boolean expression
b) Maximizing the Boolean expression
8. Which of the following is/are the universal c) To evaluate a logical identity
logic gates? d) Searching of an algebraic expression
a) OR and NOR
b) AND Answer: a
c) NAND and NOR Explanation: Boolean identities are used for
d) NOT minimizing the Boolean expression and
transforming into an equivalent expression.
Answer: c
Explanation: NAND and NOR gates are 2. _________ is used to implement the
known as the universal logic gates. A Boolean functions.
universal gate is a gate which can implement a) Logical notations
b) Arithmetic logics

c) Logic gates a) AC
d) Expressions b) B+C
c) B`
Answer: c d) AB
Explanation: To implement a Boolean
function logic gates are used. Basic logic Answer: d
gates are AND, OR and NOT. Explanation: AB(B+C)
= ABB + ABC [Applying distributive rule]
3. Inversion of single bit input to a single bit = AB + ABC [Applying Idempotent law]
output using _________ = AB (1+C)
a) NOT gate = AB*1 [As, 1+C=1]
b) NOR gate = AB.
c) AND gate
d) NAND gate 7. The set for which the Boolean function is
functionally complete is __________
Answer: a a) {*, %, /}
Explanation: A NOT gate is used to invert a b) {., +, -}
single bit input (say A) to a single bit of c) {^, +, -}
output (~A). d) {%, +, *}
4. There are _________ numbers of Boolean Answer: b

functions of degree n. Explanation: A Boolean function is
a) n represented by using three operators ., +, -.
b) 2(2*n) We can ﬁnd a smaller set of functionally
c) n3 complete operators if one of the three
operators of this set can be expressed in terms
d) n(n*2)
of the other two.
Answer: b
8. (X+Y`)(X+Z) can be represented by _____
Explanation: There are 2n different n-tuples
a) (X+Y`Z)
of 0’s and 1’s. A Boolean function is an
b) (Y+X`)
assignment of 0’s or 1’s to each of these 2 n
c) XY`
different n-tuples. Hence, there are 2(2*n) d) (X+Z`)
different Boolean functions.
Answer: a
5. A _________ is a Boolean variable. Explanation: (X+Y`) (X+Z)
a) Literal = XX + XZ + XY`+ Y`Z
b) String = X + XZ + XY`+ Y`Z
c) Keyword = X (1+Z) + XY`+ Y`Z
d) Identifier = X.1 + XY`+ Y`Z
= X (1+Y`) + Y`Z
Answer: a = X + Y`Z.
Explanation: A literal is a Boolean variable
or its complement. A maxterm is a sum of n 9. __________ is a disjunctive normal form.
literals and a minterm is a product of n a) product-of-sums
literals. b) product-of-subtractions
c) sum-of-products
6. Minimization of function F(A,B,C) = d) sum-of-subtractions
A*B*(B+C) is _________

Answer: c Answer: d
Explanation: The sum of minterms that Explanation: (X + Z)(X + XZ’) + XY + Y
represents the function is called the sum-of- [Original Expression]
products expansion or the disjunctive normal = (x + z)X(1 + Z’) + XY + Y [Distributive]
form. A Boolean sum of minterms has the = (X + Z)X + XY + Y [Complement,
value 1 when exactly one of the minterms in Identity]
the sum has the value 1. It has the value 0 for = (X+Z)X + Y(X+1) [ Distributive]
all other combinations of values of the = (X+Z)X + Y [Idempotent]
variables. = XX + XZ + Y [Distributive]
= X + XZ + Y [Identity]
10. a ⊕ b = ________ = X(1+Z) + Y
a) (a+b)(a`+b`) = X + Y [Idempotent].
b) (a+b`)
c) b` 3. Simplify the expression: A’(A + BC) +
d) a` + b` (AC + B’C).
a) (AB’C+BC’)
Answer: a b) (A’B+C’)
Explanation: a ⊕ b c) (A+ BC)
= a`b + ab` d) AC
= a`b+aa` + bb` + ab` [As, a*a` = 0 and b*b`
= 0] Answer: b
= a`(a+b) + b`(a+b) Explanation: Given: A’(A + BC) + (AC +
= (a+b)(a`+b`). B’C)
= A’A + A’BC + AC + B’C
= A’BC + C(A + B’)
TOPIC 5.5 MINIMIZATION OF = C(A’B + A + B’)
BOOLEAN ALGEBRA = C(A + B + B’)
= C(A + 1)
1. Find the simplified expression = AC.
A’BC’+AC’.
a) B 4. What is the simplification value of MN(M
b) A+C + N’) + M(N + N’)?
c) (A+B)C’ a) M
d) B’C b) MN+M’N’
c) (1+M)
Answer: c d) M+N’
Explanation: Given: A’BC’ + AC’
= C’(A’B + A) Answer: b
= C’(A + B). Explanation: Given: MN(M + N’) + M(N +
N’)
2. Evaluate the expression: (X + Z)(X + XZ’) = MN(M+N’) + M.1
+ XY + Y. = MNM + MNN’ + M
a) XY+Z’ = MN + 0 +M
b) Y+XZ’+Y’Z = M(N + 1)
c) X’Z+Y = M.
d) X+Y
5. Simplify the expression XZ’ + (Y + Y’Z) +
XY.

a) (1+XY’) 8. Simplify the expression: XY’ + X’ + Y’X’.

b) YZ + XY’ + Z’ a) X’ + Y
c) (X + Y +Z) b) XY’
d) XY’+ Z’ c) (XY)’
d) Y’ + X
Answer: c
Explanation: Given: X Z’ + (Y + Y’Z) + XY Answer: c
= XZ’ + (Y + Z) + XY Explanation: Given XY’+X’+Y’X’ =
= XZ’ + Y + Z + XY Y’(X+X’) + X’ = Y’.1 + X’ = X’ + Y’ =
= (XZ’ + Z) + (Y + XY) (XY)’ [De Morgan’s law].
= (X + Z) + Y (1 + X)
= X + Y + Z. 9. Minimize the Boolean expression using
Boolean identities: A′B+ABC′+BC’+AB′C′.
6. Find the simplified term Y’ (X’ + Y’) (X + a) B(AC)’ + AC’
X’Y)? b) AC’ + B’
a) XY’ c) ABC + B’ + C
b) X’Y d) BC’ + A’B
c) X + Y
d) X’Y’ Answer: a
Explanation: Given: A′B+ABC′+BC’+AB′C′
Answer: a = A’B + BC’ (1 + A) + AB’C”
Explanation: Given: Y’ (X’ + Y’) (X + X’Y) = A’B + BC’ + AB’C’
= Y’(X’ + Y’)(X + Y) = A’B + BC’ + BC’ + AB’C’
= (X’Y’ + Y’)(X + Y) = B(A’ + C’) + C’(A + AB’)
= (XX’Y’ + X’Y’Y + XY’ + YY’) = B(AC)’ + C’ A(1 + B’)
= XY’. = B(AC)’ + AC’.
7. If an expression is given that 10. Minimize the following Boolean

x+x’y’z=x+y’z, find the minimal expression expression using Boolean identities.
of the function F(x,y,z) = x+x’y’z+yz? F(A,B,C) = (A+BC’)(AB’+C)
a) y’ + z a) A + B + C’
b) xz + y’ b) AC’ + B
c) x + z c) B + AC
d) x’ + y d) A(B’ + C)
Answer: c Answer: d
Explanation: We have, x+x’y’z+yz Explanation: Given, F(A,B,C) = (A+BC’)
= x+y’z+yz [since, x+x’y’z=x+y’z] (AB’+C)
= x+z(y’+y) = (AAB’ + BC’AB’ + AC + BC’C)
= x + z. = (AB’ + 0 + AC + 0)
= A(B’ + C).

Ma8351 Discrete Mathematics MCQ 4

Uploaded by

Document Information

Original Title

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

Ma8351 Discrete Mathematics MCQ 4

Uploaded by

Copyright:

Available Formats

MA8351 DISCRETE MATHEMATICS www.studymaterialz.

MATHEMATICS 4. What is the value of x after this statement,

Answer: d 6. Let P: If Sahil bowls, Saurabh hits a

Downloaded from: https://cse-r17.blogspot.com 1

false, hence whole is true. 1. The compound propositions p and q are

TOPIC 1.2 PROPOSITIONAL 5. p ∧ q is logically equivalent to ________

Downloaded from: https://cse-r17.blogspot.com 2

Answer: a 10. ¬ (p ↔ q) is logically equivalent to

Answer: d TOPIC 1.3 PREDICATES AND

7. p ↔ q is logically equivalent to ________ 1. Let P (x) denote the statement “x >7.”

9. (p → r) ∨ (q → r) is logically equivalent to 3. Determine the truth value of ∀n(n + 1 > n)

Downloaded from: https://cse-r17.blogspot.com 3

Downloaded from: https://cse-r17.blogspot.com 4

a) True 5. Let L(x, y) be the statement “x loves y,”

Downloaded from: https://cse-r17.blogspot.com 5

Answer: a 2. Which rule of inference is used in each of

Downloaded from: https://cse-r17.blogspot.com 6

Answer: b 8. The premises (p ∧ q) ∨ r and r → s imply

Answer: d 9. What rules of inference are used in this

Downloaded from: https://cse-r17.blogspot.com 7

TOPIC 1.6 INTRODUCTION TO b) Contrapositive proofs

Downloaded from: https://cse-r17.blogspot.com 8

c) Vacuous proof 343 > 27 as a base case and it is true for n =

Answer: c 2. In the principle of mathematical induction,

10. A theorem used to prove other theorems 3. For m = 1, 2, …, 4m+2 is a multiple of

Downloaded from: https://cse-r17.blogspot.com 9

Now, by induction assumption, we have to 22 + 32 + … + b2 + (b + 1)2 =

be true, 2+4+6+…+4(k+1) = 2+4+6+⋯+ 6

(4k+4) and by the subsequent steps, we can 6

4 mathematical induction, if a statement is true

Downloaded from: https://cse-r17.blogspot.com 10

TOPIC 2.2 STRONG INDUCTION 5. Which amount of postage can be formed

Answer: c 6. 22-cent of postage can be produced with

2. Every simple polynomial has an interior Answer: b

Answer: a 7. Which amount of postage can be formed

Downloaded from: https://cse-r17.blogspot.com 11

c) 11 can be triangulated into n-2 triangles, where n

Downloaded from: https://cse-r17.blogspot.com 12

Downloaded from: https://cse-r17.blogspot.com 13

a) 10000000 2. The least number of computers required to

Answer: b c4->r1, r2, r3, r4, r5

Downloaded from: https://cse-r17.blogspot.com 14

Downloaded from: https://cse-r17.blogspot.com 15

Downloaded from: https://cse-r17.blogspot.com 16

substrings possible = 0 length strings + Explanation: The word ‘SWIMMING

in which the vowels do not come together is =

Downloaded from: https://cse-r17.blogspot.com 17

b) 453600 8. In how many ways can 10 boys be seated

Downloaded from: https://cse-r17.blogspot.com 18

Downloaded from: https://cse-r17.blogspot.com 19

Answer: d groups of 2 each such that at least one group

Answer: b 10. From a group of 8 men and 6 women, five

Downloaded from: https://cse-r17.blogspot.com 20

Answer: a n=1 to get a system of two equations with two

Downloaded from: https://cse-r17.blogspot.com 21

7. Determine the solution for the recurrence Answer: d

Downloaded from: https://cse-r17.blogspot.com 22

conditions a0 and a1 we have: a=7/2 and b) 1

b=-1/2. Therefore the solution to the c) 1

recurrence relation is: an = 4 * 2n – 1*3n = d) 1

power series, we get (1 + x + x2 + x3 +⋯)′ =

Downloaded from: https://cse-r17.blogspot.com 23

Answer: b 9. Suppose G is the generating function for

Answer: a such that (ae) = (ea) = a for all a in S. This