Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Look up keyword
Like this
1Activity
0 of .
Results for:
No results containing your search query
P. 1
r6-11-mca-discrete-structures-set1

r6-11-mca-discrete-structures-set1

Ratings: (0)|Views: 7|Likes:
Published by SRINIVASA RAO GANTA

More info:

Published by: SRINIVASA RAO GANTA on Sep 19, 2008
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/09/2014

pdf

text

original

Code No: R6-11-MCA
R6
M.C.A. I Semester Supplimentary Examinations, Jul/Aug 2008
DISCRETE STRUCTURES
- - - -
Time: 3 hours
Max Marks: 60
Answer any FIVE Questions
All Questions carry equal marks
\ue000 \ue000 \ue000 \ue000 \ue000
1. (a) Obtain the principal disjunctive normal forms of
i.\u00acP \u2228Q
ii. (P\u2227 Q)\u2228 (\u00acP \u2227R)\u2228 (Q\u2227 R)
(b) Explain the principal conjunctive Normal Forms.
2. Perform the proofs by contradiction for the following:
(a) In a room of 13 people, 2 or more people have their birthdays in the same
month.

(b) Suppose that the 10 integers 1,2,...,10 are randomly positioned around a cir- cular wheel. Show that the sum of some set of 3 consecutively positioned numbers is at least 17.

3. (a) If relations R and S are both re\ufb02exive, show that R\u222a and R\u2229 are also
re\ufb02exive.
(b) Show weather the following relations are transitive:
R1={\ue0001,1\ue001}
R2={\ue0001,2\ue001 ,\ue0002,2\ue001}
R3={\ue0001,2\ue001 ,\ue0002,3\ue001\ue0001,3\ue001\ue0002,1\ue001}
4. Discuss some simple Algebraic systems and general properties with suitable exam-
ples.
5. (a) How many di\ufb00erent outcomes are possible by tossing 10 similar coins.
(b) How many integral solutions are there tox1 +x2 +x3 +x4 +x5 = 20, where
eachxi\u2265 2
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) LetT1andT2 be spanning trees of a simple connected graph G and let e be an edge ofT1andT2 show that there is a spanning treeT3of G containing e and all but one edge ofT2.

(b) Compare breadth-\ufb01rst search and depth \ufb01rst search spanning trees for a cycle
graph with n vertices.
1 of 2

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->