Register Number
SATHYABAMA UNIVERSITY
(Established under section 3 of UGC Act, 1956)
Course & Branch: B.E-CSE
Title of the Paper: Discrete Mathematics Max. Marks: 80
Sub. Code: 411503-611503 Time: 3 Hours
Date: 10/11/2010 Session: FN
______________________________________________________________________________________________________________________
PART - A (10 X 2 = 20)
Answer ALL the Questions
1. Define functionally complete set of connectives and give an
example.
2. Write the following sentence in a symbolic form:
“Every one who is healthy can do all kinds of work”.
3. Draw the Hasse diagram of (X, ), where X is the set of positive
divisors of 45 and the relation is such that
= {(x, y); x A, y A ( x divides y)}
4. Find the partition A = {1,2,3,4,5,6} with minsets generated by
B1 = {1,3,5} and B2 = {1,2,3}.
5. In the group {2,4,6,8} under multiplication modulo 10, what is
the identity element?
6. Show that the intersection of two normal subgroups is a normal
subgroup.
7. Give an example of a lattice which is a modular but not a
distributive.
8. A label identifier, for a computer system consist of one English
alphabet in capital letter followed by two non-zero digits. If
repetition of digits is allowed, how many label identifiers are
possible?
9. Define a regular graph.
10. Find the minimum height of a 11-vertex binary tree.
PART – B (5 x 12 = 60)
Answer All the Questions
11. (a) Test whether the following formula:
Q (P Q) (P Q) is a tautology or contradiction
without constructing the truth table.
(b) Using rule CP, derive P → (Q→S) from P →(Q→R),
Q→(R→S).
(or)
12. (a) Obtain the principle conjunctive normal form of
(P→R) (Q P)
(b) Prove that (x) (P(x) Q (x)) (x) P(x)(x) Q(x).
13. (a) Let a relation R be defined on the set of all real numbers by ‘if
x, y are real numbers, xRy x-y is a rational number’ show that
R is an equivalence relation.
(b) Draw the Hasse diagram of the relation on P(A), where
A = {a, b, c}
(or)
14. (a) Show that : R → R defined by (x) = 2x-3 is a bijection and
find its inverse. Compute -1 and o-1
(b) If f : A → B, g : B → C & h : C → D are functions then prove
that ho (gof) = (hog) of.
15. State and prove Lagrange’s Theorem.
(or)
1 2 3 4 1 2 3 4
16. (a) If f = and g = , find f-1 gf and gfg-1
2 3 4 1 3 1 4 2
(b) Prove that the cyclic group is abelian
17. (a) Solve the recurrence relation an – 5an-1 + 6an-2 = 0 where
a0 =2 and a1 =5
(b) Prove by using induction that an - bn is divisible by (a – b) for
all nN.
(or)
18. (a) Show that if L is a distributive lattice then for all a,b,cL,
(a*b) (b*c) (c*a) = (ab)*(bc)*(ca).
(b) Find the minimum sum for the function.
f(a,b,c,d) = abcd+abcd+abcd+abcd+abcd, by Karnaugh
map method.
19. (a) Show that a simple graph with n vertices and k components
(n − k )(n − k + 1)
can have at most edges. (8)
2
(b) Write the adjacency matrix of the graph. (4)
(or)
20. (a) Verify if G and G1 are isomorphic
(b) What is the postfix form of ((a+b)3) + ((a-b) /3)?
