DISCRETE MATHEMATICS QUESTION BANK-MA 3351

UNIT-I
PART-A
1)Using truth table show that the proposition PV ‫( ד‬PɅQ) is a tautology.

2)Find the truth table for the statement P→Q.

3)Does P→ (P→ Q) form a tautology.
4)Show that (P→(Q→R)) →((P→Q) →(P→R)) is a tautology.

5)Construct the truth table for (𝑄 ⋀(𝑃 → 𝑄)) → 𝑃

6)Show that (𝑃 ∧ 𝑄) ∧ ¬(𝑃 ∨ 𝑄) is a contradiction.

7)Prove that (𝑝 → (𝑝⋁𝑞)) is a tautology.

8)Define Proposition.
9)Explain the two types of quantifiers through examples.
10)When do you say that two compound propositions are equivalent?
11) Show that 𝑝 → 𝑞 and ¬𝑝⋁𝑞 are equivalent.
12)State the truth table of “If tigers have wings then the earth travels round
the sun”.
13)Symbolize the statement “All men are mortal”
14)Symbolize the following statement, “All the world loves a lover”.
15)Symbolize the following statement “You can access the internet from
campus only if you are computer science major or you are not a freshman”.

Part-B
1) Find a principal disjunctive normal form and a principal conjunctive normal
form of 𝑝 ⋁ (~𝑝 → (𝑞 ⋁ (~𝑞 → 𝑟))).

2)Find PDNF and PCNF of the following compound proposition using truth table
and laws of proposition. (¬𝑝 ∨ ¬𝑞) → (𝑝 ↔ ¬𝑞)
3) Obtain the PDNF of (𝑃 ∧ 𝑄) ∨ (¬𝑃 ∧ 𝑅) ∨ (𝑄 ∧ 𝑅)
4)Obtain PDNF and PCNF of (¬𝑃 → 𝑅) ∧ (𝑄 ↔ 𝑃)
5)Show that 𝑅 → 𝑆 is logically derived from the premises 𝑃 → (𝑄 → 𝑆), ¬𝑅 ∨
𝑃, 𝑎𝑛𝑑 𝑄.

6)Show that (¬𝑃 ∧ (¬𝑄 ∧ 𝑅)) ∨ (𝑄 ∧ 𝑅) ∨ (𝑃 ∧ 𝑅) ⟺ 𝑅.

7)Show that 𝑃 → 𝑄 , 𝑃 → 𝑅 , 𝑄 → ¬𝑅 𝑎𝑛𝑑 𝑃 are inconsistent.

8)Establish the validity of the following argument. “All integers are rational
numbers. Some integers are powers of 2. Therefore, some rational numbers
are powers of 2.
9) Show that the following argument is valid, “Every microcomputer has a
serial interface port. Some micro computers have a parallel port. Therefore,
some micro computers have both serial interface port and parallel port”.
10)Show that 𝑅 ∨ 𝑆 follows logically from the premises 𝐶 ∨ 𝐷, (𝐶 ∨ 𝐷) →
¬𝐻, ¬𝐻 → (𝐴 ∧ ¬𝐵) 𝑎𝑛𝑑 (𝐴 ∧ ¬𝐵) → (𝑅 ∨ 𝑆 )
11) Using the indirect method, Show that (𝑥)(𝑃(𝑥) ⋁ 𝑄(𝑥)) ⇒ (𝑥)𝑃(𝑥) ⋁ (∃𝑥)𝑄(𝑥).
12)Use indirect method to prove that that ∀𝑥(𝑃(𝑥)⋁𝑄(𝑥)) ⟹ (∀𝑥) 𝑃(𝑥)⋁(∃x)Q(x)
13) Demonstrate that R is a valid inference from the premises 𝑃 → 𝑄, 𝑄 →
𝑅 𝑎𝑛𝑑 𝑃
14)Show that (∀𝑥)(𝐿(𝑥) → 𝐷(𝑥)), (∃𝑥)(𝐿(𝑥)) ⇒ (∃𝑥)(𝐷(𝑥))
15)Construct the truth table for (𝑃 ⟷ 𝑄) ⟷ (𝑅 ⟷ 𝑆).
16)Show that S∨ 𝑅 follows logically from the premises 𝑃 ∨ 𝑄, 𝑃 → 𝑅, 𝑄 → 𝑆
UNIT-II
PART-A
1) State Pigeonhole principle.
2) Among 200 people, how many of them were born on the same month.
3) Show that if 25 dictionaries in a library contain a total of 40,325 pages,
then one of the dictionaries must have at least 1614 pages.
4)Show that if seven colors are used to paint 50 bicycles, at least 8 bicycles
will be the same color.
5) In how many ways can all the letters in MATHEMATICAL is arranged.
6) Find the number of distinct permutations that can be formed from all the
letters of each word (i)RADAR (ii)UNUSUAL
7) How many permutations can be made out of letter or word ‘COMPUTER’?
8) Twelve students want to place order of different ice-creams in ice-cream
parlour, which has the six type of ice-creams. Find the number of orders that
the twelve students can place.
9) How many ways are there to select five players from 10 members tennis
team to make a trip to match to another school.
10) In how many ways can 6 persons occupy 3 vacant seats?
11)In how many ways can 6 boys and 4 girls be arranged in a straight line so
that no two girls are ever together.
12)In how many ways can 5 persons be selected from amongst 10 persons?
13)If 𝑛𝐶5 = 20𝑛𝐶4 , find ‘n’.
14)From a committee consisting of 6 men and 7 women, in how many ways
can be select a committee of 4 men and 3 women.
15)If the sequence 𝑎𝑛 = 3. 2𝑛 , 𝑛 ≥ 1 , then find the corresponding recurrence
relation.
Part-B
𝑛(𝑛+1)(2𝑛+1)
1)Prove by mathematical induction ∑𝑛𝑖=1 𝑛2 =
6

2) Use mathematical induction to prove that,

(𝑛+1)(2𝑛+1)(2𝑛+3)
12 + 32 + 52 +. . . +(2𝑛 + 1)2 = , whenever n is positive integer.
3

3) Show that 𝑛3 + 2𝑛 is divisible by 3.

4)Using Mathematical Induction, Prove the following: 1 + 2 + 3 + ⋯ + 𝑛 =
𝑛(𝑛 + 1)
2

5) Form a committee consisting of 6 men and 7 women, in how many ways

can be select 9 committee members of (a)3 men and 4 women(b)4 members
which has at least one women(c) 4peersons that has at most one man (d) 4
person in which Mr. and Mrs. Kannan is not included.
6)Use generating functions to solve the recurrence relation 𝑎𝑛 − 2𝑎𝑛−1 − 3𝑎𝑛−2 =
0, 𝑛 ≥ 2 with 𝑎0 = 3, 𝑎1 = 1

7)Solve the recurrence relation 𝑎𝑛 = 8𝑎𝑛−1 − 16𝑎𝑛−2 𝑓𝑜𝑟 𝑛 ≥ 2 , 𝑎0 = 16, 𝑎1 = 80

8) Find an explicit formula for the Fibonacci sequence.
9) Solve the recurrence relation 𝑎𝑛 = 5𝑎𝑛−1 − 6𝑎𝑛−2 + 7𝑛 .
10) Use generating functions to solve the recurrence relation 𝑎𝑛 − 2𝑎𝑛−1 −
3𝑎𝑛−2 = 0, 𝑛 ≥ 2 with 𝑎0 = 3, 𝑎1 = 1
11) Use generating functions to solve the recurrence relation 𝑎𝑛+2 − 8𝑎𝑛+1 +
15𝑎𝑛 = 0 𝑔𝑖𝑣𝑒𝑛 𝑡ℎ𝑎𝑡 𝑎0 = 2, 𝑎1 = 8
12)A survey of 500 from a school produced the following information. 200 play
volleyball,120 play hockey.60 play both volleyball and hockey. How many are
not playing either volleyball or hockey?
13) Find the number of integers between 1 to 250 that are not divisible by
any of the integers 2,3,5 and 7
14) In a class of 50 students, 20 students play football, and 16 students play
Hockey. It is found that 10 students play both the games. Find the number of
students who play neither.
15) Find the number of positive integers not exceeding 1000 are divisible by
7 or 11.
16)Find the number of positive integers not exceeding 1000 are divisible by 7
or 11.

UNIT-III
PART-A
1)Define simple graph with an example.
2) Define the pseudograph with an example.
3)Find the number of edges is there in a graph with ten vertices each of degree
six.
4) Define adjacency matrix of a graph.

0 1 1 0
5)Draw a graph with the adjacency matrix [1 0 0 1].
1 0 0 1
0 1 1 0
0 0 1 1
6) Draw the graphs represented by the following adjacency matrix [0 0 1 0]
1 1 0 1
1 1 1 0
7) Define degree of a vertex in an undirected graph.

8) Show that there does not exist a graph with 5 vertices with degrees 1, 3,
4,2, 3 respectively.
9) A graph G has 21 edges, 3 vertices of degree4 and the other vertices are of degree
3. Find the number of vertices in G.

10) Define complete graph.

11) Draw the complete graph K5.
12) Define Path.
13) Define Strongly connected graph.
14) When a simple graph G bipartite and give an example.
15) State the necessary and sufficient conditions for the existence of an
Eulerian path in a connected graph.
Part-B
1)Show that the maximum number of edges in a simple graph with ‘n’ vertices
𝑛(𝑛−1)
is 2

2) State and prove The Handshaking theorem.

3) Prove that number of vertices of odd degree in a graph is always even.
4) Determine whether the following pairs of graphs G1 and G2 are isomorphic.

5) Determine whether the following pairs of graphs G and H are isomorphic.

6) Determine whether the following pairs of graphs G1 and G2 are isomorphic.

7) Identify whether the following pairs of graphs are isomorphic or not?

8) Show that a simple graph with ‘n’ vertices and ‘k’ components can have at
(n − k)(n − k + 1)
most edges.
2

9) Explain Konigsberg bridge problem. Represent the problem by mean of

graph. Does the problem have a solution?
10) Determine which of the following graph are bipartite & which are not. If
a graph is bipartite, state if is completely bipartite.
11) Draw the complete graph K5 with vertices A, B, C, D, E. Draw all
complete subgraph of K5 with 4 vertices.
12)Prove that a simple graph with n vertices must be connected if it has more
(𝑛 − 1)(𝑛 − 2)
than edges
2

13) Find a Euler path or Euler circuit if it exists in each of three graphs
below.If not explain why?

14) Give an example of a graph which is (i)Hamiltonian but not Eulerian (ii)
not Hamiltonian and not Eulerian(iii)not Hamiltonian but Eulerian(iv)
Hamiltonian and Eulerian
15) Find a Euler path or Euler circuit if it exists in each of three graphs
below. If not explain why?
 UNIT-IV
PART-A
1) Define monoid.
2) Let 𝐺 = {1, 𝑎, 𝑎2 , 𝑎3 }(𝑎4 = 1) be a group and 𝐻 = {1, 𝑎2 } is a subgroup of G under
multiplication. Find all the cosets of H.
3)Obtain all the distinct left cosets of 𝐺 = {1, −1, 𝑖, −𝑖} and a subgroup 𝐻 =
{1, −1}.

4) Define Semi Group.

5)Elucidate Subgroup.
6) Prove that identity element in a group is unique.
7) State any two properties of a group.
8) Show that the inverse of an element in a group (G, *) is unique
9) Prove that identity element of a subgroup is same as that of the group.
10) Define normal subgroup.
11)Define kernel of a homomorphism.
12)prove that union of two subgroups of a group need not be subgroup.
13)Prove that the intersection of two subgroups of a group is also a subgroup.
14)Define integral domain.
15) Define field in an algebraic system

Part-B
1) Show that (Q+, *) is an abelian group where * is defined by 𝑎 ∗ 𝑏 =
𝑎𝑏
, ∀ 𝑎, 𝑏 ∈ 𝑄 +
2

2) Prove that kernel of a homomorphism is a normal subgroup of G.

3) Prove that intersection of two normal subgroups of a group G is again a
normal subgroup of G.
4) State and Prove Lagrange’s theorem. (OR)Let G be a finite group and H be
a subgroup of G. Then prove that order of H divides order of G.
 𝑥 𝑥
5) Let G denote the set of all matrices of the form [ ] where 𝑥 ∈ ℝ∗ . Prove
𝑥 𝑥
that G is a group under matrix multiplication.
6)Show that the set 𝐺 = {1, −1, 𝑖 − 𝑖} consisting of the 4th roots of unity is a
commutative group under multiplication.
7)If 𝑀2 is the set of 2𝑥2 nonsingular matrices over R. That is.,𝑀2 =
𝑎 𝑏
{[ ] /𝑎, 𝑏, 𝑐, 𝑑 ∈ 𝑅 𝑎𝑛𝑑 𝑎𝑑 − 𝑏𝑐 ≠ 0}. Prove that (𝑀2 , 𝑥) is a group, where x is
𝑐 𝑑
usual matrix multiplication. Is it abelian?
8)Prove that (i) the identity element of a group is unique.
(ii)the inverse element of a group is unique.
9)Prove that (i)the intersection of two subgroups of a group is also a subgroup
of the group. (ii)the union of two subgroups of a group need not be subgroup.
10)Let 𝑓: (𝐺,∗) → (𝐺′,∗) be a homomorphism. Then prove that Ker f is a
subgroup.
11)Prove that the intersection of any two normal subgroups of a group is a
normal subgroup.
12)Define Ring with an example.
13)Show that the set 𝑊 = {0,1,2 . . . } is a semigroup under the operation 𝑥 ∗ 𝑦 =
𝑚𝑎𝑥{𝑥, 𝑦}.Is it a monoid.
14) Show that the set 𝑊 = {0,1,2 . . . } is a semigroup under the operation 𝑥 ∗
𝑦 = 𝑚𝑖𝑛{𝑥, 𝑦}.Is it a monoid.
15)Prove that Z is not a group under multiplication.
UNIT-V
PART-A
1) Draw the Hasse diagram for (𝐷24 ,/), where 𝐷24 = {1,2,3,4,6,8,12,24}.
2) Elucidate lattice.
3) Define Boolean Algebra.
4) Define sub-lattice.
5) When is a lattice called complete?
6) Show that in a Boolean algebra ab´+a´b=0 if and only if a=b.
7) Draw the Hasse diagram for {(𝑎, 𝑏), 𝑎 𝑑𝑖𝑣𝑖𝑑𝑒𝑠 𝑏}, on{1,2,3,4,6,8,12}
8) Draw the Hasse diagram of (X, ≤), where X= {2,4,5,10,12,20,25} and
the relation ≤ be such that x≤y if x divides y.
9)Define POSET.
10)Define equivalence relation.
11)Elucidate LUB and GLB.
12)Define bounded lattice.
13)Define complemented lattice.
14)Prove that 𝑎 + 𝑎𝑏 = 𝑎.
15)Prove that (𝑎 + 𝑏)(𝑎 + 𝑐) = 𝑎 + 𝑏𝑐
Part-B
1) Show that every chain is a distributive lattice.
2) Verify whether the lattices given by the Hasse diagrams in following are

distributive.
3) State and prove De Morgan’s law in any Boolean Algebra.
4) Let 𝐷30 = {1,2,3,5,6,10,15,30} with a relation
𝑥 ≤ 𝑦 if and only if x divides y. Find
(a)All lower bounds of 10 and 15
(b)GLB of 10 and 15
(c)All upper bound are 10 and 15
(d)LUB of 10 and 15
Draw the Hasse diagram for 𝐷30
5) In any Boolean algebra show that a. 𝑏 ̅+ 𝑏. 𝑎 = (a+b)( 𝑎 +𝑏 ̅)
6) Show that in a complemented distributive lattice a b⟺ 𝑎Ʌ𝑏 ̅=0,𝑎⋁b = 𝑏 ≤ ̅ 𝑎
7) In 𝑆42 is the set of all divisors of 42 and D is the relation “divisor of” on 𝑆42 ,
prove that {𝑆42 ,D} is a complemented Lattice.
8) Show that every finite partial ordered set has a maximal and minimal
element.
9)Consider 𝑋 = {1,2,3,4,6,12} , 𝑅 = {〈𝑎, 𝑏〉|𝑎/𝑏}.Find LUB and GLB for the poset (X,
R).
10) Consider 𝑋 = {2,3,6,12,24,36} , 𝑅 = {〈𝑎, 𝑏〉|𝑎/𝑏}.Find LUB and GLB of (2,3) and
(24,36) the poset (X, R).
11)Identify Which elements of the poset ({2,4,5,10,12,20,25},/) are maximal and
which are minimal.
12) Let 𝐷24 = {1,2,3,4,6,8,12,24} with a relation
𝑥 ≤ 𝑦 if and only if x divides y. Find
(a)All lower bounds of 8 and 12
(b)GLB of 8 and 12
(c)All upper bound are 8 and 12
(d)LUB of 8 and 12
Draw the Hasse diagram for 𝐷24
13)Prove that every finite lattice is bounded.
14)If 𝑆42 is the set of all divisor of 42 and D is the relation “divisor of” on
𝑆42 ,prove that {𝑆42 , D} is a complemented Lattice.
15)In any distributive Lattice (𝐿, ∧, ∨) ∀ 𝑎, 𝑏, 𝑐 ∈ 𝐿.Prove that 𝑎 ∨ 𝑏 = 𝑎 ∨ 𝑐 , 𝑎 ∧
𝑏 =𝑎∧𝑐 ⇒𝑏 =𝑐