UNIT-1
PART-A
1. Write the contra positive of the implication. “If it is Sunday then it is holiday”.
2. Show that the properties P → Q and P Q are equivalent.
3. Define Tautology with an example.
4. Write the inverse of the statement, “If you work hard then you will be rewarded”.
PART-B
5. Show that ((P˅Q)˄⅂(⅂P˄(⅂Q˅⅂R)))˅(⅂P˄⅂Q)˅(⅂P˄⅂R) is a Tautology by using equivalences.
6. Obtain PCNF and PDNF of the formula S given by ( P Q) (P R) (Q R).
7. Prove by indirect method (x)(P( x) Q( x)) (x) P( x) (x)Q( x)
8. Use rule CP, derive P → (Q → S ) from P → ( Q → R), Q → ( R → S ).
9. Find PCNF and PDNF of ( P (P Q R))
10. Using Conditional proof prove that P Q, Q R, R → S P → S
11. Show that the following set of premises is inconsistent:
If Raja misses many classes, then he fails in the final examination.
If Raja fails in the final examination, then he is uneducated. If Raja
reads a lot of books, then he is not uneducated. Raja misses many
classes and reads a lot of books,
12. Show that (x)( P( x) Q( x)) (x) P( x) (x)Q( x)
UNIT-2
PART-A
1. 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.
2. State Pigeonhole principle.
3. Find the number of arrangement of the letters in "MATHEMATICS".
4. In how many ways a football team of eleven players can be chosen
out of 17 players, when
(i)five particular players are to be always included
(ii)two particular players are to be always exclude.
PART-B
5. How many integers between 1 to 300 are there that are divisible by ,
(i) at least one of 3, 5, 7
(ii) 3 and 5 but not by 7
(iii) 5 but not 3 and 7.
6. Use mathematical induction to show that n2-1 is divisible by 8 whenever n is an odd positive
integer. .
7. Using mathematical induction, show that
n
n(n + 1)( 2n + 1)
k
k =1
2
=
6
8. Using the generating function, solve the difference equation yn+2 – 5yn+1-6yn = 5n, such that
y0 =0, y1 = 2.
9. Using mathematical induction, show that
1
12 + 32 + 52 + ... + (2n − 1) 2 = n(2n − 1)(2n + 1)
3
10. Use the method of generating function to solve the recurrence relation
an+2-6an+1+9an=3(2n)+7(3n) given that a0=1 and a1=4, where n>0.
11. Determine the number of positive integers n, from 1 to 2000 that are not divisible by 2, 3, or 5
but are divisible by 7.
12.Prove by mathematical induction that for every positive integer n, 3 divides n − n for n 1.
3
UNIT-3
PART-A
1. State the handshaking theorem.
2. Give an example of a graph which is both Eulerian and Hamiltonian.
3. Give an example of a graph which is Eulerian but not Hamiltonian.
4. In a group (G,*),Show that (a*b)-1=b-1*a-1, for any a G ,
PART-B
5. Determine whether the following graphs G and H are isomorphic or not?. Give reason.
6. 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 n/2, then prove that G has Hamilton cycle.
7. Prove that the maximum number of edges in a simple disconnected graph G with n vertices and k
components is (n-k)(n-k+1)/ 2.
8. Prove that the number of odd degree vertices in any graph is Even.
9. Prove that the maximum number of edges in a simple graph with n vertices and k components is
(n − k )(n − k + 1) / 2.
10. Examine whether the following pairs of graphs a isomorphic. If not isomorphic, give the reasons
G H
11. Prove that a nonempty connected graph is Eulerian if and only if
its vertices are all of even degree.
12.If G is simple connected graph with n vertices with n 3 , such that the degree of every vertex in G
n
is at least , then prove that G has Hamilton circuit.
2
UNIT-4
PART-A
1. Define a semigroup and give an example.
2. Show that in a group (G,*) if for any a,b € G, (a*b)2=a2+b2, then G is abelian.
3. Obtain the adjacency matrix of the complement of the graph K1,4
4. Prove that group homomorphism preserves identity.
PART-B
5. In any group (G,*), show that (a*b)2 =a2*b2 .
6. State and prove the Lagrange’s theorem for groups.
7. Prove that the intersection of two subgroups of a group G is again a subgroup of G.
8. Show that (Q+, *) is an abelian group, * is defined by a * b=a / b for all a,b € Q+.
9. Let f : G → G 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.
10. 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
11. State and prove Langrange's theorem on groups
12 . Prove that union of two subgroups of a group G is subgroup of G if and only if one is
contained in other.
UNIT-5
PART-A
1. Define Lattice and give an example.
2. Draw the Hasse diagram of (S24, /) where S24 denotes the set of positive divisors of 24 and /
denotes the relation “divisor”.
3. Draw the Hasse diagram of (D20, /), where D20 denotes the set of
positive divisors of 20 and / is the relation “divisor”.
4. Show that the absorption laws are valid in a Boolean algebra.
PART-B
5. Draw the Hasse diagram for D30 = {1,2,3,5,610,15,30} and let the relation R be divisor on D30. Also
find GLB, UB and LUB
6. Prove that every distributive lattice is modular. Is the converse true? Justify your claim.
7. In any Boolean algebra, Show that a.b’+b.a’=(a+b)(a’+b’
8. If (L,^,v) is a complemented distributed lattice, then prove the Demorgan’s laws.
9. Consider the set D50 ={1,2,5,10,25,50} and the relation divides (/)
be a partial ordering relation on D50.
1.Draw the Hasse diagram of D50.with relation divides.
2. Determine all upper bounds of 5 and 10.
3. Determine all lower bounds of 5 and 10.
4. Determine LUB of 5 and 10.
5. Determine GLB of 5 and 10.
10 .Show that in a Lattice “isotone property” and “distributive inequalities” are true.
11. 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.
12. Show that the De Morgan's laws are valid in Boolean algebra.
All the Best
