JAYA SAKTHI ENGINEERING COLLEGE

(Approved by AICTE & Affiliated to Anna University, Chennai)

St. Mary’s Nagar Thiruninravur, Chennai- 602 024

DEPARTMAENT OF SCIENCE AND HUMANITIES

MATHEMATICS
SUB CODE:MA3354\DISCRETE MATHEMATICS

Question Bank
Year / Sem: II Yr /IV Sem

LOGIC AND PROOFS

PART-A

1. Using truth table, show that the proposition is a Tautology.(AU NOV/DEC

18,17-2,21)
2. Write the negation of the statement .(M\J 2015,N\D 18,19)
3. Write the symbolic form of the statement “The automated reply cannot be sent when the file
system is full”. .(AU NOV/DEC18,21,AU-N\D 2023)
4. Prove that . ( AU APR/MAY17,A\M 18)

5. Without using the truth table, show that .(N\D 2014,17,22)

6. Show that is a tautology. ( AU APR/MAY 21)

7. Show that the proposition and are logically equivalent. (AU-M\J 2013,2018)

8. Give an indirect proof of the theorem ‘If is odd, then n is odd”. (AU-M\J
2014,2017,21,22)
9. Is a tautology.
10. Show that and are logically equivalent. ( AU APR/MAY 21)

11. Define Tautology with an example. (AU-M\J 2013, 2017,2018)

12. Give the contra positive statement of “if it rains today, then I buy an umbrella”. (AU-M\J
2014,17,19,N\D 2012,23)
13. S.TP(PQ)isa tautology. (AU-A\M 2013, 2017,2018)
14. Find PCNF without Constructing truth table (P→(Q∧R))→(~P→(~Q∧~R)). AU NOV/DEC
12,15,17,19,21)

15. Define tautology. (AU-M\J 2013,2018)

16. Using truth table show that the proposition PV‫(ד‬PɅQ) is a tautology. .(AU NOV/DEC 21
17. Negate the statement “ For all real numbers x,if x>4 then x 2>16”. (AU-M\J 2013, 2017,2018)
18. Give the converse and the contrapositive of the implication “If it is raining ,then I get wet.”.
(AU-M\J 2013, N\D 2017,2018)
19. ST the following statements consistitute a valid argument .If there was rain , then travelling
was difficult. If they had umbrella Therefore there was no rain. .(AU NOV/DEC 21,M\J
17,22)
20. State the truth table of “ If tigers have wings then the earth travels round the sun” .(N\D 2014,2017,A\
M2017,2021)
21. S.T (x) ( P(x)  Q (x))  (x)(Q(x)  R(x) )  (x) (P(x)  R(x) ). (AU-M\J 2013,2018)
22. Define functionally complete set and give example for it.(AU-M\J 2011,15,19)
23. When do you say that two compound propositions are equivalent. .(AU NOV/DEC 12,15,17,19)
24. Find the truth table for the statement P→Q.(N\D 2011,14,17,19)
25. Does P→(P => Q) form a tautology.(AU NOV/DEC 21
26. Show that (P→(Q→R)) →((P→Q) →(P→R)) using Truth table. AU-M\J 2013,2018)

PART-B

1. Prove that the premises are inconsistent. (AU-N\D

2014,15,19)
2. Obtain the principal disjunctive normal form and principal conjunctive normal form of the
statement ..(AU NOV/DEC 21 )

3. Show that: and .(AU-M\J

2011,15,19)
4. Using indirect method of proof, derive from the premises
and . (N\D 2019)
5. Prove that is irrational by giving a proof using contradiction. .(AU NOV/DEC 21)
6. Show that by indirect method of proof. (A\M 2021)

7. Find the principal disjunctive normal form of the statement, (AU-

N\D 2017,19)

8. Prove is a tautology. .(AU- NOV/DEC

21).

9. Prove that is a conclusion from the premises and by

using conditional proof. (M\J 2011,17)

10. Obtain the principal disjunctive normal form of by using equivalences .

(N\D 2017)
11. Show that is logically derived from the premises and .(AU
NOV/DEC 21
12. Show that “it rained” is a conclusion obtained from the statements. “if it does no train 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”. .(AU NOV/DEC 21
13. Show that S V R tautologically implied by ( P V Q) ٨ ( P → R) ٨ ( Q → S ).(AU-A\M 17,19)
14. Show that P → S can be derived from the premises, 7P V Q,
7Q V R, and R → S .(A\M 2014,15,19).
15. Without constructing the truth table obtain the product of sums canonical form of the
formula.(A\M 17,N\D 21018).
( P  R)  (Q  P ) . Hence find the sum of products canonical form.
16. Show that (i) (P  Q)  (P  Q)  (P  Q)

(ii) (P  Q)  (P  Q)  (P  Q) .(AU NOV/DEC 21)

17.Obtain the PDNF and PCNF of the statement pV(‫ ד‬p→(qV(‫ ד‬q →r))).(AU-A\M 2011,15)

18 Show that R → S can be derived from premis es

P → (Q → S), 7R V P , and Q.(N\D 2018,19)

19.Show that the premises ”A student in the class has

not read the book” and ”Every one in this class passed the
semester exam” imply the conclusion ”Some one who passed
the semester exam ”has not read the book”.(AU-A\M 2011)

20. Use the indirect method to show that.(AU NOV/DEC

21)

R → ¬Q, R ∪ S, S → ¬Q, P → Q =⇒ ¬P. .

UNIT-2 COMBINATORICS

PART-A

1. State pigeonhole principle.(AU M\J 2015,19,A\M2017,21)

2. Find the recurrence relation satisfying the equation .(N\D 2014,M\J

2018,21)
3. If seven colours are used to paint 50 bicycles, then show that at least 8 bicycles will be the
same colour. .(AU NOV/DEC 18,21 ).

4. Solve the recurrence relation for , where y(2)=16 and

y(3)=80.(AU A\M 2113,15,19,20)

5. Write the generating function for the sequence .(AU NOV/DEC 21)

6. In how many ways can all the letters in MATHEMATICAL be arranged.(AU A\M
2113,15,19,20)

7. Use mathematical induction to show that ..(AU NOV/DEC 21)

8. Show that among any group of six(not necessarily consecutive)integers there are two integers
with the same remainder when divided by 5. .(AU NOV/DEC 14,17,19,22)
9. How many permutations can be made out of letter or word “COMPUTER”.(AU-N\D
2013,2016,18)
1
10. Find the sequence whose the generating is 2 .(AU-M\J 2011,17,18,21,N\D 20)
(1−9 x )
11. Write the particular solution of the recurrence solution a n=¿6a n−1-9 a n−2+3n. .(AU NOV/DEC
17,20),
12. How many different bit strings are there of of length 9. .(AU NOV/DEC 17,23).
13. Find the number of permutation of the letter in the word MISSISSIPPI. .(AU NOV/DEC 21
14. How many integers between 1 to 100 that are divisible by3 but not by 7.(AU-M\J 2012,16,19,N\D 2015)
15. Find the recurrence relation satisfying the equation=A(5)n+B(-4)n.(AU NOV/DEC 18,21)
16. Use mathematical induction to show that n!≥2n-1.(AUNOV/DEC 21)
17. Define permutation and give example for it. .(AU NOV/DEC 14,17,19,22)

18. 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.
19. Define combination and give example for it. .(AU M\J 2015,19,A\M2017,21)
20. Define permutation and combination. AU-M\J 2011,17,18,21,N\D 20)
21. What is the solution of the recurrence relation an=an-1+2an-2? .(AU NOV/DEC 17)

22. Using the principle of mathematical induction, show that 1 + 3 + 5 + . . . + (2n − 1) = n2,

∀ n ≥ 1. .(AU NOV/DEC 21)

23. Show that if 7 colours are used to paint 50 bicycles, atleast 8 bicycles will be the same colour.(AUM\J
14,17,N\D 21018).

24. Define combination and give example for it. .(AU NOV/DEC 12,15,21)
25. In how many ways a foot ball team of eleven players can be chosen out of 17 players, when
a. five particular players are to be always included.

b. Two particular players are to be always xclude. .(AU NOV/DEC 21)

PART-B

1.Using the generating function, solve the difference equation

AU NOV/DEC 12,15,21)

2.Find the number of integers between 1 and 250 both inclusive that are divisible by any of the
integers 2, 3,5,7 . AU M\J 2015,19,A\M2017,21)

3.Using Mathematical induction show that .(AU NOV/DEC 21)(AUN\D

2022).
4.There are 2500 students in a college, of these 1700 have taken a course in C, 1000 have taken a
course Pascal and 550 have taken a course in Networking. Further 750 have taken courses in both
C and Pascal, 400 have taken courses in both C and Networking , and 275 have taken courses in
both Pascal and networking .If 200 of these students have taken courses in C, Pascal and
Networking
(i)How many of these 2500 students have taken a course in any of these three courses C, Pascal
and Networking?(AU-A\M 2017)

5.(ii) How many of these 2500 students have not taken a course in any of these three courses C,
Pascal and Networking? .( AU NOV/DEC 14,17,19,22)

6.Using mathematical induction show that .(AU NOV/DEC

21)

7.Determine the number of positive integers n, 1 that are not divisible by 2, 3, or 5

but are divisible by 7.
8.Find the generating function of Fibonacci sequence. .(AU NOV/DEC 21

9.Solve the recurrence relation given that .

(N\D 2019)

10.Find the solution to the recurrence relation with the initial

conditions =2, =15. .(AU NOV/DEC 22,A\M 17,19)

11.Using the method of generating function , solve the recurrence relation

given that and ..(AU NOV/DEC 21)

12.Use mathematical induction show that . (AU M\J 2015,19,A\M2017,21)

13.Use generating function to solve the recurrence relation for

,with ..(AU NOV/DEC 21

14.Use mathematical induction to showthat 20  21  22  23  …  2n  2n1  1 , for
all non-negative integers n . (AU M\J 2015,19,A\M2017,21)
1513. 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 French and 50 can speak
Russian, while only 20 can speak both French and Russian. .( AU NOV/DEC 14,17,19,22)

16. Solve the recurrence relation an = 2(an−1 − an−2), where n ≥2and a0=1
a1 = 2.(AU-2011,15)

17.Prove that every positive integer n≥2 is either a prime or it is a product of primes. .
≥
(AU NOV/DEC 21)

18.Using generating functions olveyn+2-5yn+1+6yn=0,n≥0withy0=1and y1=1 AU M\J 2011,17,19)

19.Findthenumberofdistinctpermutationthatcanbeformedfromallthelettersofeach
word(i)RADAR(ii)UNUSUAL.(AU M\J 15,17,21)

20.Howmanypositiveintegersncanbeformedusingthedigits3,4,4,5,5,6,7ifnhastoexceed 5000000?(AU M\J

2011,17,19)
21.Findthenumberofintegersbetween1and250bothinclusivethataredivisiblebyanyofthe integers 2,3,5,7. .
(AU NOV/DEC 21)

UNIT-3

GRAPH THEORY

PART-A

1. Define a complete graph.(AU-N\D 2023).

2. Define isomorphism between graphs. .(AU NOV/DEC 21

3. Given an example of a non-Eulerian graph which is Hamiltonian.(AU-N\D 2012,15)

4. Define self complementary graph.(AU-A\M 2017,19)

5. How many edges are there in a graph with 10 vertices each of degree 5? .(AU NOV/DEC 21
6. What do you strongly connected components of a telephone call graph represent?
7. Give an example for graph which is
(a) Eulerian and Hamiltonian.
(b) Neither Eulerian nor Hamiltonian. .(AU NOV/DEC 21)

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

9. Draw the graph represented by the given adjacency matrix

10. Give an example of an Euler graph. .(AU NOV/DEC 21

11. Draw a complete bipartite graph of and .

12. State the handshaking theorem. .(AU NOV/DEC 21
13. Define graph&Complete Graph with example.
14. Obtain the adjacency matrix of the complement of the graph K1,4. .(AU NOV/DEC 21

15.Check whether the complete bipartite graph K3,3 is Hamiltonian or Eulerian(AU N\D 2020)

16.Give an example of a graph Which is Hamiltonian but not Eulerian. AU N\D 2020,N\D 2022)

17.Define incidence matrix of a simple ghraph. .(AU NOV/DEC 21

18.An undirected graph has 16 edges and all the vertices are ofdegree 2.Find the number of
vertices.

19.Write the Adjacency matrix and incidence matrix of K2,2. .(AU NOV/DEC 21

20.Give an example of self complementary graph.

21.Show that there doesnot exist a graph with 5 vertices of degree 1,3,4.2,3 respectively.

22. Define Hamiltonian path.

23.Draw a graph that is Eulerian but not Hamiltonian. .(AU NOV/DEC 21

24.Show that the number of odd degree vertices in a simple graph is even.(AU N\D 2014)

25.Draw a complete graph with K3,4,. (AU-N\D 2015,17,19) .

26.When is a graph is called a Eulerian graph. .(AU N\D 2023)

PART-B

1. Examine whether the following pair of graphs are isomorphic. If not isomorphic, give the
reasons. .(AU NOV/DEC 21

2. Find all the connected sub graphs obtained from the graph given in the following figure, by
deleting each vertex. List out the simple paths from A to in each sub graph. (AU A\M 2017)
3. The adjacency matrices of 2 pairs of graphs are given below. Examine the isomorphism of G
and H by finding a permutation matrix. (AU-N\D11,15,19)

4. Determine whether the graph G and H given below are isomorphic. Give reason. .(AU
NOV/DEC19)

5. Prove that an undirected graph has an even number of vertices of odd degree.(AU-N\D 2021)

6. Prove that number of odd degree vertices in any graph is even. .(AU NOV/DEC 21)

7. Using circuits, examine whether the following pairs of graphs , given below are
isomorphic or not.(AU A\M 2019)

8. Prove that the maximum the number of edges in a simple disconnected graph G with n vertices and k

components is . (AU-A\M2011,15.17) (AU-N\D 2023)

9. Determine whether the following graph G and H given below are isomorphic. Give reason.
(AU-N\D 2023)
10. Show that a simple graph G with n vertices is connected if it has more than
edges. .(AU NOV/DEC 21 )

11. Prove that is the maximum number of edges in a simple graph with n vertices. (AU
A\M 2019)
12. Give an example of a graph (1) which is Eulerian but not Hamiltonian (2) Hamiltonian but not
Eulerian (3) both Eulerian and Hamiltonian (4) not an Eulerian not a Hamiltonian. (AU-A\M
2017)
13. Find an Euler path or Euler circuitit exists in each of three graph below. If not explain
why? .(AU NOV/DEC 22)

14 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.(AU-N\D 21)
15. Draw the complete graph K5 with vertices A,B,C,D,E. Draw all complete subgraph
of K5 with 4 vertices.(AU-A\M 2019,21)
16. Prove that a simple graph with n vertices and k components can
have at most (n-k)(n- k+1)/2 edges.AU\A\M 11,17,19)
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.(AU-N\D 17)
18. Determine which of the following graph are bipartite & which are not. If a
graph is bipartite , state if is completely bipartite.(AU-M\J2011,14,17,N\D 17,21)
 19.The adjacency matrices of two pairs of graph as given below. Examine the isomorphism of
G and H finding a permutation matrix.(AU-N\D17,19)
0 0 1 0 1 1
AG =[0 0 1] AH =[1 0 0]
1 1 0 1 0 0
20. State and prove Eulerian graph theorem.(N\D 2017,19).
21.State and prove Handshaking theorem.(AU-N\D2020,2017,2011,2013)

UNIT-4

ALGREBRAIC STRUCTURE

PART-A

1. State Lagrange’s theorem in group theory. .(AU NOV/DEC 2011,15,17) (AU-N\D 2023)

2. Define homomorphism and isomorphism between two algebraic systems.

3. When is a group (G, *) called abelian? .(AU-A\M2012,2014,17)

4. If a and b are any two elements of a group , show that G is an Abelian group if and
only if = . (AU-A\M2017,N\D2019)

5. State any two properties of a group. .(AU NOV/DEC 21 )

6. If ‘a’ is a generator of a cyclic group G, then show that is also a generator of G.(N\D
2017)
7. Define a Field in an algebraic system. (AU-A\M 2015,17,19)

8. Find the left cosets of in the group . .(AU NOV/DEC 21)

9. Show that every cyclic group is abelian. (AU-A\M 2019)

10. Show that the identity element of any group is unique. .(AU NOV/DEC 21)
11. Define ring and give an example. (AU-N\D 2019)
12. Find the idempotent elements of G= under the binary operation
multiplication. .(AU NOV/DEC 21 )
13. Prove if a has inverse b and b has inverse c , then a  c .(AU-A\M 2014,17,19)
14. Prove that identity element is unique in a group.(AU A\M 2019)
15. Show that if every element of group is self-inverse then it must be abelian.(AU N\D 2014,17)
16. Prove that group homomorphism preserves identity.(AU-A\M 2015.19,20)
17. Give an example of an integral domain which is not a field.(AU-A\M 2017,19)
18. State Lagrange’s theorem.(AU N\D 2021,22)
19. Define Ring(AU-N\D 2019)
20. Define field in an algebraic system(AU-A\M 2019)
21. State any two properties of a group. .(AU NOV/DEC 21 )
22. Show that the inverse of an element in a group (G, *) is unique.(AU-A\M
2014,17,19,21)
23. Prove that every subgroup of an abelian group is a normal. AU-A\M
2014,17,19)
24. Deefine the homomorphism of two groups. (AU-A\M 2019)
25. When is group(G,*) called abelian? AU NOV/DEC 2011,15,17)

PART-B

1. State and prove Lagrange’s theorem. (AU-A\M2017,N\D2019)

2. Prove that every finite group of order n is isomorphic to a permutation group of order n. .(AU
NOV/DEC 21 )

3. Prove the theorem : Let be a finite cyclic group generated by an element a ϵ G. If G

is of order n, then = e, so that G = . Further more n is a least
positive integer for which (AU-N\D 2014,17,19)

4. If is a binary operation on the set R of real numbers defined by

1) Find is a semigroup
2) Find the identity element if it exists
3) Which elements has inverse and what are they? .(AU NOV/DEC 21)

5. how that the kernel of a homomorphism of a group into an another group

is a subgroup of G. (AU A\M 2012,15,17)
6. Let be a homomorphism of groups with Kernel K. Then prove that K is a normal
subgroup of G and G|K is isomorphic to the image of f. (OR)
State and prove the fundamental theorem of homomorphism. .(AU NOV/DEC 21 )

7. Let ( ) and ( ) be group homomorphism. Then prove that the Kernel of g is

normal subgroup of ( ). (AU A\M 2019)

8. Prove that the necessary and sufficient condition for a non empty subset H of a group to
be a subgroup is ..(AU NOV/DEC 21)

9. Prove that the set is a commutative ring with respect to the binary
operation addition modulo and multiplication modulo . (AU A\M 2011,17)

10. Prove that intersection of two subgroups of a group (G,*) is a subgroup of a group (G,*).

11. Show that every cyclic group is abelian group. .(AU NOV/DEC 21
12. Show that (Q+,*) is an abelian group,where * is defined by a*b =ab/2, for all a, b Q+.(AU-
A\M 2017)

13. IF (G,* ) is a finite group, then prove that order of any subgroup divides the order of the
group.(AU N\D 20170

14. Prove that group homomorphism preserves identity and inverse.(AU-A\M 2017,N\D 2015,18)

15. Obtain the composition table of (S3, ♦) and show that (S3, ♦) is a group/ Check whether (S3,
♦) is abelian. Justify your answer.(AU-A\M 2014,17,19)

16. Show that in a cycle group every subgroup is a normal subgroup.(AU-N\D 2019)

17. Show that the union of two subgroups of a group G is subgroup of

G if and only if one is contained in other.(AU-A\M 2015,17,19)
Show that every finite semi group has an idempotent element. If any group (G,*),show that (a*b)-1=b-
1
*a-1. (AU-N\D 2023)
18. Prove that the group homomorphism preserves identity and inverse element.
(AU N\D 2017,19)
19. If( G *) is an abelian group , S.T (a*b)2 = a2 * b2,
20. State and prove Cayleys theorem.(AU N\D 2019).
21. Show that (Z,+,.) is a commutative ring with identity for any a,b€Z a+b=a+b-1 and a+b=a+b-ab. .
(AU N\D 2017,23)..

UNIT-5

BOOLEAN ALGEBRA AND LATTICES

PART-A

1. Check whether the posets {(1, 3, 6, 9), D} and {(1, 5, 25, 125), D} are lattices or not.
Justify your claim. (AU A\M 2011,N\D18,19)

2. Show that least upper bound of a subset B in a poset unique if it exists. .(AU
NOV/DEC 12,17,18)

3. Let X={1,2,3,4,5,6} and R be a relation defined as if x - y is

divisible by 3.Find the elements of the relation R.(AU-A\N 2017,19N\D,2017)

4. Define a lattice. .(AU NOV/DEC 21)

5. Define sub-lattice.(AU N\D 2018,21)

6. Give an example for a distributive and complemented lattice.(AU A\M 2017,21)

7. Give an example of a lattice but not complemented. .(AU NOV/DEC17,APR/MAY2021)

8. Show that in a Boolean algebra if and only if .(AU M\J 2019)

9. Draw the Hasse diagram of where and the relation

a,b be such that if divides .(AU N\D 17,19)

10. When is a lattice said to be a Boolean Algebra? (AU N\D 2015,17)

11. Define lattice homomorphism. .(AU NOV/DEC 21)

12. Prove the Boolean identity: (AU M\J 2019)

13. Show that the absorption laws are valid in a Boolean algebra. (AU A\M2021)
14. Define lattice homomorphism.(AU-N\D 2021)
15. When is a lattice said to be a Boolean algebra?. .(AU NOV/DEC 15,17,20)
16. Determine wheather D8 is a Boolean algebra or not.(AU-N\D 2017,18,)
17. Show that in a partially ordered set (A, ), if greatest lower bound of a subset S
≤ ⊆A
exists, then it must be unique.(AU-A\M2017,19)
18. In a lattice (L, ≤), show that a ≤ b, if and only if a ^ b = a. .(AU NOV/DEC 21)

19. When is a lattice called complete?(AU-N\D 2019)

20. Show that in a Boolean algebra ab´+a´b=0 if and only if a=b.(AU-A\M 2019)
21. Define Boolean algebra.{AU-N\D 2014,17,19)
22. State and prove Demorgans laws in any Boolean Algebra.(AU-N\D 2023).
23. Draw the Hasse diagram for a ,b, adividesb on 1, 2,3, 4, 6,8,12 .(AU A\M 2017).
24. Leta, b, c  B , S.T (i) a.0 =0 (ii) a+1 = 1.(A\M -
2019)
25. Draw the Hasee diagram of (X,≤), where X={2,4,5,10,12,20,25} and the relation ≤ be such
that x≤y if x divides y.(AU-N\D 2015,17)
26. Define partial order set.(AU- N\D 2022)
27. Draw the Hasse diagram D24 .(AU A\M 2021)

PART-B

1. If is the set of all divisors of 42 and is the relation “divisor of ” on , prove

that is a complemented lattice. .(AU NOV/DEC 21

2. Prove that every distributive lattice is modular. Is the converse true? Justify your
claim.(AU A\M2015,18,19)
3. Show that the direct product of any two distributive lattices is a distributive lattice.
(AU N\D 21)
4. Draw the Hasse diagram for
and is a relation such that
if and only if ..(AU NOV/DEC 21)

5. Prove that , is the set of all positive divisors of 110, is a Boolean algebra and find
it’s all its sub algebras.(AU A\M 2014,17)

6. Simplify the Boolean expression using Boolean algebra

identities.(AU N\D 2015)

7. Show that in a distributive and complemented lattice satisfied De Morgan’s laws.

(AU A/M 2012) Show that every chain is a lattice.
8. Show that in a distributive and complemented lattice

.(AU N\D 2015,17)

9. Show that in a lattice if ,then

1) and

2) . (AU=A\M 2019)

10. In a distributive complemented lattice. Show that the following are equivalent:

1)
 2)

3)

4) . .(AU NOV/DEC 21 )
11. Prove that every chain is modular.Prove that complement of each element is unique.
(AU- M\J 2015)
12. Consider the Lattice D105 with the partial order relation divides,then AU N\D 2011)
(i)Draw the Hasse diagram of D105
(ii)Find the complement of each elements of D105.
(iii)Find the set of atoms of D105&find the number of subalgebras of D105.
13. Show that in a lattice ”isotone property” and ”distributive inequalities” are true.(AU
A\M 2016,19)
14. Show that in a distributive lattice cancellation law is true. Hence, show that in a
distributive lattice if compliment of an element exists then it must be unique.(AU-A\
M 2019)
15. Simplify the Boolean Expression
a´.b´.c+a.b´.c+a´.b´.c´ using Boolean algebra identities.(AU N\D 2017)

16. In a Boolean , prove that a(a+b)=a, for all a,b € B.(AU- A\M 2011,17)
17. (L, ) be a lattice for any a,b L. a b if aɅb=a and a b=b.(AU-N\D 2021)

18. If (L, Ʌ, ⋁) is a complemented distributive lattice, then

prove the Demorgan’s laws.(AU N\D 2014,19,A\

M2019)

19. In S42 is the set of all divisors of 42 and D is the relation “divisor of” on S42, prove that
{S42,D} is a complemented Lattice.(AU- N\D 2019)
20. Show that every finite partial ordered set has a maximal and minimal element.(AU- A\M
2021).