April 2013 (Summer drive) Bachelor of Computer Application (BCA) Semester 5 BC0052 Theory of computer science 4 Credits

(Book ID: B0972)

(60 Marks)

Answer the following: 1. Prove that A tree G with n vertices has (n1) edges.

[610 = 60 Marks]

({ 2. If G
by G.

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

3. Obtain a DFA to accept strings of as and bs starting with the string ab. 4. Briefly describe Moore and Mealy machines 5. Draw the state diagram for the finite automation M = (Q, , q0, , F) where = {a, b}, Q = {q0, q1, q2}, F = {q0, q1}, : Q Q defined by q0 q1 q2 a q0 q0 q2 b q1 q2 q2

6. Obtain a regular expression such that L ( R ) { w /w { 0,1} } with at least three consecutive 0s.