MA3354 Discrete Mathematics
Important 2mark questions
Unit I
1. Construct the truth table for the following P A (Pv Q).
2. Write the inverse of the statement, "If you work hard then you will be rewarded".
3. Let Q(x,y,z) denote the statement "x + y = " defined on the universe of
discourse Z, the set of all integers. What are the truth values of the prepositions
Q(1, 1, 1) and Q(1, 1,2).
Unit Il
1. Show that in any group of 8 people at least two have birthdays which falls on same
day of the week in any given year.
2. How many solutions does the equation, x1+ X2+ X3 = 11 have, where x1X2, and x,
are non-negative integers?
3. Solve a,_5a,n-1 +6an-2 = 0.
Unit IlI
1. An undirected graph G has 16 edges and all the vertices are of degree 2. Find the
number of vertices.
2. Define incidence matrix of a simple graph.
3. Give an example of a graph whichis Hamiltonian but not Eulerian.
Unit IV
1. Prove that group homomorphiao preserves identity.
2. Prove that in any group, identity elements is the only idempotent element.
3. Prove that every cyclic group is abelian.
Unit V
1. Show that the absorption laws are valid in a Boolean algebra.
2. Define partial ordered set.
3. Is it true that every chain with at least three elements is always a complemented
lattice? Justify your answer.
MA3354 DISCRETE MATHEMATICS
Important Question
1. Find the principal disjunctive and conjunctive normal form of the formula
S(GP’ R) A (Q »P)
2. Show that the following premises are inconsistent:
() If Jack misses many classes through illness, then he fails high school.
() If Jack fails high school, then he is uneducated
(i) if Jack reads a lot of books then he is not uneducated
(iv) Jack misses many classes through illness and reads a lot of book
3. Prove that Bx(P(r) AS (x), Yx(P(r) ’ R(r) 3x(R(*) ASa
4. Show JaS logically follows from the premises P’.Q’R, R, Pv (J aS)
5. Show that (-P A(hqar)v (qar)v(par) r
6. Show that Vx(P(xvQ()}x P(x)v3xQ()
7. Obtain the PDNF AND PCNF of (-P’RJA (Q4> P) by usiry bquivalences.
8. Use mathematical induction to prove that n'+2n Ts divisible by 3 for all integers n >21
9. Solve the following recurrence relation a n+2-2 a n+1+ an = 2" with a0 =2, a1 =1
using generating functions
10. Solve the recurrencerelation F()-Fn-l)-F(n -2) =0, F(0) =1,F(|) =1
11. How many integers between 100 and 999 inclusive a) are divisible by 7?b) are not
divisible by 4? c) are divisible by3or 4? d) are divisible by 3 and 4? e) are divisible by
3 but not by 4?
11. State and prove the pigeonhole principle and generalized pigeonhole principle.
12. If G is a simple graph with n vertices and k components, then the number of edges is at most
(n k)(n -k+1) /2
13. A connected graph G is Eulerian if and only if every vertex of G is of even degree.
14. Prove that if a graph Ghas not more than two vertices of odd degree, then there can
be Euler path in G.
15. Find the Euler path or an Euler circuit, if it exist, in the following graphs.
A B
E
D
16. Establish an isomorphism between the graphs G and H
A B E
H
C
G H
17. State and prove Lagrange's theorem
18. State and prove Cayley's represetat+on theorem
19. State and prove fundamental theoret of group homomorphism
20. Show that Kernal of a group homomorphism is a normal subgroup of the group
21. Let ( G,*)bea finite cycli group generated by an element a e G. If G is of order n,
prove that an =e and G= (a,a²,.., an =e} where n is the least positive integer for
which a" = e.
22. Let (L,S) be alattice. For any a, be L,asbaAb=a avb=b
23. State and prove ISOTONIC PROPERTY, DITRIBUTIVE INEQUALITY,MODULAR INEQUALITY
24. State and prove De Morgan's Laws in lattices and Boolean algebra
25. In a distributive lattice, show that (a *b) (b*c) (c*a) = (aDb) *(6c)*(ca)
26. In a Boolean algebra show that ab'+ a'b = 0 if and only if a =b
27. In a distributive lattice prove that complement of an element, if it exists, is unique
MA 3354 Discrete Mathematics
Unit I
1. Using indirect method, show that R->¬Q, RvS, S-> ¬Q, P->Q=> ¬P.
2. Show that if xand y are integers and both xy and x + yare even, then both x and
y are even.
Unit Il
1. Determine the number of positive integers n, 1 sns 2000 that are nit divisible by
2, 3 or 5, but are divisible by 7.
2. Prove by mathematical induction S " 9 6 4
n
Unit III
1. Prove that for a bipartite graph with a vertices has maximum of"4 edges.
2. Prove that a group G is disconnected if and only if the vertex set V is partitioned
into two non-empty subsetsUand Wsuch that there exists no edge in G whose
one vertex is inUand one vertex is in W.
Unit IV
1. Prove that every finite group of order h is isomorphic to a permutation group of
degree n.
2. Prove that intersection of two normal subgroups of a group G is, again a normal
subgroup of G.
Unit V
1. State and prove Istributive inequalities in lattices.
2. Prove that every chain is a distributive lattice.
