Bachelor of Computer Application (BCA) Semester 5 BC0052 Theory of computer science 4 Credits (Book ID: B0972) Assignment Set

Set 1 (60 Marks)

Answer the following questions 10

6 = 60

1. Show that the relationis an equivalence relation. )(

For Complete Solved SMU Assignment @ 2000 Rs Email: mba8182@gmail.com Ph: 09873669404

3. Prove by the method of contradiction that is not a rational number. 2 4. Prove by mathematical induction 5. Prove that The sum of the degrees of the vertices of a graph G is twice the number of edges 6. Prove that ween every pair of vertices

Bachelor of Computer Application (BCA) Semester 5 BC0052 Theory of computer science 4 Credits (Book ID: B0972) Assignment Set 1 (60 Marks)

Answer the following questions 10

6 = 60

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

For Complete Solved SMU Assignment @ 2000 Rs Email: mba8182@gmail.com Ph: 09873669404

3. Obtain a DFA to accept strings of as and bs starting with the string ab. 4. Briefly describe Moore and Mealy machines. = {a , b }, Q = { q 0, q 1, q 2 }, F = { q 0, q 1 }, a b

: Q

Q d ef in e d b y q 0 q 1 q 2 q 0 q 0 q 2 q 1 q 2 q 2