Welcome to Scribd. Sign in or start your free trial to enjoy unlimited e-books, audiobooks & documents.Find out more
Standard view
Full view
of .
0 of .
Results for:
P. 1
Theory of Computer Science

# Theory of Computer Science

Ratings: (0)|Views: 4,770|Likes:
Sikkim Manipal University BCA 5th sem Assignment.
Sikkim Manipal University BCA 5th sem Assignment.

### Availability:

See more
See less

08/12/2013

pdf

text

original

February 2011Bachelor of Computer Application (BCA) – Semester 5BC0052 – Theory of computer science
–
4 Credits
Assignment Set – 1 (60 Marks)
Ques1. Show that the relationis a ≡ b(mod m ) equivalence relation.Ans.Ques2.Ans.

Ques3. Prove by the method of contradiction

that is not a rational number.Ans.
A rational number is of the form p/q where , and p, q are not having any common factors.Assume that is a rational number. So it can be written asIf p is even, then it can be written as p = 2k. Therefore 4

= 2. Therefore q is even.This is a contradiction to our assumption that p and q have no common factors. Therefore is not arational number.
Ques.4. Prove by mathematical inductionAns.
(i)
Base Step
:
Let n = 0. Then the sum on the left is zero, since there is nothing to add. The expressionon the right is also zero.If n=1, left side = = 1Right side = = = 1.Hence the result is true for n = 1.(ii)
Induction Hypothesis
: Assume that the result to be true for n = mThenAdding the 
th
term i.e.
2

to both sides of the above equation, we get,
=
=
==
Therefore the result is true for n= m+1. Hence by mathematical induction the given result is true for all positive integers n.

Ques5. Prove that “The sum of the degrees of the vertices of a graph G is twice the number of edges”Ans.
(The proof is by induction on the number of edges ‘e‘).
Case-(i):
Suppose e = 1. Suppose f is the edge in G with f = uv.Then d(v) = 1, d(u) = 1. Therefore= 2 x (number of edges)Hence by induction we get that “the sum of the degrees of the vertices of the graph G is twice thenumbers of edges
.
Ques6. Prove that“T is a tree there is one and only one path between every pair of vertices”Ans.Part 1:
Suppose T is a tree. Then T is a connected graph and contains no circuits.

## Activity (23)

raju_ahmed_37 liked this
good for student
Shasmit Gautam liked this
Pratigya Raaj liked this
Pratigya Raaj liked this
Pratigya Raaj liked this
Pratigya Raaj liked this
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->