Reg. No.

Q.P. Code: [08 SC05/

3400 11 SS 05/
CA 05/11 IT 05/
11
05/08 MM 05]
08 CTG

2008 onwards)
admitted from
candidates
(For the
APRIL 2017.
EXAMINATION,
B.Sc. DEGREE

Second S e m e s t e r

Applications/
Science/Computer
Part III -Computer
Information Technology/Software Systems/
Technology/Multimedia
Web Technology
Computer
Allied D I S C R E T E MATHEMATICS

Maximum: 75 marks
Time: Three hours

Answer ALL questions.

SECTION A-(10x 1 10 marks)

Choose the correct answer

1. Which of the following is true?

(a) 1={1} (b) 1e1

(c) d) le1}
 null set?
18 a
following
ich ofthe 6. Let f: A > B. Determine
-0,zeN which of the
:x'-4
not one-one following is
a
even prime number
B: X15an (a) A={1, 2,3, 4}= B and
yC-ix:x>5 and x>10} f {(1, 1), (2, 3), (3, 4),
(4,2
y
-:x 2x +1=10 b) A {1, 2, 3}, B= {a, b, c, d} and
f (,a), (2, a), (3, c)}
3 Which of the following is equivalent?
(b) (c)A= {%,%. Y% B={z, y, z, w}
(a) (pg)-phq pAq)=pvg f%. x),(0%, ), %, w)}
and
c)-pvq)***pyq
d) (pvg)a-(png)
(d) A= {1, 2, 3}, B={1, 2, 3, 4} and
Which of the following is not a
tautology? f= {(1,1), (2, 2), (3, 3))
(a) pAq- (b) ppvq 7. If f:A>B such that
(c) p > f(x)=x-1 and g:B->C
(d) q p>9 such that gy)=y* then (g /)(r) =?
t A-
,2,3,4}, R be a relation on A. The (a) (x-1 (b) -11
asymmetric relation is
a) R
() (r-1* -1 (d) -2
H1, 3), (4, 2), (2, 4), (3, 1), (2,2)
8. Let u =
abab* and v =bab then Ju 2 u= ?
(e) R- AxA (a) 6 (b) 8
d)
R-(0, 2), (1,3), (1, 4), (2,3), (2, 4), (3, 4)} (c) 10 (d) 12
3 3400
2 3400
 does a regular graph of degree 1°, L and L.
9. How many vertices 14. (a) If L= {a*, ba} find
have?
3 with 9 edges
(b) 8 Or
(a) 6
(d) 10 Let ={0,1. Show that the following
(c) 4 (b)
False : In a graph the number of odd expressions are regular expressions over
10. State True or
odd.
degree vertices are
) 0'(0+1)
SECTIONB-(5 x 5= 25 marks)
(ii) 00'(0+1).
11. (a) If A,B, C are the sets, then prove that
An(B-C)= (AnB)-(AnC). 15. (a) What is meant by isomorphism of graphs?
Or Or
all the partitions of the set the different types of connected
(b) Find (b) Explain
A={1,2,3, 4}. directed graphs.
12. (a) Show that p>(qvr)= (p> q)v (p >r). SECTION C - (5 x 8 = 40 marks)
Or
16. (a) If A and B are any two sets then prove that
(6) Express p q interms of T only.
) An(B -A)= ¢
13. (a) Show that the relation (less than or
equal to) defined on the set of positive i) (A-B)nB = o.
integers is a partial order relation.
Or
Or
b) If R and S are relation from A to B then (b) Prove that (4xC)- (Bx C)= (A-B)xC.
prove that R'cS when Rc S.
5 3400
4 3400
17. (a) Show that (p>(qar))>~(pq) isa 20. (a) Show that a simple graph G with n vertices
and k components cannot have more than
contingency.
Or
n-)Gn-k+1)
2
edges.
(b) Show that p follows from the arguments Or
pv g)(rns), r=t and ~ (b) Draw the expression free and hence write
postfix and prefix form of the expression
18. (a) A relation R= {x, )/x-y is divisible by3 (a+b-c/*y
and * = {1, 2, 3,...,7}. Show that R is an
equivalence relation on x.
Or
Show that equivalence relation R in
(b) an
non-empty set A determines a partition
of A.
19 (a) Find the language L{G) generated by the
grammar with V={S}, S=0,1} and
productions P= {S-> 0S1, S->2}.
Or
(b) Consider the context-free grammar with
productions SbAS,S->b, A.-> aS find
the derivation free of the word "babbabb".
3400 1 3400
 Reg. No. ...
4017 Q.P. Code: [08 MA 19/
08 MAC 16]

(For the candidates admitted from 2008 onwards)

B.Sc. DEGREE EXAMINATION, NOVEMBER 20116.

Fifth Semester
Part III - Mathematics/Mathematics with Computer

Applications
DISCRETE MATHEMATICS

Time: Three hours Maximum: 75 marks

SECTION A - (10 x 1 = 10 marks)

Answer ALL questions.

Choose the correct answer

1. PV P=

(a) P b) T

(c) F (d) P

P V-P=

()P ()T
() F (PF) P
 Let P(x): x +1>x, xeR. What is the true value 3, 4 6rTD 5601S 6T LmL aflcms op)lulor
2 1, 2,
of V, P(:)? 6T600T 680f1és6M%
(a) F b) T ) 12 )24
(c) Neither T nor F (d) Both F and T ()16 (Fr) 8
P(x):x +1>x, xeR GTla V, P(x)-s 2cTLD 5. A grammar is said to be if the
LoUSO productions are of the form A > a , A>aB
() F Context-sensitive (b) Context-free
(a)
()T (c) Regular (d) None
( Fgdma, T vm Aa, A aBB 6T 60T a1.aBeb DGKGD
(F) F,T e60r
6T60TLGIo
3 Let g:R> R be defined by s(«)= x. Then
8(-1) =
(a) (b) ( upssorT (m)Tgijulávane
(c) 0 (d)
6. If L={a, b, c} over A =
{a, b, c, then
g:R>R 6T60I s()=a orildg-1) =
(a)a} b)
(){1 () (d) None
()0 (m)-1} L ={a, b, e} A={a, b, c} GT6O1pTdb
4. of
The number even permutations of the set
1, 2, 3, 4 is
(a) 12 (b) 24
(C) 16 PTP 6TIauólvmw
(d) 8
2 4017 3 4017
 1. The dual of av =1 is- with vertices and n-1
10. Any connected graph n
(a) ava=0 (6) a a a=0 edges is a
(c)a
aaa =1 (d) ava=1
(a) Cycle (b) Tree
ava=1- TL (c) Complete graph (d) None
() av =0 () a A =0
a A =1| ()ava=1
n p60 601606TU|LÓb n-1 26l60GTLJLD
noÉÚULL AJDJLILLÒPG-
8 Every finite Boolean algebra has
elements for some positive integer n ()ippe (LoT
(a) 2 (b)n
(T) 6T51aqÁábcnw
(c) n/2 (d) 2n
SECTION B - (5 x 5 25 marks)
nm801T 26T6T601, -Gpi o GT0T
Answer ALL questions.
() 2" ()n2
( n/2 (T) 2n
11. Show that P(@v R)e»(P->Qv(P» R).
9. The number of vertices of odd degree in a graph is Bgaa PQv R)»(P->}v(P-R).
(a) Odd (b) Or
(c) Even (d) None (b) Prove that ax) (P(«) » Q(t)=
PG J60TULG$a DMDÚUML ULLO LOma156Tt|l60T
3x) P()nax) e«).
6T60T 600flsm5
() mpÚUML ( 0 ()(P)n Q)=6«)P()n(ax) e()
6T60 6lga5.
( LL6ÜUL (6Tgajuálévnw
4 4017 5 4017
 complemented and
12. (a)
Show that the function f: R>R defined by 14. (a) If (L, A, v) is a

that the
bijection. distributive lattice, then prove
f(x)= 3* -1, xeR, is a
element a e L is
complement a of any
f:R>R 6rsTLI f(«)=3*-1,xeR, epob unique.
amuua85ÚULL PG AGILPl5 G6TUY 6T6T
GESTÁ 6TB5 PG 2-gUy aeL gT 56flúuLL
Or
b) Prove that the Kernel of a homomorphism Or
f from a group G to G' is a subgroup ofG. (b) Simplify the Boolean function F(,),)=
r'az)v(*'a yv(*ay'az)v(ynz).
F%y,a)-(*'nz»(r'av)v(*ay'nz)v(ynz)
STTD yabluwuo0T alsuÓUTLML 6T6t|lmDLUUGSGI5.
13. (a) For the grammar G defined by S>AB,
15. (a) Prove that there must be a path joining twwo,
B a , A >Aa, A>6B, B->Sb, give the vertices of odd degree, if G has exactly
derivation and derivation tree for thee two-vertices of odd degree.
sentential form baabaab.
G 6T6OTD muLBBd Ppnpu UMLULLL
SAB. B->a, A ->Aa, A->bB, B->Sb pmL pM601856M6IT Glsm60TL4-($GLOT6IT,
ypavd ouaTugssúuLL G aGOTD $50T 0T
pasbnppD Lpp 5G5rpp LOTLD DHEGD OT T legL.
baabaab a6oTp aTsSug Alg.0J5FIsG 5G5. Or

Or (b)
b) Define Hamiltonian graph with example.
Also give an example for a non-hamiltonian
(b) Construct a grammar for the language graph.
L={a'bili21 6TOigis5mLOLT oaf: pmLblcGLTofuT
L =\a'6" li21} arsnp Guomylulc ssomja mTULb; apTislGLToflu
umJULÒ OTO$GI5TLO SG5.
STPEI.

6 4017 7 4017
 SECTION C - (5 x 8 = 40 marks) 18. (a) Show that the language
L(G)={a"b"c" /n 21 is generated by the
Answer ALL questions.
followinggrammar:
16. (a) () Show that (png)->{pvq) 1S a
G-(s, B, C}{a, b, c},S,6), where
tautology. consists of productions
(1) Prove that P)R and SaSBC, S ->a BC, CB-> BC,
P>>R) are not logically aB ab, bB->bb, bC>bc, cC> cc}.
equivalent.
) (pag)>{pvg) 9O LITLLLTD OT 60T
LG)={a"b"e" In 21} arénp Qur Inagd
(ii) (P-Q)-R opnd P>{Q> R) sits6 G S, B, C},{a, b, c,S,4). aol d o TemLIGI
ums sLOLOTIGI Nda 6T6 Bez9. SaSBC, S->a BC, CB > BC.
Or aB-ab, bB->bb, bC >bc, cC->cc
(b) Show that: Or
() (P(«)->Q«), (b) Construct a PDA to accept a
given language
R(«)>-Q)=R°)>-P(). L by empty store, where L= a"b" In 21}.
)(Pla)Q(«).
()R()Q)=4)R(«)>-P(«)
6T60TLI5 Blnas.
L= a"b" In 21}gpG RO LI4. 25uTSE5LÓ.
19. (a) If a, b, c are elements of a distributive
17. (a) If f:A>B is a bijection, that
prove
lattice (L, A, v) prove that avb=avc and
f:B>A is also a bijection.
aab=anc® b=c.
f: A >B PG Qgaifs Gsriy 6T68011od a, 6, c 6T601LD
f:B A 2-pILLYBar
gT DGaufls GsrUy T Blpa5. 6oTLLe0Ud
Or
Gb5nd avb=avc Lobg
aab aacb=C 6T601 Bgiajs.
(6) State and prove Lagrange's theorem.
Or
Gs Gsppsms 6T(LP Blga5.
8 4017 9 4017
 b)Show that in any
(b)
Boolean algebra (B, +,),
b, ce B.
ab +bc+ca =b +bc+ca, a,

6TD
(B, +,)-u
ab +bc +c =b+bc+Ca, a, 6, cE B, 6T60

20.
20. (a) Prove that a connected graph G is an Euler
graph iff all vertices of G are even degree.
RT5mrsBULLL MTULLO LODgiD A6MTSS
pm6015 (615LÒ LÚUML uLLO BUpETÀ

Or

(b) Obtain the binary tree for the following tree

10 4017
 Reg. No. * * * * * *

3400 Q.P. Code : [08 SC 05/

11 CA 05/11 IT 05/ 11 SS 05/
08 CTG 05/08 MM 05]

(For the candidates admitted from 2008 onwards)

B.Sc. DEGREE EXAMINATION, APRIL 2017.
Second Semester

Part III -Computer Science/Computer Applications/

Information Technology/Software Systems/
Computer Technology/Multimedia Web Technology

Alied DISCRETE MATHEMATICS

Time: Three hours Maximum: 75 marks

Answer ALL questions.

SECTIONA-(10 x 1 = 10 marks)

Choose the correct answer

1. Which of the following is true?

(a) 1- {1} b) 1e1}
(c) 1c{1} (d) le{1}
 Reg. No.
3400 Q.P. Code : [08 SC 05/
11 CA 05/11 IT 05/ 11 SS 05/
08 CTG 05/08 MM 05]

(For the candidates admitted from 2008 onwards)

B.Sc. DEGREE EXAMINATION, APRIL 2017.

Second Semester

Part III-Computer Science/Computer Applications/

Information Technology/Software Systems/
Computer Technology/Multimedia Web Technology

Alied-DISCRETE MATHEMATICS
Time: Three hours Maximum: 75 marks

Answer ALL questions.

SECTIONA-(10 x 1 10 marks)

Choose the correct answer

1. Which of the following is true?

(a) 1 {1} (b) 1e1

(c)1c1} (d) 1e{1}
2. Which of the following is a null set? 6. Let f: A> B. Determine which of the following is
(a) A= *:r-4 =0, xeR not one-one
(b) B= *: x is an even prime number (a) A-1, 2, 3, 4} B and
=
f {(1, 1), 2, 3), (3, 4), (4, 2)}
(c) C={*:*>5 and *>10}
b) A {1, 2, 3}, B= {a, b, c, d} and
(d) D *: x-2x +1l =10 f={1,a), (2, a), (3, c)}
3. Which of the following is equivalent? (c) A= V, Y, B={ax, y, z, w} and
(a) -(pAg)=~pa~q (b) PAg)=pv~q f=%, ). . ) %, w)}
(c)(pvg)=~pv~q (d) pvg)=-(pnq) (d). A= {1, 2, 3}, B={1, 2,3, 4} and
f {(1, 1), (2, 2), (3, 3)}
4.
4. Which of the following is not a tautology?
(a) paq>9 (6) p>pvg 7. I f f: A >B such that f(«)=«-1 and g:B ->C
such that g(v)= y* then (g /)x)=?
()9P9 (d) q p>q
Let A= 1,2, 3, 4}, R be a relation on A. The (a) (-1) (b) -1
5.
asymmetric relation is ( -1-1 (d) *
(a) R={(1, 3),(4, 2), (2, 4), (3, 1), (2,2)}
8.
8. Let u =a'bab and v=bab then lu2 u=?
(b) R
(a) 6 (b) 8
c) R= AxA
(c) 10 (d) 12
)R-(1.2),0,3), 0, 4) (2,3), (2,4), (3, 4)}
3400
2 3400
 Which of the following
is a null set? 6. Let f: A > B. Determine which of the following is
not one-one
(a) A= e: x*-4 =0, xcR}
and
is an even prime number? (a) A={1,2, 3, 4}=B
(b) B= {*: *
x>10}
f {1, 1), (2, 3), (3, 4), (4, 2)}
(C) C=ix:x>5 and
(b) A={1, 2, 3}, B= {a, b, c, d} and
(d) D e: -2x+1 =10 f {(1,a), (2, a). (3, c)}
3. Which of the following is equivalent? (c) A {%,Y} B={x, y, z, w} and
(a) (pag)=~pa~q (b) (PpAg)=~ pv~q f= {%, ),. , ») %. w)}
(c)-(pvg)=~pv-q (d (pvg)=-(p^q) (d) A={1, 2, 3}, B={1, 2, 3, 4} and
f- {(1, 1). (2,2),. (3, 3)}
4. Which of the following is not a tautology?
(a) paqq (b) p=pvq 7. If f: A->B such that f(«)= x -1 and g:B>C
ach that sv)=s* then
(d) (g*f\«) =?
5. Let A={1,2, 3, 4}, R be a relation on A. The (a) x-1 (b) -1
asymmetric relation is
(c*-1) -1 (d)
(a) R= {(1, 3), (4, 2), (2, 4), (3, 1), (2,2)}
(b) R= ¢ 8 Let u = a bab* and U= babÁ then Ju2 u= ?
(c) R= AxA (a) 6 (b)8
(d) R= {(1, 2), (1, 3), (1, 4). (2,3), (2, 4), (3, 4)} (c) 10 (d) 12
2 3400 3 3400
9. How many vertices does a regular graph of degree 14. (a) If L= {a*, baj find ' , L' and I'.
3 with 9 edges have?
(a) 6 (b) 8 Or
() 4 (d) 10
b) Let = {0,1}. Show that the followingg
10. State True or False: In a graph the number of odd expressions are regular expressions over E
degree vertices are odd.
) 0'0+1)
SECTIONB ( 5 x 5 25 marks)
(i) 00(0+1).
11. (a) If A,B, C are the sets, then prove that
An (B-C)= (AnB)-(AnC). 15. (a) What is meant by isomorphism of graphs?
Or Or
(b) Find all the partitions of the set
(b) Explain the different types of connected
A= {1,2,3, 4.
directed graphs.
12. (a) Show that p>(qvr)=(p>g)v(p>r).
SECTION C -(5 x8 = 40 marks)
Or
(b) Express pvq interms of Tonly. 16. (a) If A and B are any two sets then prove that
) An(B-A) = #
13. (a) Show that the relation (less than or
equal to) defined on the set of positive i) (A-B)nB = #.
integers is a partial order relation.
Or Or
(b) If R and S are relation from A to B then b) Prove that (AxC)- (Bx C)=(A-B)xC.
prove that Rc S when RcS.
3400 3400
 20. (a) Show that a simple graph G with n vertices
17. (a) Show that (p(qar)=-(p<a) is a
and k components cannot have more than
contingency.
n-k)(n-k+1) edges.
Or
(b) Show that p follows from the arguments Or
(b) Draw the expression free and hence write
pv g)>(7as), r t and ~
r.
postfix and prefix form of the expression
18. (a) A relation R = {{x, v)/x - y is divisible by 3 (a+b-c/«*y).
and x={1,2, 3,.,7}. Show that R is an
equivalence relation on x.
Or
(b) Show that an equivalence relation R in a
non-empty set A determines a partition
of A.
19. (a) Find the language L(G) generated by the
grammar with V {S}, S= {0, 13 and
productions P={S0S1, S >2}.
Or
Consider the context-free with
(b grammar
aS find
productions S>bAS, S->b, A.
the derivation free of the word "babbabb".
3400 7 3400
6