Code No: R6-11-MCA R6

www.prsolutions.in
M.C.A. I Semester Regular Examinations, January 2009
DISCRETE STRUCTURES
Common to 2008, 07 and 06 Admitted Batches
Time: 3 hours Max Marks: 60
Answer any FIVE Questions
All Questions carry equal marks
?????

1. (a) Obtain a conjunctive normal forms of the

i. P ∧ (P → Q)
ii. ¬(P ∨ Q) →
← (P ∧ Q)
(b) Explain about principal Disjunctive Normal Forms.
2. (a) Discuss clearly about predicates.
(b) Indicate the variables that are free and bound. And also show the scope of
the qualifiers.
i. (x)(P (x) ∧ R(x)) → (x)P (x) ∧ Q(x)
ii. (x)(P (x) ∧ (∃x)Q(x)) ∨ ((x)P (x) → Q(x))
3. Given S = {1, 2, 3, 4} amd relation R on S defined by R = {(1, 2), (4, 3), (2, 2),
(2, 1), (3, 1)}. Show that R is not transitive. Find a relation R1 ⊇ R such that R1
is transitive. Can you find another relation R2 ⊇ R which is also transitive?
4. (a) Let (M, ∗) be a monoid. Then prove that there exits a subset T ⊆ M M such
that (M, ∗) is isomorphic to the monoid (T, o).
(b) Explain clearly about Homomorphism.
www.prsolutions.in
5. (a) How many ways can a committee of k people be chosen from 10 people if k
can be1,2,3.. or 10.
(b) A mother distributes 5 different apples among 8 children. How many ways
can this be done if each child receives almost one apple?
6. Find a recurrence relation for the number of ways to make a pile of n chips using
garnet, gold, red, white, and blue chip such that no two gold chips are together.
7. (a) Suppose that G is a non-directed graph with 12 edges. Suppose that G has
6 vertices of degree 3 and the rest have degree less than 3. Determine the
minimum number of vertices G can have.
(b) How many vertices will the graph have, if it contain 21 edges, 3 vertices of
degree 4, and the other vertices of degree 3.
8. (a) List the basic rules for constructing Hamiltonian paths and cycles.
(b) Prove that a simple graph with n vertices (n ≥ 3) in which each vertex has
degree at least n/2 has a Hamiltonian cycle.

1 of 2
www.prsolutions.in
Code No: R6-11-MCA R6
?????

2 of 2