ALPHA COLLEGE OF ENGINEERING

Approved by AICTE & affiliated to Anna University & ISO Certified

Thirumazhisai, Chennai-600 124

DEPARTMENT OF MATHEMATICS

SUBJECT : Discrete Mathematics / MA3354

SEMESTER/YEAR : III/II
Question Bank – Model Exam 2022
Unit – I
Part - A
1. Write the inverse of the statement, “If you work hard then you will be rewarded”.
2. If the universe of discourse consists of all real numbers and if p(x) and q(x) are given by p(x):
x≥0 and q(x): x2≥0, then determine the truth value for (∀𝑥)(p(x) →q(x))
3. Write the following statement in symbolic form: If Avinash is not in a good mood or he is not
busy, then he will go to New Delhi
4. Write the truth table for (p ⋀ q) → (p ⋁ q)
5. When do you say that two compound propositions are equivalent?
6. Define Tautology with an example.
Part – B
1. Obtain the Principal Conjunctive Normal Form for the formula (ℸP→R)⋀(P→Q)⋀(Q→P)
2. Using indirect method, show that R→ ℸQ, R∨S, S→ ℸQ, P→Q⟹ ℸP
3. Show that the premises “A student in this class has not read the book” and Everyone in this
class passed the Semester Exam” imply the conclusion “Someone who passed the Semester
Exam has not read the book”
4. Prove that (∃𝑥)(P(x) ⋀ Q(x)) ⟹(∃𝑥) P(x) ⋀ (∃𝑥)Q(x)
5. Obtain PDNF & PCNF for (ℸP→R) ⋀ (Q⟷P)
6. Show that J⋀S logically follows from the premises P→Q, Q→ ℸR, R, P ∨ (J⋀S)
7. Let K(x): x is a two wheeler, L(x): x is a scooter, M(x): x is manufactured by Bajaj. Express the
following using quantifiers.
I. Every two wheeler is a scooter
II. There is a two wheeler that is not manufactured by Bajaj
III. Every two wheeler that is a scooter is manufactured by Bajaj
8. Show that “It rained” is a conclusion obtained from the statements. “If it does not rain or if
there is no traffic dislocation, then the sports day will be held and the cultural programme will
go on”. “ If the Sports day held, the trophy will be awarded” and “the Trophy was not awarded”
9. When do we say a formula is tautology or contradiction? Without constructing truth table, verify
whether Q ∨ (P ⋀ ℸQ) ∨ (ℸP ⋀ ℸQ) is a contradiction or tautology. Justify your answer.
10. Prove that √2 is irrational by giving a proof by contradiction
11. Let m and n be integers. Prove that n2 = m2 if and only if m = n or m = -n.
12. Write down the negation of each of the following statements:
1. For all integers n, if n is not divisible by 2, then n is odd
2. If k, m, n are any integers, where (k –m) and (m – n) are odd, then (k – n) is even.
3. For all real numbers x, if |x – 3|<7, then -4 < x < 10
4. If x is real number where x2 > 16, then x < -4 or x > 4.
 ALPHA COLLEGE OF ENGINEERING
Approved by AICTE & affiliated to Anna University & ISO Certified
Thirumazhisai, Chennai-600 124

Unit – II
Part – A
𝑛!
1. Prove that if n and k are positive integers with n = 2k, then 2𝑘 is an integer.
2. How many solutions does the equation, x1 + x2 + x3 = 11 have, where x1, x2 and x3 are non-
negative integers?
3. Find the number of bit strings of length 10 that either begin with 1 or end with 0
4. In how many different ways can five men and five women sit around a table?
5. Does there exists a simple graph with the degree sequence {3, 3, 3, 3, 2}?
6. State the Pigeonhole principle
Part – B
1. Let m∈Z+ with m odd. Then prove that there exists a positive integer n such that m divides 2n
–1
2. Determine the number of positive integers n, 1 ≤ n ≤ 2000 that are not divisible by 2, 3 or 5
but are divisible by 7.
3. Using mathematical induction, prove that every integer n ≥ 2 is either a prime number or
product of prime numbers
4. Using generating function method solve the recurrence relation, an+2 – 2an+1 + an = 2n where
n ≥ 0, a0 = 2 and a1 = 1.
5. State the Inclusion and Exclusion principle. Hence, using the principle, find how many
faculty members can speak either French or Russian, if 200 faculty members can speak both
French and 50 can speak Russian, while only 20 can speak both French and Russian
6. Use mathematical induction to show that 20 + 21 + 22 + 23 + ...+2n = 2n+1 – 1, for all non-
negative integers n.
7. Solve Recurrence relation, S(n) = S(n-1) + 2(n-1) with S(0) = 3, S(1) = 1 by finding its
generating function
8. Prove by mathematical induction that for every positive integer n, 3 divides n3 – n.
9. Solve an = 8an-1 + 10n-1 with a0 = 1 and a1 = 9 using generating function
10. How many positive integers not exceeding 1000 are divisible by none of 3, 7 and 11?
11. Using mathematical induction prove that if n is a positive integer, then 133 divides 11n+1 +
122n-1
12. How many ways are there to assign five different jobs to four different employees is
assigned at least one job?
Unit – III
Part – A
|𝑉(𝐺)|
1. If G is a simple graph with δ(G) ≥ 2
then show that G is connected
2. Give an example of a graph which is Hamiltonian but not Eulerian
3. Give an example of a graph which is Eulerian but not Hamiltonian
4. Write the adjacency matrix and incidence matrix of K2,2
5. Define strongly connected graph
6. Define Complete graph
 ALPHA COLLEGE OF ENGINEERING
Approved by AICTE & affiliated to Anna University & ISO Certified
Thirumazhisai, Chennai-600 124

Part – B
1. Define incidence matrix of a Graph. Using incidence matrix of a graph G, show that the sum
of degrees of vertices of a graph G is equal to twice the number of edges of G
2. When do we say two simple graphs are isomorphic? Check whether the following two
graphs are isomorphic or not. Justify your answer.

3. Let G be a graph with adjacency matrix A with respect to the ordering of vertices v1, v2, . . . ,
vn. Then prove that the number of different walks of length r from vi to vj, where r is a
positive integer, equals (i, j)th entry of Ar
4. Show that the complete bipartite graph Km, n with m, n ≥ 2 is Hamiltonian if and only if m =
n. Also show that complete graph Kn is Hamiltonian for all n ≥ 3
5. Check whether the following graphs are isomorphic

6. If A is the adjacency matrix of a graph G with V(G) = {v1, v2, ... , vn}, prove that for any n ≥
1, the (i, i)th entry of An is the number of vi – vj walks of length n in G
7. Define self complementary graph. Show that if G is a self complementary simple graph with
n vertices then n ≡ 0 or 1 (mod 4)
8. Show that a simple graph G is Eulerian if and only if all its vertices have even degree
9. Draw the complete graph K5 with vertices A, B, C, D, E. Draw all complete subgroup of K5
with 4 vertices
10. Define
i) Adjacency matrix and
ii) Incidence matrix of a group with examples
11. Prove that any undirected graph has an even number of vertices of odd degree
12. If (S1, *) and (S2, o) are two semigroups such that f: S1 → S2 is an onto homomorphism and a
relation R is defined on S, such that aRb ↔f(a) = f(b) for any a, b ∈ S1 then R is a
congruence relation
Unit – IV
Part – A
1. Is it true that (Z5*, X5) a cyclic Group? Justify
2. Prove that group homomorphism preserves identity
 ALPHA COLLEGE OF ENGINEERING
Approved by AICTE & affiliated to Anna University & ISO Certified
Thirumazhisai, Chennai-600 124

3. Show that the identity element of a group is unique

4. Give an example of an integral domain which is not a field
5. Prove if a has inverse b and b has inverse c, then a = c.
6. Prove that identity element is unique in a group.
Part – B
1. Prove that the group homomorphism preserves the identity element
2. Let f be a group homomorphism from a group (G, *) into a group (H, ∆) then prove that
ker(f) is a subgroup. Check whether ker(f) is a normal subgroup of (G, *). Justify your
answer.
3. State and prove Lagrange’s theorem
4. Show that the union of two subgroups of a group G is a subgroup of G if and only if one is
contained in other
5. State and prove Lagrange’s theorem on groups(16m)
6. Show that a non empty subset H of a group (G, *) is a subgroup of G if and only if a*b -1∈H
for all a, b ∈ H
7. Show that the kernel of a group homomorphism is a normal subgroup of the group
8. Define Monoid. Give an example of a semi group that is not a monoid. Further prove that
for any commutative monoid (M, *), the set of idempotent elements of M form a submnoid.
𝑎𝑏
9. Show that (Q+, *) is an abelian group, where * is defined by a * b = , ∀ a, b ∈ Q+
2
10. Prove that every subgroup of a cyclic group is cyclic
11. Prove that every finite group of order n is isomorphic to a permutation group of degree n.
Unit – V
Part – A
1. Show that in a lattice a≤b and c≤d then a ∗ c ≤ b ∗ d
2. Is it true that every chain with atleast three elements is always a complemented lattice?
Justify your answer
3. Define Lattice homomorphism.
4. When is a lattice said to be a Boolean algebra?
5. Draw the Hasse Diagram of (D20, | )where D20 denotes the set of positive divisors of 20
and | is the relation “division”
6. In any lattice (L, ≤), ∀ a, b ∈ L, show that a ∗ ( a ⊕ b ) = a where a ∗ b = glb (a, b) and a
⊕ b = lub (a, b)
Part – B
1. Show that every chain is a Distributive Lattice
2. Let D100 = {1, 2, 4, 5, 10, 20, 25, 50, 100} be the divisors of 100. Draw the Hasse diagram
of (D100, /) where / is the relation “division”.
Find (I) glb{10, 20} (II) lib{10, 20} (III) glb{5, 10, 20, 25} (IV) lub{5, 10, 20, 25}
3. In a Boolean algebra, show that (a ∗ b)’ = a’ ⊕ b’ and (a ⊕ b)’ = a’ ∗ b’
4. Define a Modular Lattice and Prove that every distributive lattice is modular but not
conversely
5. If (A, R) is a partially ordered set then show that set (A, R -1) is also a partially ordered set,
where R-1 = {(b, a)/(a, b) ∈ R}
 ALPHA COLLEGE OF ENGINEERING
Approved by AICTE & affiliated to Anna University & ISO Certified
Thirumazhisai, Chennai-600 124

6. Let (L, ∗, ⊕) and (M, ⋀, ⋁) be two lattices. Then prove that (L×M, Δ, ∇) is a lattice,
where (x, y) Δ (a, b) = (x * a, y⋀b) and (x, y) ∇ (a, b) = (x ⊕ a, y ⋁ b) for all (x, y), (a, b)
∈ L×M
7. Prove that in every lattice distributive inequalities are true
8. Define modular lattice. Prove that a lattice L is a modular if and only if x, y 𝜖 L, x ⊕ (y ∗
(x ⊕ z)) = (x ⊕ y) ∗ (x ⊕ z)
9. Let (L, ≤) be a Lattice. For any a, b∈L, a ≤ b ↔ a ⋀ b = a ↔ a ∨ b = b
10. Draw the Lattice of (S, gcd, lcm) where S = {x : x is a divisor of 210}
11. Show that (N, ≤) is a partially ordered set where N is set of all positive integers and ≤ is
defined by m ≤ n, iff n – m is a non-negative integer.
12. Prove that (L, ⋀, ∨) is not a complemented lattice (under division relation) where L = {1,
2, 3, 4, 6, 12} and also draw the Hasse diagram.
__________