SPRING 2014, ASSIGNMENT PROGRAM SEMESTER SUBJECT CODE & NAME CREDIT BK ID MAX.

MARKS BCA(REVISED 2007) 5TH SEM BC0052 THEORY OF COMPUTER SCIENCE 4 B0972 60 Answer all the Questions Q.No Questions Marks Total Marks 10

Define g.c.d. (m,n) Solve recursively: (i) f(x, y) = x + y (ii) g(x, 0) = 0, g(x, y + 1) = g(x, y) + x.

[3+3. 5+3.5 ] [10]

Obtain a DFA to accept strings of as and bs starting with the string ab. Prove by mathematical induction n ( n 1)( 12 2 2 3 2 ....... n 2
2n 1)

10

[10]

10

Briefly describe Moore and Mealy machines.

[10]

10

({ S }, { 0,1}, { S 0S 1 , S }, S ) then find L(G), If G the language generated by G.

Prove that A tree G with n vertices has (n1) edges

[10]

10

[10]

10

Page 1 of 1