Sub. Name & Code: Discrete Mathematics, MA3354 Dept.

of IT AY: 2022-23

II-YEAR B.TECH. (IT) – Semester III

Question Bank – MA3354 Discrete Mathematics
UNIT 1 - LOGICS AND PROOFS
PART A
Write in symbolic form “If you work hard, then you will be rewarded”
1
[April/May- 2019]
Answer:
Let p: ‘you work hard’ and q: ‘you will be rewarded’
Symbolic Form: p  q
2 Write the truth table for the formula ( p  q)  (p  q). [April/May- 2015]
Answer:
p q p q p  q p  q ( p  q)  (p  q).

T T F F T T T
T F F T F T F
F T T F T F F
F F T T T T T
3 Construct the truth table ( P  Q)   P  Q  [Nov/Dec -2019]
Answer:
P Q PQ ( P  Q) ( P  Q)   P  Q
T T T T T
T F T F T
F T T F T
F F F F T
When do you say that two compound propositions are equivalent?
4
[Nov/Dec -2021]
Answer:
Two statements A and B are equivalent if and only if A  B is a tautology. It is
denoted by the symbol A  B which is read as “A is equivalence to B”
5 Prove that  p  q    p  q    p  q 
Answer:
 p  q    p  q   q  p   p  q   q  p 
 p  q   p  p   q  q    p  q 
 p  q    p  q 
6 Show that p   q  r    p  q   r without using truth tables.
Answer:
p  q  r   p  q  r   p  q   r   p  q   r   p  q   r
Show that ( p  r )  (q  r ) and ( p  q)  r are logically equivalent.
7
[Nov/Dec- 2014]

St. Joseph’s Institute of Technology 1

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Answer:
We have to show that, ( p  r )  (q  r )  ( p  q)  r
( p  r )  (q  r )  (p  r )   q  r   (p  q)  r  ( p  q)  r  ( p  q)  r
What are the contrapositive, the converse and the inverse of the conditional
8
statement, “ If there is a rain ,then I buy an umbrella” [Nov/Dec -2016]
Answer:
Contrapositive:  q →  p
That is “If I don’t buy an umbrella, then there is no rain”
Converse: q → p
That is “If I buy an umbrella, then there is rain”
Inverse:  p →  q
That is “ If there is no rain ,then I will not buy an umbrella”
Obtain converse, contra positive and inversion of “Team India wins
9
whenever Dhoni is Captain”
Answer:
Let P: Dhoni is captain & Q: Team India wins
The given statement can be rewritten as “If Dhoni is captain, then Team India wins”
(i.e) p  q
Contrapositive:  q →  p
That is “If Team India does not win, then Dhoni is not captain”
Converse: q → p
That is “If Team India wins, then Dhoni is captain”
Inverse: p  q
That is “ If Dhoni is not captain, then Team India does not win”
10 Find the Contra positive of the inverse of p  q
Answer:
Given: p  q as the conditional statement
Inverse of p  q is p  q
The contra positive of p  q is  q    p  which is q  p
What is the duality law of logical expression? Give the dual of
11 ( P  F ) (Q T )
Answer:
In an expression, if we replace ,, T, F respectively by ,, F, T the resulting new
formula is the dual of the given expression.
 Dual of the given formula: ( P  T )  (Q  F )
12 Define PDNF
Answer:
For a given statement formula, an equivalent formula consisting of disjunction of
minterms only is known as its Principal Disjunctive Normal Form (PDNF).
(i.e.)  Minterms    Minterms    Minterms  ...   Minterms 

St. Joseph’s Institute of Technology 2

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

13 Define PCNF
Answer:
For a given statement formula, an equivalent formula consisting of conjunction of
maxterms only is known as its Principal Conjunctive Normal Form (PCNF).
(i.e.)  Maxterms    Maxterms    Maxterms  ...   Maxterms 
14 Define Universal quantification and Existential quantification.
Answer:
The Universal quantification of a predicate formula P(x) is the proposition, denoted
by xP(x) that is true if P (a) is true for all subject a.
The Existential quantification of a predicate formula P(x) is the proposition, denoted
by xP(x) that is true if P(a) is true for some subject a.
Rewrite the following using quantifiers “Every student in the class studied
15
calculus”.
Answer:
Let 𝑃(𝑥): 𝑥 is a student and 𝑄(𝑥): 𝑥 studied calculus
Symbolic form xP( x)  Q( x)
16 Write the statement in symbolic form “Some real numbers are rational”.
Answer:
Let 𝑅(𝑥): 𝑥 is a real number and 𝑄(𝑥): 𝑥 is rational
Symbolic form: x  R  x   Q  x .
Given P = {2,3,4,5,6} state the truth value of the statement ( x  P) ( x +3=10)
17
[April/May- 2015]
Answer:
P = {2,3,4,5,6}, None of the values taken from the set P satisfies the Equation ( x
+3=10)
 Truth value of the quantified statement is false.
Let E= {-1, 0, 1, 2} denote the universe of discourse. If P( x, y ) : x  y  1, find
18
the truth value of ( x )( y ) p( x, y ). [May/June-2014]
Answer:
(x)(y) p( x, y) denotes the proposition “For every real number x there is a real
number y such that P( x, y) .” The statement (x)(y) p( x, y) is true for this universe
since -1+2=1,0+1=1
Using indirect method, prove the statement “If n is an integer and (3n + 2))
19
is odd, then n is odd”. [Nov/Dec -2020]
Answer:
Assume the conclusion of this implication is false.
That is, n is even (n = 2l, for some l) which implies 3n + 2 = 3(2l) + 2 = 2 (3l + 1),
even
Negation of the conclusion of the implication implies that the hypothesis is false.
Hence the implication is true.

St. Joseph’s Institute of Technology 3

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Prove that the sum of an irrational number and a rational number is

20
irrational.
Answer:
Assume a is rational number and b is a rational number
Claim: a + b is a irrational
Suppose not, (i.e) a + b = c is a rational……….(1)
We know that sum of two rational number is rational,
From (1), we have b = c - a = c + (-a) is a rational.
Which is a contradiction to our assumption that b is irrational.
Therefore, the sum of an irrational number and a rational number is irrational.
PART B
1 When do we say a formula is tautology or contradiction?
Without using truth table, show that Q  ( P  Q)  (P  Q) is a tautology.
[Nov/Dec-2021]
2 Prove that p  q  p  p  q
3 Obtain PCNF and PDNF of the formula ( P  Q)  (P  R)  (Q  R)
[Nov/Dec-2018]
4 Obtain the principal disjunctive and conjunctive normal forms of the
formula (P  R)  (Q  P ). [Nov/Dec -2019]
5 Construct an argument to show that the following premises imply the
conclusion "It rained". "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”. [Nov/Dec -2020]
6 Prove that the premises P  Q,Q  R, R  S , S  R and P  S are
inconsistent. [Nov/Dec -2017]
7 Using indirect method, show that R  Q, R  S , S  Q, P  Q  P
[Nov/Dec -2020]
8 Show that the premises “A student in this class has not read the book” and
“Everyone in this class passed the semester examination” imply the
conclusion “Someone who passed the semester examination has not read
the book”. [Nov/Dec -2020]
9 Show that x( p( x)  q( x))  xp( x)  xq( x) using the indirect method.
[April/May-2015]
10 Prove that 2 is irrational by giving a proof using contradiction.
[May/June-2016] & [Nov/Dec-2021]

St. Joseph’s Institute of Technology 4

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

UNIT II COMBINATORICS
PART A
1. Using the principle of mathematical induction, show that
1 + 3 + 5 + … + (2n-1) =n2 [Nov/Dec -2020]
Answer:
Let P(n) :1+3+5+…+(2n-1) = n2
Base step: P (1): 1=12= 1
 P(1) is true.
Inductive step: Assume that P(k) is true, i.e.1+3+5+…+(2k-1) = k2
Consider P(k+1)
Now 1+3+5+…+(2k-1) + (2k+1) = k2+(2k+1) = k2+2k+1=(k+1)2
 P (k+1) is true i.e. P(k)  P(k+1)
 By induction, 1+3+5+…+(2n-1) = n2
2. Prove that if n and k are positive integers with n = 2k, then nk! is an integer.
2
Answer:
Given n and k are positive integers and n = 2k.
n!  2k !
Let P  k    k
2k 2
 2 !
Basestep : P 1  1  1,is an integer
2
Inductivestep : Assume that P  t  is true. That is P  t  
 2t ! is an integer.
2t
We have to prove that P t 1 is true.

P  t  1 
 2  t  1 !   2t  2 !
2t 1 2t 1

 2t  2  2t  1 2t !
2t . 2
 2t !
 t  1 2t  1 ,for any positive value of t, it is also an integer.
2t
n!
 P  t  1 is an integer. Hence is an integer.
2k
3. State pigeon hole principle. [Nov/Dec - 2021]
Answer:
If (n + 1) pigeons occupy n holes then at least one hole has more than 1 pigeon.
4. Show that in any group of 8 people at least two have birthdays which fall on
same day of the week in any given year. [Nov/Dec 2018]
Answer:
Let n be the number of people. n = 8
St. Joseph’s Institute of Technology 5
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Let m be the days of the week. m = 7

By generalization of pigeon hole, the least number of pigeons accommodated in one of
the pigeonholes
 n  1  8  1
  1   1  2
 m   7  
5. How many solutions does the equation x1  x2  x3  11 have, where x1 , x 2 and x 3
are non-negative integers? [Apr/May 2019]
Answer:
Let n = Total number of solutions. Here r = 3 and n = 11.
The number of non-negative integer solution is
 n  r  1 C
n
 (11  3  1)C  13C  78
11 11

6. Find the number of bit strings of length 10 that either begin with 1 or end
with 0. [Nov/Dec 2019]
Answer:
By product rule, the number of bit string = 210 = 1024 ways
7. State the inclusion and exclusion principle. [Nov/Dec - 2021]
Answer:
Let X and Y be two finite subsets of a universal set U.
If X and Y are disjoint, then X  Y  X  Y
If X and Y are not disjoint, then X  Y  X  Y  X  Y
8. There are 5 questions in a question paper in how many ways can a boy solve
one or more questions?
Answer:
The boy can dispose of each question in two ways. He may either solve it or leave it.
Thus, the number of ways of disposing all the questions= 25
But this includes the case in which he has left all the questions unsolved.
The total no of ways of solving the paper = 25 1 = 31.
9. What is well ordering principle? [May/June 2014]
Answer:
Every non empty set of non-negative integers has the least element.
10. In how many different ways can five men and five women sit around a table?
[Nov/Dec 2019]
Answer:
In a circular arrangement, total permutation is (n – 1)!
Hence the number of ways can five men and five women sit around a table is
(5 – 1)! = 4! = 24
11. Find the recurrence relation whose solution is S  n = a n , n ≥ 1 .
[Nov/Dec 2016]
St. Joseph’s Institute of Technology 6
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Answer:
an
Given S  n   a n  S  n  1  a n1 
a
 S  n   aS  n  1 is the required recurrence relation.
12. Find the associated homogeneous solution for an  3an1  2n .
Answer:
Its associated homogeneous equation is an  3an1  0
Its characteristic equation is r – 3 = 0  r = 3.
Now, the solution of associated homogeneous equation is an  A .3
n

13. Solve an  5an1  6an 2  0 . [Nov/Dec 2018]

Solution:
The characteristic equation is r 2  5r  6  0  r1  2, r2  3
 Thesolution is an  A2n  B3n
14. Define Generating function.
Answer:
The generating function for the sequence a0 , a1 ,.........an …, of real numbers is the infinite
series.

G(x) = a0  a1 x  .........  an x  ..... =  an x n .
n

n 0

15. Find the generating function for the sequence ‘s’ with terms
1, 2, 3, 4, …
Answer:

G( x)  G (s, x)   (n  1) x n = 1  2 x  3x2  .......... = (1  x)2 
1
.
n 0 (1  x)2
16. How many permutations of (a, b, c, d, e, f, g) end with ‘a’?
[Nov/Dec 2014]
Answer:
The number of permutations 6!  1!  720
17. How many different words are there in the word ENGINEERING?
[May/June 2016]
Answer:
11 ! 39916800
Number of arrangements = =  69300
3 !3 !2 !2 !  6  6  4  4 
18. State the principle of strong induction. [May/June 2014]
Answer:

St. Joseph’s Institute of Technology 7

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Let P (n) be a proposition. The principle includes two steps

Step 1 (Basis step) P(1) is true
Step 2 (induction step) If P(j) is true for j = 2, 3, … k then P(k+1) is true
i.e. [P (2)  P (3)  …  P (k)]  P(k+1) is true for every positive integer k.
19. How many students must be in a class to guarantee that at least two students
receive the same score on the final exam if the exam is graded on a scale from
0 to 100 points?
Answer:
There are 101 possible scores as 0, 1, 2 … 100.
By Pigeon hole principle, we have among 102 students there must be at least two
students with the same score.
The class should contain minimum 102 students.
20. Find the recurrence relation for the Fibonacci sequence.
Answer:
The recurrence relation corresponding to the Fibonacci sequence  fn  , n  0, is
f n2  f n1  f n , n  0 with initial conditions f0  0, f1  1.
PART B
1. Prove by mathematical induction that for every positive integer n, 3 divides
n3 – n [Nov/Dec 2021]
2. Using mathematical induction, prove that every integer n  2 is either a prime
number or product of prime numbers. [Nov/Dec -2020]
3. There are six men and five women in a room. Find the number of ways four
persons can be drawn from the room. (i) They can be male or female, (ii) Two
must be men and two women (iii) They must all be of same sex.
[May/June 2016]
4. Determine the number of positive integers n, 1  n  2000 that are not
divisible by 2, 3 or 5, but are divisible by 7. [Nov/Dec -2020]
5. How many bit strings of length 10 contains (a) exactly four 1’s (b) at most four
1’s (c)at least four 1’s (d) an equal number of 0’s and 1’s
[Nov/Dec 2016]
6. 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 of Spanish, French and Russian, how
many students have taken a course in all three languages?
[Nov/Dec -2017]
7. Solve the recurrence relation an  2  an1  an2  where n  2, a0  1, a1  2 .
[Nov/Dec -2020]

St. Joseph’s Institute of Technology 8

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

8. Prove that in any group of six people there must be at least three mutual
friends or three mutual enemies. [Nov/Dec 2015]
9. Using generating function method solve the recurrence relation,
an 2  2an1  an  2n where n  0, a0  2 and a1  1 . [Apr/May 2019]
Solve an  8an1  10 with a0  1 and a1  9 using generating function.
n 1

10.
[Nov/Dec 2019]

UNIT III GRAPHS

PART – A
1. Define Graph
Answer:
A graph 𝐺 = (𝑉, 𝐸) consists of 𝑉, a non-empty set of vertices (nodes or
points) and 𝐸, a set of edges (lines).
2. Define Digraph and Undirected graph
Answer:
A Graph in which every edge is directed edge then it is called a Digraph.

A Graph in which every edge is an undirected edge then it is called an

Undirected graph.

3. Define Complete graph. [Nov/Dec 2016] [Nov/Dec 2021]

Answer:
A graph in which any two distinct vertices are adjacent is called a complete
graph and is denoted by Kn.
4. How many edges are there in a graph with 10 vertices each of
degree 7 ?
Answer:
n

 deg(v )  2e
1
i

 10  7  2e
 2e  70
 e  35
St. Joseph’s Institute of Technology 9
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

5. Draw the Complete graph K6.

Answer:
The Complete graph K6 is

v1 v2

v6 v3

v5 v4
6. What is the degrees of vertices for the given graph G.

v1 v2
v3

v4 v5

Answer:
deg v1  2
deg v2  1
deg v3  6
deg v4  2
deg v5  3
7. Define Bipartite Graph and Complete bipartite graph with an
example.
Answer:
A graph G is called a bipartite graph if V can be partitioned into two
disjoint subsets V1 and V2 such that each edge of G has one end in V1 and
another end in V2.
Example: The bipartite graph of K3,4 is
V1

V2

St. Joseph’s Institute of Technology 10

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

A complete bipartite graph is a bipartite graph with bipartition V1 and V2 in

which each vertex of V1 is joined by an edge to each vertex of V2, there should
be no adjacent vertices within V1 and V2. It is denoted by 𝐾𝑚,𝑛 .
Example. The complete bipartite graph of K3,4 is
V1

V2

8. Define Connected graph.

Answer:
A graph for which each pair of vertices is joined by a trail is called
connected graph.
a b

c d

9. Define strongly connected graph. [Nov/Dec 2021]

Answer:
A digraph G is said to be strongly connected if for every pair of
vertices, both vertices of the pair are reachable from one another.

10. Does there exist a simple graph with the degree sequence 3,3,3,3,2 ?
Answer:
The degree sequence is 3,3,3,3,2
 deg vi  3  3  3  3  2
 14  even
The number of odd degree vertices is even.
Hence there is a graph with 5 vertices and with the given degree sequence

11. Write the adjacency matrix and incident matrix of K2, 2

[Nov /Dec 2019]

St. Joseph’s Institute of Technology 11

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Answer:

e3
e2 e4
e1

0 0 1 1  1 1 0 0 
0 0 1 1  0 0 1 1 
Adjacency matrix =   Incident matrix =  
1 1 0 0  1 0 0 1 
   
1 1 0 0  0 1 1 0 
12. How many vertices does a regular graph of degree four with 10 edges
have ?
Answer:
Given r = 4, q = 10
To find p:
We know that
2q  pr
2q 2(10) 20
p   5
r 4 4
p5
13. Define Isomorphism of two graphs. [May/June 2014]

Answer:
Two graphs G1 = (V1, E1) and G2 = (V2, E2) are said to be isomorphic
to each other, if there exists a one-to-one correspondence between the
vertex set.
14. Define self-complementary graph [May/June 2016]

Answer:
A simple graph 𝐺 is called self-complementary if 𝐺 and 𝐺 𝐶 are
isomorphic.

St. Joseph’s Institute of Technology 12

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

𝐺 𝐺𝐶
15. Define spanning sub graph and Induced subgraph.

Answer:
Let a graph H = (V1, E1) is a sub graph of G = (V, E). H is a spanning sub
graph of G if H is a subgraph of G with V1 = V and E1  E.
A graph H = (V1, E1) is a subgraph of G = (V, E). H is an induced subgraph
of G if H is the maximal subgraph of G with vertex set V1.

16. Define Eulerian Circuit.

Answer:
A circuit in a graph that includes each edge exactly once is called an
Eulerian circuit.
17. State the condition for Hamiltonian cycle.
Answer:
(i) Starting and ending vertex are same.
(ii)Cycle should contain all vertex of graph but exactly once

18. Give an example of a graph which is Eulerian but not Hamiltonian.

[Nov/Dec -2017, Nov 2019]
Answer:
b d

c
a e

g f

19. Give an example of non-Eulerian graph which is Hamiltonian.

[May/June 2013, May 2019]
Answer:
b

c
a

20 Identify the Hamilton path and Hamilton cycle in the given graph ?

St. Joseph’s Institute of Technology 13

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

g
a h c
f

d
Solution:
Hamilton cycle of the given graph is a,b,c,d,e,h,g,f,a
Hence the graph is a Hamilton graph
Also it contains Hamilton path
Hamilton path is a,b,c,d,e,f,g,h
PART - B
1 State and prove Handshaking theorem. Also prove that maximum
n(n  1)
number of edges in a connected graph with n vertices is
2
[Apr/May 2021]
2 Prove that number of vertices of odd degree in a graph is always
even. [Jan/Feb 2022]
3 Prove that an undirected graph has an even number of vertices of
odd degree. [Jan/Feb 2022]
4 Prove that for a bipartite graph with n vertices has a maximum of
n2
edges. [Nov/Dec2018]
4
5 If a graph G has exactly two vertices of odd degree, then prove that
there is a path joining these two vertices.
[Nov/Dec 2016]
Prove that a simple graph with n vertices and k components can
6 (n  k )(n  k  1)
have at most edges. [Nov/Dec 2015] [Nov/Dec 2017]
2
7 Define :
(i) Adjacency matrix
(ii) Incidence matrix with an example [Jan/Feb 2022]
8 If G is a self-complementary graph, then prove that G has 𝒏 ≡ 𝟎 (or)
1(mod 4) vertices. [May/June 2016, Nov/Dec 2019]

St. Joseph’s Institute of Technology 14

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

9 Draw the complete graph 𝑲𝟓 with vertices A,B,C,D,E. Draw all the
complete subgraph of 𝑲𝟓 with 4 vertices. [Jan/Feb 2022]
10 Check whether the following graphs are isomorphic or not.
(May/June2021)

11 Prove that a given connected graph G is Euler graph if and only if

all vertices of G are of even degree. [Nov/Dec 2015, Nov 2019]
12 If G is a connected simple graph with n vertices with n  3, such that
𝒏
the degree of every vertex in G is at least 𝟐, then prove that G has
Hamilton cycle. [May/June 2016]

UNIT – IV ALGEBRAIC STRUCTURES

PART – A
1. Define Algebraic system.
Answer:
A non-empty set G together with one or more n-ary operations say
'  ' is called an algebraic system. It is denoted by (G,  )
Example (Z, +) is an algebraic system.
2. Define Semi Group and Monoid (Apr/May 2022)
Answer:
Semi Group:
If a non-empty set S together with binary operation '  ' satisfying the
following two properties.
i  a  b  b  a, a, b  S (Closure property)
ii  a  b   c  a  b  c  , a, b, c  S (Associative Property)
Then  S ,   is called a semigroup.
Monoid:

St. Joseph’s Institute of Technology 15

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

A semigroup  S ,   with an identity element w.r.t. '  ' is called monoid. It is

denoted by  M ,  
3. In a group (G,  ) show that (a  b)1  b1  a 1a , b  G (May/June 2021)
Answer:
(a  b)1  b1  a 1 a, b  G
Let a, b  G and a 1 , b 1  G
a  a 1  a 1  a  e or
b  b1  b1  b  e
Now (a  b)  (b 1  a 1 )  a  (b  b1 )  a 1  a  e a 1  a  a 1  e
Similarly, we can prove (b1  a 1 )  (a  b)  e
Therefore (a  b) 1  b 1  a 1
4. Prove that if a has inverse b and b has inverse c, then a = c
(Nov/Dec 2021)
Proof:
Given ' a ' has inverse ' b '
a b  e
 b  a..................(1)
' b ' has inverse ' a '
bc  e
 c  b...................(2)
Now a  a  e
 a  (b  c)......(by (2))
 (a  b)  c.......(Associativity)
 e  c ...........(by (1))
c
a c
5. Define Group.
Answer:
An algebraic system (G,  ) is called a group if it satisfies the following
properties:
(i)  is associative.
(ii) Identity element exists.
(iii) Inverse element exists.
6. State any two properties of a group.
Answer: (i) The identity element of a group is unique.
(ii) The inverse of each element is unique.
7. Prove that identity element in a group is unique.
(Nov/Dec 2019, Nov/Dec 2021)

St. Joseph’s Institute of Technology 16

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Answer:
Let (G,  ) be a group.
Let ‘e1’ and ‘e2’ be the identity elements in G
Suppose e1 is the identity, then
e1  e2 = e2  e1 = e2
Suppose e2 is the identity, then
e1  e2 = e2  e1 = e1
Therefore e1= e2.
Hence identity element is unique.
8 Show that every element of a group G is self-inverse then G is
abelian (May/June 2021)
Answer:
Let (G,  ) be a group.
For a, b  G we have a  b  G
Given a  a1 and b  b1
(a  b)  (a  b) 1
 b 1  a 1
 ba
a b  b  a
G is abelian
9. Prove that in any group, identity element is the only idempotent
element. (Nov/Dec 2018)
Answer:
Let a be an idempotent element of G, then a  a  a.........(1)
1
Now a  G  a  G
pre multiply a 1 on both sides of (1)
a 1(a  a)  a 1  a      (2)
a 1
 a   a  a 1  a  e
ea  e
a  e
10. Let Z be the group of integers with the binary operation  defined
by a  b  a  b  2 for all a, b  Z . Find the identity element of the
group Z ,* (May/June 2016)
Answer:
a = a  e = a+e  2
a = a+e  2
e2 = 0
e= 2
11. Show that every cyclic group is abelian. (May/June 2016)
Answer:
St. Joseph’s Institute of Technology 17
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Let (G,  ) be a cyclic with ‘a’ as generator

 x, y  G  x  a m , y  a n  x  y  a m  a n  a m  n  a n  m  y  x
x y  yx
Therefore G is a abelian
12. Prove that the semigroup homomorphism preserves idempotency.
Answer:
Let a  S be an idempotent element.
 aa  a
g (a  a)  g (a)
g ( a) g ( a)  g ( a)
This shows that g (a) is an idempotent element in T.
Therefore, the property of idempotency is preserved under semigroup
homomorphism.
13. Prove that group homomorphism preserves identity.
(May /June 2019)
Answer:
Let f : (G, )  (G, )
Identity property is a  e = e  a = a,  a G
Consider a  e = a
f( a  e ) = f(a)
f(a)  f(e) = f(e)
f(e) is identity element of G 
(i.e) f(e) = e 
14. Let f : (G , )  (G ' ,  ) be a group homomorphism. Then prove that
 f (a) 
1
 f (a 1 ), a  G. (Nov/Dec 2018)
Answer:
Let a  G  a 1  G
W .K .T a  a 1  a 1  a  e
a  a 1  e  f (a  a 1 )  f (e)
f (a )  f (a 1 )  e '    (1)
Similarly f (a 1 )  f (a )  e '    (2)
From (1) and (2)
 f (a 1 ) is the inverse of f ( a)
Hence  f (a)   f ( a 1 )
1

15. Find all the left co-sets of H={1,-1} in the group (G,.) where
G={1,-1,i,-i}. (Apr/May 2022)
Answer:
G={1,-1,i,-i} which consists of the fourth roots of unity under multiplication.
H={1,-1} is a subgroup of G
St. Joseph’s Institute of Technology 18
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

The left cosets of H in G are

1H  1, 1  H=H1
i H  i, i  H i
16. State Cayley’s theorem.
Answer:
Every finite group of order ‘n’ is Isomorphic to permutation group of
degree ‘n’.
17. Define Ring. (May/June - 2014)
Answer:
An algebraic system (R, +,  ) is called a ring if the binary operations
+ and  satisfies the following.
(i) (R,+) is an abelian group
(ii) (R,*) is a semi group
(iii) The operation  is distributive over +.
18. Find the idempotent elements of G  {1,1, i,i } under the binary
operation multiplication. (Nov/Dec 2016)
Answer:
Idempotent condition a  a  a
1 1  1
i . i  i 2  1
i.  i  i 2  1
But 1.1  1
The idempotent element is 1
19. Define field in an algebraic system. (April/May 2015)
Answer:
A non-empty set (F, +,  ) is called a field if the binary operations + and 
satisfies the following.
(i)  F ,   is an abelian group
(ii)  F  0 ,  is an abelian group
(iii) Two distributive laws
20. Give an example of integral Domain which is not a field.
(Nov/Dec 2019)
Answer:
The ring Z of all integers is an integral domain but not a field.
PART – B
1  1 0   1 0 1 0    1 0  
Prove that G    , ,  ,   forms an abelian
  0 1   0 1   0  1  0  1 
group under matrix multiplication.
(Nov/Dec 2015)
2 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 (Nov /Dec 2019)
St. Joseph’s Institute of Technology 19
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

3 Show that the group  G,   is abelian if and only if

 a  b  a 2  b2 , a, b  G (Apr/May 2022)
2

4 Prove that intersection of two subgroups of a group G is again a

subgroup of G, but their union need not be a subgroup of G.
(Nov/Dec 2015)
5 Show that the kernel of a group homomorphism is a normal
subgroup of the group. (Apr/May 2022, Nov/Dec 2021)
6 Prove that intersection of two normal subgroups of a group G is
again a normal subgroup of G. (Nov/Dec 2018, Nov/Dec 2016)
7 State and Prove Lagrange’s theorem on finite groups (or) Prove
that in a finite group, order of any subgroup divides the order of
the group. (May/June2021 , Nov/Dec 2021)
8 Prove that every subgroup of a cyclic group is cyclic.
(May/June 2019, Apr/May 2022)
9 Prove that the set Z4  0,1,2,3 is a commutative ring with respect
to the binary operation  4 and 4 (Nov/Dec -2017)
10 Discuss Ring and Fields with suitable examples. (Nov/Dec 2014)

UNIT-V LATTICES AND BOOLEAN ALGEBRA

PART – A
1. Define partial ordering on S. (Nov/Dec 2016) (Nov/Dec 2018)
Answer:
A relation  on a set S is called a partial ordering on S if it satisfies reflexive,
anti-symmetric, transitive properties. A set S together with a partial ordering
is called a partially ordered set or poset.
2. Let X = {1, 2, 3, 4, 5, 6} and R be a relation defined as x, y  Riff x - y is
divisible by 3. Find the elements of the relation R. (May/June 2016)
Answer:
R   1,1 , 2, 2 , 3,3 , 4, 4 , 5,5 , 6,6 , 1, 4 , 4,1 , 2,5 , 5, 2 , 3,6 , 6,3 
3. Which elements of the poset ({2, 4, 5, 10, 12, 20, 25}, / ) are maximal
and which are minimal?
Answer:
The relation R is R = {(2, 4) (2, 10) (2, 12) (2, 20) (4, 12) (4, 20) (5, 10) (5, 20) (5,
25) (10, 20)}.
Its Hasse diagram is

St. Joseph’s Institute of Technology 20

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

12 20 25

4 10

2 5

The maximal elements are 12, 20, and 25 and the minimal elements are 2
and 5.
4. Draw the Hasse diagram of  D20 , /  , where D20 denotes the set of
positive divisors of 20 and / is the relation “division”. (Nov/Dec 2019)
Answer:
Given D20  1,2,5,10,20 .The Hasse diagram is
20

10

2 5

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

(May /June 2014)
Answer:
18

6 9

2 3

6. Define lattice. (Nov/Dec 2016)

Answer:
A partially ordered set (L, ≤) in which every pair of elements has a least
upper bound and greatest lower bound is called a lattice.
7. Define sub lattice with example.
Answer:
A non-empty subset M of a lattice ( L, , ) is called a sub lattice of L if and only
if M is closed under both the operations  and  i.e. if a, b  M, then a  b and
a  b also in M.
Example:  Sn , D is a sub lattice of  Z , D .

St. Joseph’s Institute of Technology 21

Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

8. Determine whether the following posets are lattices.

(i) ({1, 2, 3, 4, 5}, / ) (ii) ({1, 2, 4, 8, 16}, / )
Answer:
(i) ({1, 2, 3, 4, 5}, /) is not a lattice because there is no upper bound for the
pairs (2, 3) and (3, 5).
(ii) ({1, 2, 4, 8, 16}, /) is a lattice since every pair has a LUB and a GLB.
9. Show that in a lattice if a  b and c  d then a  c  b  d
(Apr/May 2019)
Answer:
Given
a  b  a b  a c  d  cd  c
To prove a  c  b  d
 i.e. to prove  a  c    b  d    a  c 
 a  c   b  d   a  c  b   d
  a  b  c  d 
 ac
Hence proved.
10. When is a lattice said to be bounded? (Nov/Dec 2012)
Answer:
The lattice is said to be bounded if it has both a lower bound and an upper
bound.
11. Is it true that every chain with at least three elements is always a
complemented lattice? Justify your answer. (Apr/May 2019)
Answer:
Let  L, ,   be given chain. We know that in a chain any two elements are
comparable.
Let 0, x and 1 be any three elements of  L, ,   with 0 is the least element and
1 is the greatest element.
We have 0  x  1
0  x  0, 0  x  x
1  x  x, 1  x  1
In both case x does not have any complement. Therefore, any chain with at least
three elements is not complement.
12. Give an example of a lattice which is a modular but not a distributive.
Answer:
Diamond lattice is a modular lattice but it is not a distributive lattice.
13. Define lattice homomorphism and isomorphism. (Apr/May 2015)
Answer:
Let  L1 , ,   and  L2 , ,  are two lattices. A mapping f : L1  L2 is called a
lattice homomorphism from L1 to L2 , if for any a, b  L1 ,
St. Joseph’s Institute of Technology 22
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

f (a  b)  f (a)  f (b) and f (a  b)  f (a)* f (b) .

If a homomorphism f : L1  L2 of two lattices  L1 , ,   and  L2 , ,  is
bijective i.e. one - one, onto, then f is called an isomorphism.
14. Prove that any lattice homomorphism is order preserving.
Answer:
Let f : L1  L2 be a homomorphism.
Let a  b . Then GLB{𝑎, 𝑏}= a  b  a , LUB{𝑎, 𝑏}= a  b  b .
Now f (a  b)  f (a)
 f (a)  f (b)  f (a)
i.e., GLB {𝑓(𝑎), 𝑓(𝑏)} = 𝑓(𝑎). Therefore f (a)  f (b) .
a  b Implies f (a)  f (b) . Therefore f is order preserving.
15. 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  . (Nov/Dec 2019)
Solution:
Let a, b  L then
a  a & a  a  b  a  a   a  b 1
On the other hand, a   a  b  a  2
From (1) and (2) a   a  b   a .
16. Define a Boolean algebra. (May/June 2012)
Answer:
A Boolean algebra is a complemented, distributive lattice.
17. Determine whether D8 is a Boolean algebra. (Nov/Dec 2018)
Answer:
D8 = {1, 2, 4, 8}. Since 2 and 4 has no complements, D8 is not a Boolean
algebra.
18. Simplify the Boolean expression a' .b' .c  a.b' .c  a.b' .c' , using Boolean
algebraic identities.
Answer:
a' .b' .c  a.b' .c  a.b' .c' = a ' .b' .c  a.b' .(c  c' )
= a' .b' .c  a.b' .1
= b' .(a  a ' .c)
= b' .(a  a ' )(a.c)
= a.b'  b' .c
19. When a lattice is said to be a Boolean algebra? (Nov/Dec 2021)
Answer:
A Boolean algebra is a complemented, distributive lattice.
20. Show that the absorption laws are valid in a Boolean algebra.
(May/June 2016)
St. Joseph’s Institute of Technology 23
Sub. Name & Code: Discrete Mathematics, MA3354 Dept. of IT AY: 2022-23

Answer:
Absorption law is a  ab  a .
Consider a  ab  a(1  b)  a(1)  a . Hence proved.
PART – B
1 Consider the set D50  1,2,5,10,25,50 and the relation divides ( / ) be a
partial ordering relation on D50
(a) Draw the Hasse diagram of D50 with relation divides.
(b) Determine all upper bounds of 5 and 10
(c) Determine all lower bounds of 5 and 10
(d) Determine LUB of 5 and 10
(e) Determine GLB of 5 and 10 (Nov/Dec 2018)
2 Let a, b  L be a lattice. For any a, b  L , a  b  a  b  a  a  b  b .
[Nov/Dec -2021]
3 Show that every chain is a distributive lattice. (Nov/Dec 2019,
2018,2017)

4 In a distributive lattice prove that a * b  a * c and a  b  a  c imply b  c

(May/June 2014)
5 In a lattice if a  b  c, show that (Nov/Dec 2013)
(i ) a  b  b * c
( ii )(a* b)  (b * c )  (a  b)*(a  c )  b

Prove that in every lattice distributive inequalities are true.

6 (Apr/May 2019)

7 Define a modular lattice and prove that every distributive lattice is

modular but not conversely. (Nov/Dec 2019)
8 Show that in a distributive lattice and complemented lattice
a  b  a * b  0  a  b  1  b  a [Nov/Dec -2020]
9 Show that in any Boolean algebra  a  b  b  c  c  a    a  b  b  c  c  a 
(May/June 2014)
10 Prove that in a Boolean algebra  a  b  '  a' b' and  a  b  '  a' b' .
(Nov/Dec 2015, 2019)
(or)
State and Prove De Morgon’s law in complemented and distributive
lattice. (Nov/Dec 2018)

St. Joseph’s Institute of Technology 24