November 2012 Bachelor of Computer Application (BCA) Semester 5 BC0052 Theory of computer science 4 Credits

(Book ID: B0972) Total Marks: 60 Marks Answer the following questions. Each question carries equal marks. (10 6 = 60)

(mod m ) 1. Show that the relation a b is an equivalence relation.

( x2) 2. Using the definition of order show that x 2 + 2 x + 1 is O .

3. Prove by the method of contradiction that 4. Prove by mathematical induction
12 + 2 2 + 3 2 + ....... + n 2 = n ( n + 1)( 2n + 1) 6

2 is not a rational number.

5. Prove that The sum of the degrees of the vertices of a graph G is twice the number of edges 6. Prove that T is a tree there is one and only one path between every pair of vertices