You are on page 1of 1

FALL 2013 ASSIGNMENT PROGRAM SEMESTER SUBJECT CODE & NAME CREDIT BK ID MAX.

MARKS BACHELOR OF COMPUTER APPLICATION 5TH SEM BC0052 – THEORY OF COMPUTER SCIENCE 4 B0972 60 Answer all Questions Q.No Questions Marks Total Marks 10

1

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]

2

Obtain a DFA to accept strings of a’s and b’s starting with the string ab. Prove by mathematical induction
12  2 2  3 2  .......  n 2 

10

3

n ( n  1)(
6

2n  1)

[10]

10

4

Briefly describe Moore and Mealy machines.

[10]

10

5

({ 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 (n–1) edges”

[10]

10

6

[10]

10

Page 1 of 1