Jaya College of Engineeering and Technology

Discrete Mathematics
Question Bank

UNIT I - LOGIC AND PROOFS

PART A
1. Define proposition.
2. Define atomic statement.
3. Define disjunction and draw a truth table for it.
4. Give the truth table for conditional statement.
5. Write the truth table for bi-conditional statement.
6. Define a tautology.
7. Define a contradiction.
8. State De Morgan laws.
9. State the truth value of “ If tigers have wings then the earth travels round the sun”.
10. Write the negation of the following preposition: “To enter into the country you need a passport or a voter
registration card”.
11. Construct the truth table for q → (p q) → p
12. Whether (p → q ) v ( p v q) is a tautology
13. Verify (p q) v p is a tautology.
14. Define conjunctive normal form.
15. Write down the implication for modus ponens, modus tollens, hypothetical syllogism and
dilemma
16. Using the truth table show that p v (q → r) → (p q) r
17. S.T the statement is a contradiction (p q) ( p q) ( use Table)
18. Explain the two types of quantifiers with example.
19. Symbolize:” For every x, there exist a t s.t x2 + y 2 100
20. Using the predicate calculus symbolize “ x is the brother of the sister of y”
21. Symbolize the expression “ All the world loves a lover”
22. Express “ is an irrational number” using quantifier.

PART B
 20. State and explain the different types of proof methods. (MAY/DEC 2014)

UNIT II- COMBINATORICS

PART A
1. State the principle of strong induction.
2. Use mathematical induction to show that 1 + 2 + 3 + ⋯ + n =n(n+1)/2
3. Use mathematical induction to show that n! ≥ 2n+1 , n = 1,2,3,...
4. What is well ordering principle?
5. How many permutations are there in the word MISSISSIPPI?
6. State the Pigeonhole principle.
7. What is the number of arrangements of all the six letters in the word PEPPER?
8. How many permutations of {a,b,c,d,e,f,g} starting with a?
9. In how many ways can all the letters in MATHEMATICAL be arranged?
10. Find the minimum of students needs to guarantee that 5 of them belongs to the same subject if there are 5
different major subjects
11. How many different bit strings are there of length seven?
12. Twelve students want to place order of different ice creams in a ice cream parlor, which has six type of ice
creams. Find the number of orders that the twelve students can place.
13. How many permutations are there in the word MALAYALAM?
14. Find the recurrence relation for the Fibonacci sequence.
15. Solve the recurrence relation (k) − 8y(k − 1) + 16y(k − 2) = 0, k ≥ 2, where y(2) = 16 and y(3) = 80.
16. Find the recurrence relation of the sequence s(n) = an, n ≥ 1
17. Find the number of non-negative integer solutions of the equation x1 + x2 + x3 = 11
18. Determine whether the sequence {an} is a solution of the recurrence relationan = 2an−1 − an−2,
n=2, 3, 4, ... where an = 3n for every non negative integer n.
19. What is the solution of the recurrence relation an = 6an−1 − 9an−2 with a0 = 1, a1 = 6
20. Find the recurrence relation satisfying the equation yn = A(3)n + B(−4)n

PART B
1. Using induction principles prove that n3 + 2n is divisible by 3.
2. Use this identity to construct an inductive definition of the binomial co-efficient.
3. If we select ten points in the interior of an equilateral triangle of side 1 ,show that there must be atleast two
points whose distance apart less than 1/3 .
4. From a club consisting of six men and seven women, in how many ways we select a committee of (1) 3 men and
4 women? (2) 4 persons which has at least one woman? (3) 4 persons that has at most one man? (4) 4 persons
that has both sexes?
5. There are three files of identical red, blue and green balls, where each filescontains at least 10 balls. In how
many ways can 10 balls be selected? (1)If there is no restriction. (2) If at least 1 red ball must be selected. (3) If
at least 1 red, at least 2 blue and at least 3green balls must be selected. (4) If at most 1 red ball is selected.
6. State the strong induction (the second principle of mathematical induction). Prove that a positive integer >1 is
either a prime number or it can be written as product of prime numbers.
7. If n pigeonholes are occupied by (kn + 1) pigeons, where k is a positive integer, prove that at least one
pigeonhole is occupied by (k + 1) or more pigeons. Hence, find the minimum number of m integers to be
selected from S = {1, 2,3 ... 9} so that the sum of two of m integers is even.
8. In how many ways can six boys and four girls be arranged in straight line so that no two girls are sit together.
9. How many bits of string of length 10 contain
(1). Exactly four 1’s (2). At most four 1’s 3. At least four 1’s 4. An equal number of 0’s and 1’s
10. 6.(b) Prove by mathematical induction that 6n+2 + 72n+1 is divisible by 43, for each positive integer n.
11. Let m be any odd positive integer. Then prove that there exist a positiveinteger n such that m divides 2n − 1
12. Prove that in a group of six people at least three must be mutual friends or at least three must be mutual
strangers.
13. 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 both French and Russian. If 2092 students have taken at least
one Spanish, French and Russian, how students have taken a course in all three languages?
14. Prove that the number of subsets of a set having n elements is 2n
15. Solve the recurrence relation an = −3an−1 − 3an−2 − an−3 with a0 = 5, a1 = −9 and a2 = 15.
16. Find the solution to the recurrence relationan = 6an−1 − 11an−2 + 6an−3 with initial conditions a0 = 2, a1 = 5 and a2
= 15
17. Solve the recurrence relation an+1 − an = 3n2 − n, n ≥ 0, a0 =3
18. Use the method of generating function to solve the recurrence relation
an = 4an−1 − 4an−2 + 4n; n ≥ 2 given that a0 = 2 and a1 = 8.
19. Solve the recurrence relation an = 3an−1 + 2, n ≥ 1, ith a0 = 1 by the method of generating function
20. Find the number of integers between 1 to 250 that are not divisible by any of the integers 2,3,5 and 7
21. Determine the number of positive integer n, 1 ≤ n ≤ 2000 that are not divisible by 2, 3 or 5 but are divisible by 7.
22. Use the method of generating function to solve the recurrence relation
sn + 3sn−1 − 4sn−2 = 0, where n ≥ 2, s0 = 3, s1 = −2
23. Find the generating function of Fibonacci sequence.
24. A factory makes custom sports cars at an increasing rate. In the 1st Month only one car made, in the 2 nd month
two cars are made, and so on with n cars made in the n th month.(1) Set up the recurrence relation for the number
of cars produced in the first n month by this factory.(2) How many cars are produced in the 1styear?
25. Find all solutions of the recurrence relation an − 2an−1 = 2n2, n ≥ 1, a1=4.

UNIT III- GRAPHS

PART A

1. Draw the complete graph K5(NOV/DEC2015)

2. Define simple graph with an example. (NOV/DEC2015)
3. Define self-complementary graph (MAY/JUNE 2016
4. How many edges are there in 10 vertices of each degree 5(MAY/JUNE 2016)
5. Define a complete graph (NOV/DEC 2016
6. Define self loop graph with an example.(APR/MAY 2012)
7. Draw a parallel edge graph (NOV/DEC 2014).
8. Define Euler’s graph.(APR/MAY 2014)
9. Define Hamiltonian graph.(MAY/JUNE 2015)
10. What is directed graph and undirected graph.(NOV/DEC 2015))
11. Define connected graph with an example.(APR/MAY 2010)
12. Define Euler’s path.(NOV/DEC 2013)
13. Define Hamiltonian path.(APR/MAY 2013)
14. Explain Euler’s circuit. (NOV/DEC 2014)
15. Explain Hamiltonian circuit.(APR/MAY2012)
16. Define Regular graph with an example.(NOV/DEC 2012)
17. What is complete graph? Give an example for that.(APR/MAY2011)
18. Define complete bipartite graph with an example.(OCT/NOV2011)
19. State Hand Shaking Theorem.(APR/MAY 2009)
20. Define graph isomorphism.(NOV/DEC 2011)

PART B
1. Draw 1, 2, 3, 4 and 5 graphs.(NOV/DEC 2012)
2. Find the adjacency matrix of the following two graphs. (APR/MAY2013)

3. Determine whether the following graphs G and H are isomorphic. Give reason.(NOV/DEC 2016)

4. State and Prove Hand Shaking Theorem.(NOV/DEC 2011)

5. Give an example of a graph which is
(a) Eulerian but not Hamiltonian
(b) Hamiltonian but not Eulerian(APR/MAY 2014)

6. Draw the graphs for the following (NOV/DEC 2014, 2016)

(a) Both Eulerain and Hamiltonian.
(b) non Euleraian and non-Hamiltonian.
7. Define Adjacency matrix with an example.(APR/MAY 2013)
8. Prove that the maximum number of edges in a simple disconnected graph G with n vertices and k components is
( − )( − − 1)⁄2
9. Prove that a connected graph is Euler graph if and only if every vertex of is of even degree.
10. Prove that the complement of a disconnected graph is connected.
11. Prove that the following statements are equivalent for a simple
connected graph.1.G is Eulerian. 2. Every vertex of has even degree.
12. Explain cut edges and cut vertices with suitable example.
13. The sum of all vertex degree is equal to twice the number of edges (or)
the sum of the degrees of the vertices of is even.
14. Draw the complete graph 5 with vertices A, B, C, D, E. Draw all complete sub graph of 5 with 4 vertices.
15. Briefly explain about sub graph with example.

UNIT IV- ALGEBRAIC STRUCTURES

PART A
1. Define algebraic system with an example.
2. Define homomorphism with example.
3. Define epimorphism with example
4. Define monomorphism with example
5. Define isomorphism with example.
6. Define endomorphism with example
7. Define automorphism with example
8. Define sub algebra with example.
9. Define factor algebra with example.
w
10. Define semi group with example.
11. Define monoid with example.
12. Define semi group homomorphism.
13. Define monoid homomorphism
w
14. Define sub semi group with example.
15. Define sub monoid with example.
16. Define direct product with example.
w
17. Give an example which is a semi group but not monoid.
18 P.T the identity element of a group is unique.
19. P.T: Intersection of two normal subgroup of a group is a normal subgroup.
.
20. Give a necessary and sufficient condition for non-empty subset of a group( G *) to be a
subgroup of G
p
21. S.T by using an example “ the union of two subgroup of a group G need not be a subgroup”
22. Let G be a group s.t x2 = x for all x (G. S.T G is abelian.

divides b.
24. Give an example for non- abelian group.
25. Define normal sub group
o
23. Find the GLB & LUB of the set {3, 6, 12 } if they exist in the poset ( Z+, / ) where a/b stands for a

26. Define group codes.

27. Give an example of a finite non abelian group. r
1)
2)
PART B
i
S.T if every element in a group is its own inverse, then the group must be an abelian.
S.T every finite group of order n is isomorphic to a permutation group of degree n.
3)
4)
5)
If f: G → G1 is a group homomorphism P.T Ker f is a normal subgroup of G.
y
Prove that the collection of even permutations is a normal subgroup of the symmetric group.
P.T the intersection of any two normal subgroup of a group is normal.
6)
a
Define a coset of a subgroup H of a group G. Find all the left cosets of the subgroup
H =( p1, p2) of the symmetric group S3 where_ EMBED Equation.3 _Is H a normal subgroup of G?
7) Define the term weight and distance in the context of group codes. S.T the minimum weight

a
of the nonzero code words in a group code is equal to its minimum distance.
8) S.T the set N of natural number is a semi group under the operation x * y = max{x, y}. Is it a
monoid? Is the operation commutative?
9) State & prove Lagrange’s theorem for groups.

of g is a normal subgroup of G.
11) P.T every subgroup of a cyclic group is cyclic.
n
10) Let (G,*) and (H,*) be groups and g: G ( H be a homomorphism. Then prove that the kernel

12) S.T a non empty subset of H of a group ( G,* ) is a subgroup of G iff a,b ϵ
H ( a * b -1) ϵ H
13) P.T every cyclic group of order n isomorphic to the group (Zn , tn ).
P.T the order or a group of a finite group divides the order of the group.
.
14) P.T the subgroup of a cyclic group is also cyclic
i
n
15) State and prove the cayleys theorem on permutation group
16) S.T every subgroup of a cyclic group is normal
17) Define subgroup If A & B are two subgroup of (G,*), P.T A ϵ B is a subgroup of (G,*). Is A U
B a subgroup of (G,*)
w
18) P.T any semigroup can be extended to monoid by adjoining an identity element. P.T for any
commutative monoid ( M,*) the set of idempotent elements of M forms a submonoid

UNIT V- LATTICES AND BOOLEAN ALGEBRA

PART A
1. Define the transitive closure of a binary relation R with an example
w
2. Define least and greatest member of a poset.
3. Define a partial ordering relation with an example w
4. Let R1 & R2 be two compatible relations on a set A. Is R1 R2 a compatible relation?
5. If A = { x / x2 – 1 = 0} and B = { x / x2 - 3x + 2 = 0 }Find A B and A – B
.
6. Define partial order relation and find a partial ordering on the power set of a given set.
7. Let T = {1, 2, 3, 4, 5}. How many subset of T have less than 4 elements?

9. Draw a Hasse – diagram of the set of partitions of 5

10. Define reflexive closure of a set.
11. Give an example for the composition of two function which is not commutative
p
8. Give an example of a relation on a set which is neither symmetric nor anti symmetric

12. Define partial order relation.

13. Obtain the power set of { a, b ,c } o
14. Establish the binary relation on the set A = { 1, 3, 5 }which is a symmetric relation
15. What are disjoint sets? Give an examples
16. List all the proper subsets of { 1,2,3}
17. Let A = { 1,2,3,4} and r be the relation ( on A. Draw the Hasse diagram of r.
r
18. Let R be the relation on A = { 2,3,4,6,9} defined by “ x is relatively prime to y” Write R as the set of
order pairs.
19. Define least element of a poset.
20. Define distributive lattice.
i
21. In a lattice ( L, ) using usual notation S.T a ( a b ) = a for all a,b v L
22. Define a lattice
23. Simplify the Boolean function (f(x , y) = x+ xy
y
24. In a Boolean algebra, P.T a = b ( ab’ + a’b = 0
25. In a Boolean algebra, S.T ( a+ b) ( a’ + c)= a’b + ac + bc
26. In a Boolean Algebra a ϵ ( a’ v b)= a b
27. P.T every finite lattice is bounded.
a
28. In Boolean algebra B, P.T a + a.b = a where a,bv B.
29. List The three elements sub sets of { a,e.i,o,u}
30. Is ( z, - ) is a semi group . Justify.
a
31. P.T in a lattice (L, ϵ ), a 0 = 0 v a = a v L.
n
32. If A= {2,3} ( X = { 2,3,6,12,24,36} and the relation ϵ is s.t x y if x divides y, find the least and greatest
element for A
w
is such that = { (x,y): x A, y ϵ A (x divides y)}
34. Is the lattice of devisors of 32 a Boolean algebra?
w .
33. Draw the Hasse diagram of (X, ) where X is the set of positive divisors of 45 and the relation

PART B

w i
1) Let (P, ϵ ) be a partially ordered set. Suppose the length of the largest chain in P is n. Then

. n
 show that the elements in P can be partitioned into a disjoint antichain.
2) Let R be a binary relation on the set of all strings of 0’s & 1’s such that R= {(a,b) / a & b
are strings that have the same number of 0’s }. Is R reflexive? Symmetric? Anti symmetric?
Transitive? An equivalence relation? A Partial order relation
3) If A,B and C are sets prove that A (B C) = ( A u B ) (A u C)
4) Let X = ({ 1, 2, 3, 4, .....................20} and R ={(x,y) / x-y is divisible by 5 } be a relation
on X. S.T R is an equivalence relation
5) Explain WARSHALL ‘s algorithm
6) If A, B and C are any three sets, P.T A- ( B C ) = ( A – B ) u (A – C ).
7) Let X = { 1, 2, 3, 4, 5, 6, 7 } and R = { < x, y > | x-y is divisible by 3}. S.T R is an
equivalence relation.
8) If A , B & C are sets P.T Au ( B u C) = ( A B) u ( A C) with out Venn diagram.
9) If the relation R is defined by xRy iff x= (y (mod 5) on S = ( 1, 2, 3, ........ 20) verify that
R is an equivalence relation. Find also the partition of S induced by R.
10) Check whether ( P(S) , u ) is a poset where P(S) is the power set of S and the relation is “
subset”. If it is a poset, determine whether it is lattice or not.
11) Draw the Hasse diagram for divisibility on the set {1, 2, 3, 5, 11, &13} Is it a lattice?
12) Let R be a binary relation and S= {(a,b)/(a,c) (R and (c,b) ϵ R for some c} P.T if R is an
equivalence relation , then S is also an equivalence.
13) Given R be a reflexive relation on a set A, S.T R is an equivalence relation iff (a,b) &
(a,c) are in R implies that (b ,c) is in R.
14) If R is an equivalence relation on an arbitrary set, P.T the set of all equivalence classes
constitute a partition of A.
15) Consider the subset A= {1,7,8} B={ 1,6,9,10} & C = ( 1,9,10} where U = ( 1,2,3,…..10}
List the non empty mini sets generated by A,B,& C . Do they form a partition of U.
16) If A,B & C are sets . P.T A x ( B ϵC ) = ( A x B ) u ( A x C)
17) For any two sets A & B , P.T A – ( A u B ) = A – B
18) Given S = { 1,2,3 … 10 } and the relation R on S where R = { (x,y) / x+ y = 10 }what are the
properties of the relation.
19) Let X = { 1,2, …. 7} and R { (x,y) / x- y is divisible by 3 } S.T R is an equivalence
relation Draw the graph of R.
20) If the relation R defined on S = {1,2,3,…20} br xRy iff x u y (mod 5) verify that R is an
equivalence relation. Find also partition of S induced by R
21) Simplify the Boolean function f( A, B, C, D) = ( (0, 2, 3, 4, 8, 9, 10, 13)
22) Define a lattice homomorphism. S.T a lattice homomorphism preserves the partial order
structure. Give an example for isomorphic lattices.
23) Define a distributive lattices with an example. Let ( L,+,Ξ ) be a distributive lattice . S.T for
any a, b, c L a*b = a*c and a ϵ b = a c imply b = c. Hence S.T If L has a complement, it is
unique.
24) S.T any finite Boolean algebra is isomorphic to the Boolean algebra of a power set.
25) For any Boolean algebra, S.T a = b iff ab’ + a’b = 0
26) Define an algebraic lattice L. Define a relation on L in such a way that L become a lattice as a
partial ordered set
27) Let R be the set of real numbers 0n [0, 1] and be the usual operation of “ less than or equal to
“ on R . S.T (R., ) is a lattice. What are the operations to meet and join on this lattice?
28) In a Boolean algebra, P.T(a+b’)b + c’)(c+a’)=(a’+b)(b’+c)(c’+a).
29) In any Boolean algebra S.T (a.b’)+(b.a’)=(a+b). (a’+b’)
30) Define a complemented lattice. P.T the complement a’ of any element “a” in a
complemented lattice is unique. w
w
31) Let f , f1 & f2 be three functions from Bn to B P.T is s(f) = s(f1)(s (f2), then f(b) = f1(b)(f
2(b) , b B . Hence P.T any function f : Bnϵ B is produced by Boolean function.
32) Simplify the Boolean function F(x,y,z) = (x’(z)((x’(y) ((x(y’(z) ((y(z)
33) Find the sum-of-product form of the Boolean function f(x,y,z,w) = xy + yw’z
34) Let R be a relation on a set A . Then define R-1 ={(a,b)(AxA /(b,a) →R. P.T if ( A, R ) is a poset
then (A, R-1) is also poset.
35) In the Boolean algebra of all divisors of 70, find all subalgebras.
36) Draw the Hasse diagram of (P(A),() where P(A) denotes the power set of A= { a,b,c}
37) Define a Boolean algebra and S.T by an example no five element Boolean Algebra can exist