MCA.1/11.12.

1079

M.C.A.

DEGREE

I SEMESTER

EXAMINATION

NOVEMBER

2012

CAS 2104 DISCRETE

MA THEMA TICAL STRUCTURES

Time: 3 Hours. PART A (Answer ALL questions)

Maximum Marks: 50

(15 x 2 == 30) 1. (a) Is Ax(B~C)=AxB claim. (b) Write the truth table ofthe disfunction PVQ of the following statements: ~ Axe where ~ denotes the symmetric difference? Justifyyour

: 3 is an integer
q: 3 is greater than 5 (c) Let X = CC, the set of complex numbers. Define a relation - as follows; a + ib - c + id if a ~ c and b ~ d. Is - a partial order relation? Is it a total order? Justify.

n.

(a) (b) (c)

Define a Boolean matrix. How are the usual matrix operations defined on it? Let B

= {3nln

Z,O < 3n ~ 2102}. Find the number of elements in B.

State the pigeon hole principle.

11l.

(a)

Find the recurrence relation and initial condition for the sequence S: 0,1,3, 7, 15, 2n -1, . Write the characteristic equation of the following linear homogeneous equation. an = 7 an_I - 10an_2 with initial conditions ao = 1, a. = 8 . Also find the roots of the characteristic equations.

(b)

(c)

Consider conditions

the non homogeneous

recurrence

relation
In

an

-5a

n_1

= 3n

n ~ I with initial

ao = 1. Show that the general solutions

of the equation can be obtained from

a particular solution p" of the equation and a solution relation.

U; of a homogeneous recurrence

IV.

(a) (b) (c)

Construct the truth table for the Boolean expression a(XI'X2,X3) Give an example of a Boolean algebra.

= (XI

+x2

).(x.

+(X2'X~)).

In a Boolean algebra B, for any a, band c, prove that (a + bl ) + ac

= a + bl .
(P.T.O)

2 V. (a) (b) (c) Prove thatthe empty set and the language

{A}

are regular languages.

Define a finite state machine and give an example. Define context free grammar and give an example. PARTB (5x4=20)

VI.

A.

Describe the principle of mathematical induction. Show that l l" =T" is divisible by n for all positive integers n.

OR
B. Define the transitive closure R" of a relation R and a non empty finite set A. Let
A = {I, 2, 3, 4} and R {( I, I), (3,3), (I, 3), (2, 3), (3, 2)( 4,2) ). Compute the transitive closure

ir .
VB. A. Solve the recurrence relation an = 5an_, -8 an_2 +4an_3 with initial conditions ao =0, a, =2,a2 B. =10.

OR
State and prove Pegion hole principle.

VIII.

A.

Define atom in a Boolean algebra B. If b uniquely as a sum of atoms.

B, b

"* 0,

then show that b can be expressed

OR
B. Describe the Karnaugh map to minimise a sum -of -product Boolean expression. the Karnaugh map to the sum -of- product Compute

a(x,y)

= xy+xY+x)/.

IX.

A.

Draw a circuit by using NOT, OR and AND gates corresponding to the following Boolean expression x' + (xy + yz).

OR
B. For the Boolean expressions (i) (x+ y)(x' + yz), for x = 0, y = 1 and z = l. (ii)

xyz+x)/z+ yz, for x

= 0, y = 0 and

z = 1.

x.

A.

Define extended transition function for a DFA M = (Q,L;,Qo,p,F). and for any qEQ, show that p' (q,nv) =/(p'

For any ulV

L;'

(q,n),v).

OR B.
Let

M = (Q,L;,qo,p,F)
p qo ql q2 q3
(i) (ii)

be the DFA such that Q

= (qO,ql,q2,q3)' L; = (a,b,c) F = {qo},

c

the initial state is qo and p is given by, a b

qo qo ql q2

qo q2 q2 q.

qo q3 q3 q3

Draw the state diagram. Find L (M).

***