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

(Book ID: B0972) (60 Marks) Answer the following questions. [10 6 = 60 Marks]

( x 2 ). 1. Using the definition of order show that x 2 2x 1 is O 2. Prove by mathematical induction n ( n 1)( 2n 1) 12 2 2 3 2 ....... n 2
6

3. Prove that The sum of the degrees of the vertices of a graph G is twice the number of edges 4. Prove that A tree G with n vertices has (n1) edges 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 atleast three consecutive 0s.