DISCRETE MATHEMATICS

UNIT-1

PART-A
1. Define proposition.
2. Define Tautology with an example.
3. Construct the truth table for (  p) ˅ (  q).
4. Prove that  p   p  q is a tautology.
5. Find the truth table for p  q .
6. Express A  B in terms of the connectives , 
7. When do you say that two compound propositions are equivalent?
8. Write the inverse of the statement, “If you work hard then you will be rewarded.”
9. Give the symbolic form of “Some men are giant” .
10. Symbolize the statement “All men are mortal”.
11. Let E = {-1,0,1,2} denote the universe of discourse. If p(x,y):x+y =1, find the truth value
of (x)(y ) p( x, y ) .

PART-B
1. Show that (P  (Q  R))  (Q  R)  ( P  R)  R without using truth table.
2. Prove that (( p  q)  (p  (q  r )))  (p  q)  (p  r ) is a tautology.
3. Obtain the principal conjunctive normal form and principle disjunctive normal form of
the (P  R)  (Q  P)
4. Obtain the PDNF and PCNF for ( P  Q)  (P  R) .
5. Find a principal disjunctive normal form and a principal conjunctive normal form of
p  p  q  q  r 
6. Show that R  S is logically derived from the premises P  (Q  S), R  P and Q.
7. Using indirect method, show that p  q, q  r, p  r  r .
8. Using indirect method, show that R→˥Q, R˅S, S  →˥Q, P→Q  ˥P.
9. Using conditional proof prove that P  Q, Q  R, R  S  P  S .
10. Show that the premises “one student in this class knows how to write programs in JAVA”
and “everyone who knows how to write programs in JAVA can get high paying jobs”
imply the conclusion “ someone in this class can get high paying job”.
11. Prove that 2 is irrational by giving a proof by contradiction.
12. Show that (x) ( P(x) Q(x)) (Q(x) R(x)) (P(x) R(x))
13. Using the indirect method, show that xPx  Qx  xPx  xQx
14. Prove that xPxQx  xPxxQx
15. 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 is held, the trophy will be awarded” and “
The trophy was not awarded”.
UNIT-2

PART-A
1. State the principle of mathematical induction.
2. State the principle of strong induction.
3. What is well ordering principle?
4. State Pigeonhole principle.
5. Use mathematical induction to show that n! > 2n – 1 , for all n =1,2,3,…
6. Prove that n 2  2n for all positive integers n> 4
7. Find the number of arrangements of the letter in MAPPANASSRR. . How many of these
arrangements have no adjacent A’s?
8. Find the number of arrangements of the letter in DISCRETE. How many of these
arrangements have no adjacent E’s?
9. In how many ways a foot ball team of 11 players can be chosen out of 18 players when 4
particular players are to be always included?
10. If seven colours are used to paint 50 bicycles, then show that at least 8 bicycles will be
the same colour.
11. How many cards must be selected from a deck of 52 cards to guarantee that at least three
cards of the same suit are chosen?
12. Solve the recurrence relation y(k) – 8 y(k-1) + 16 y(k-2) = 0 for k ≥ 2,where y(2) = 16
and y(3) = 80.
13. Find the recurrence relation for the Fibonacci sequence.

PART-B

1. Find the number of integers between 1 and 250 both inclusive that are divisible by
any of the integers 2, 3, 5, 7.
2. Find the number of integers between 1 and 2000 both inclusive that are not
divisible by any of the integers 2, 3, 5, 7.
3. Find the number of positive integers ≤ 1000 and not divisible by any of 3, 7 and
11.
4. A total of 1232 students have taken a course in Spanish, 879 have taken a course
in French, and 114 have taken a course in Russian. Further, 103 have taken
courses in both Spanish and French, 23 have taken courses in both Spanish and
Russian, and 14 have taken courses in French and Russian. If 2092 students have
taken at least one of Spanish, French and Russian, how many have taken a course
in all three languages?
5. In a survey of 100 students , it was found that 40 studied Mathematics, 64 studied
Physics 35 studied Chemistry, 1 studied all the three subjects, 25 studied
Mathematics and Physics, 3 studied Mathematics & Chemistry and 20 studied
Physics and Chemistry. Find the number of studied who studied Chemistry only
and who studied none of these subjects?
n
n(n  1)(2n  1)
6. Using Mathematical induction, show that  k2  6
k 1
7. Using Mathematical induction, show that

12  32  52  ...  2n  1 
2 n  12n  12n  3
3
3n1  1
n
8. Using Mathematical induction, show that  3  r

r 0 2
9. Use mathematical induction to show that n3-n is divisible by 3, for n ϵ Z+.
10. Prove, by mathematical induction that 6n+2 + 72n+1 is divisible by 43 for each
positive integer n.
11. Using generating function, solve yn+2 – yn+1 - 6yn = 0, n ≥ 0 with y0 = 2 and y1 =
1.
12. Solve the recurrence relation, S(n) = S(n – 1) + 2(n – 1), with S(0) = 3, S(1) = 1
by finding its generating function.
13. Using generating function, solve yn+2 –4 yn+1 +3yn = 0, n ≥ 0 with y0 = 2 and y1= 4.
14. Solve the recurrence relation F(n)-F(n-1)-F(n-2) = 0, F(0)= 1 , F(1)=1 .
15. Solve an  8an 1  10 n 1 with a0=1 and a1=9 using generating function.
 UNIT-3 GRAPHS
PART-A

1. Define Pseudo graph.

2. Define a multi graph.
3. What is meant by simple graph? Give an example.
4. Define complete graph and give an example.
5. When is a simple graph G bipartite? Give an example.
6. Draw a complete bipartite graph of K2,3 and K3,3.
0 1 0 1
1 0 1 0 
7. Draw the graph represented by the adjacency matrix  .
0 1 0 1
 
1 0 1 0
8. Obtain the adjacency matrix of a graph G

9. Define isomorphism of two graphs.

10. Define an Euler graph with an example.
11. Define a Hamilton graph with an example.
12. Define strongly connected graph.
13. State the necessary and sufficient conditions for the existence of an Eulerian path in a
connected graph.
14. State the necessary and sufficient conditions for the existence of an Eulerian circuit in a
connected graph.
15. Write the adjacency matrix and incidence matrix of K2,2.
16. An undirected graph G has 16 edges and all the vertices are of degree 2. Find the number
of vertices?
17. Define incidence matrix of a simple graph.
18. How many edges are there in a graph with 10 vertices each of degree six?
PART-B
1. State and prove Handshaking theorem. (or) Prove that the total degree of vertices
in a graph is equal to twice the edges of the graph.
2. In a graph G prove that the total number of odd degree vertices is even.(or) Prove
that any undirected graph has an even number of vertices of odd degree.
3. If all the vertices of an undirected graph are each of degree k, show that the
number of edges of the graph is a multiple of k.
4. Determine which of the following graphs are bipartite and which are not. If a
graph is bipartite, state if it is completely bipartite.

5. Show that the following graphs G and H are not isomorphic:

6. Using circuits, examine whether the following pairs of graphs G 1,G2 given below
are isomorphic or not:
7. Examine whether the following pair of graphs are isomorphic. If not isomorphic,
give the reasons.

8. Prove that maximum number of edges in a bipartite graph with n vertices is n2/4.
9. Prove that a graph G is disconnected if and only f the vertex set V is partitioned
into two non-empty subsets U and W such that there exists no edge in G whose
one vertex is in U and One vertex is in W.
10. Find an Euler path or an Euler circuit, if it exists in each of the three graphs
below. If it does not exist, explain why?

11. Prove that a given connected graph G has an Euler path if and only if there are
exactly two vertices of odd degree.
12. Prove that a given connected graph G is an Euler graph if and only if all the
vertices of G are of even degree.
13. Show that maximum number of edges in a graph with n vertices is n(n-1)/2.
14. Prove that a simple graph with n vertices and k components cannot have more
 n  k  n  k  1
than 2 edges.
15. Which of the following simple graphs have a Hamilton circuit or, if not,a
Hamilton path?

16. If G is a connected simple graph with n vertices with n  3,such that the degree of
every vertex in G atleast n/2 ,then prove that G has Hamiltonian cycle.
17. Let G be a simple undirected graph with n vertices. Let u and v be two non
adjacent vertices in g such that deg(u) + deg(v) ≥ n in G. Show that G is
Hamiltonian if and only if G + uv is Hamiltonian.

UNIT-4 ALGEBRAIC STRUCTURES

PART-A
1. Define a semi group and give an example.
2. Define monoid.
3. Define a group.
4. Prove that identity element is unique in a group.
5. Prove that inverse of an element is unique in a group.
6. Prove that in any group, identity element is the only idempotent element.
7. If a and b are any two elements of a group {G,*},show that G is an Abelian group
if and only if (a*b)2=a2*b2.
8. Define a cyclic group.
9. Show that every cyclic group is abelian.
10. If ‘a’ is a generator of a cyclic group G, then show that a-1 is also a generator of G.
11. Define normal subgroup of a group.
12. Define the homomorphism of groups.
13. Prove that group homomorphism preserves identity.
14. Define a Ring.
15. Define a field.
 PART-B
1. Show that (Z,*) is a group, where * is defined by a*b=a+b+1.
2. Prove that [Z5,+5] is an abelian group.
3. Show that the set Q+ of all positive rational numbers form an abelian group under the
1
operation * defined by a*b= ab, for all a,b∈Q+.
2
4. Show that the group G={1,-1,i,-i} is cyclic and find its generators.
5. Show that a non empty subset H of a group (G,*) is a subgroup of G iff a*b -1 ∈H for all

a,b ∈ H

6. Prove that the intersection of any two subgroups of a group G is again a subgroup of G.

7. Prove that every subgroup of a cyclic group is cyclic.

8. Show that any two right (left) cosets of H in G are either disjoint or identical.
9. State and prove Lagrange’s Theorem.(or) Prove that the order of a subgroup of a finite
group divides the order of the group.
10. A subgroup H of a group G is a normal subgroup in G iff each left coset of H in G is

equal to the right coset of H in G.

11. Prove that intersection of two normal subgroups of a group will be a normal subgroup.
12. Let f:(G,*)→(G',∆) be a group homomorphism then prove that
(i) [f(a)] -1=f(a-1) ∀ 𝑎 ∈ 𝐺
(ii) f(e) is an identity of G ', when e is an identity of G.
13. 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.
14. . State and prove the fundamental theorem on homomorphism of groups.(or) Let f:GG’
be a homomorphism of groups with Kernal K. Then prove that K is a normal subgroup of
G and G/ k is isomorphic to the image of f.
15. Prove that every finite group of order n is isomorphic to a permutation group of order n.
16. Show that the z4={0,1,2,3} is a commutative ring with respect to the binary operations

additive modulo 4(+4) and multiplicative modulo 4(x4).

 UNIT-5 LATTICES AND BOOLEAN ALGEBRA
PART-A

1. Define a Lattice.

2. When is a lattice complete?

3. State any two properties of Lattices.

4. Give an example of a lattice that is not complemented.

5. Define sub-lattice.

6. In a lattice ( L, ≤ ), prove that a (ab) = a for all a,bL .

7. The following is the Hasse diagram of a partially ordered set. Verify whether it is
a lattice.

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 lattice homomorphism.
10. Define a Boolean algebra. (or)When is a lattice said to be a Boolean algebra?
11. Is there a Boolean Algebra with five elements? Justify your answer.
PART-B
1. Prove that every chain is a distributive lattice.
2. Prove that every distributive lattice is modular. Is the converse true? Justify your claim.
3. Prove that in a distributive lattice every element has unique complement.

4. Show that in a lattice if a ≤ b and c ≤ d , then a*c ≤ b*d and a  c  b  d .

5. In a distributive lattice prove that a*b =a*c and a  b  a  c imply b=c.

6. Show that the direct product of any two distributive lattices is a distributive lattice.

7. Let (𝐿, ≤) be a lattice in which ˄ and ˅ denote the operation of meet and join
respectively. For any 𝑎, 𝑏 ∈ 𝐿, prove that 𝑎 ≤ 𝑏 ⇔ 𝑎 ˄ 𝑏 = 𝑎 ⇔ 𝑎 ˅ 𝑏 = 𝑏.

8. Show that in a lattice distributive inequalities are true. (or) Prove that in a lattice (L,≤) for
any a,b,c  L, a   b  c    a  b    a  c  . (or) In a Lattice (L, ≤), prove that X  (Y  Z)
≤ (X  Y)  (X  Z). (or) Prove that in a lattice (L,≤) for any a,b,c  L, a  (b  c)  (a 
b)  (a  c).

9. Show that in a lattice isotonic property is true. (or) Let (L, ≤) be a lattice for any a, b,c 
L, if b≤c, prove that a*b≤ a*c and a  b≤a  c. (or) In a Boolean algebra, prove (i) 𝑏 ≤
𝑐 ⇒ 𝑎 . 𝑏 ≤ 𝑎 . 𝑐 and (ii) 𝑏 ≤ 𝑐 ⇒ 𝑎 + 𝑏 ≤ 𝑎 + 𝑐.
10. Prove that the modular inequality of a lattice {L,≤},viz for any a, b, c  L, a ≤ c
 a  b  c    a  b  c

11. Prove that (𝐿, ˄, ˅) is not a complemented lattice (under division relation) where 𝐿 =
{1,2,3,4,6,12} and also draw the Hasse diagram.
12. Determine whether the following partial ordering sets with the Hasse diagrams are
lattices.
13. Consider the Lattice 𝐷105 with the partial ordered relation, “divides” then
(1) Draw the Hasse diagram of 𝐷105 .
(2) Find the complement of each elements of 𝐷105 .
(3) Find the set of atoms of 𝐷105 .
(4) Find the number of subalgebras of 𝐷105 .
14. Let 𝐷100 = {1, 2, 4, 5, 10, 20, 25, 50, 100} be the divisors of 100. Draw the Hasse
diagram of (𝐷100, ̸ ) where ̸ is the relation “division”. Find (i) glb {10, 20} (ii) lub
{10, 20} (iii) glb {5, 10, 20, 25}
15. Prove that Demorgan’s laws hold good for a complemented distributive lattice L, ,  ,

viz  a  b   a  b and  a  b   a  b .(or) State and prove De Morgan’s law in a

Boolean Algebra.(or) In a Boolean algebra, show that (𝑎 ∗ 𝑏)′ = 𝑎′ ⊕ 𝑏′ and (𝑎 ⊕ 𝑏)′ =
𝑎′ ∗ 𝑏′ .

16. In any Boolean algebra, prove that the following statements are equivalent :
(i) a + b = b (ii) a * b = a (iii) a’ + b =1 and (iv) a * b’ = 0.