Spring 2013

Master of Computer Application (MCA) Semester 5

MC0082 Theory of Computer Science 4 Credits
(Book ID: B0970)
(60 Marks)


Answer all Questions Each Question Carries 10 Marks


1. Define the concept of equivalence relation. Give atleast two examples of equivalence
relation.

2. Prove by Mathematical Induction that

4
) 1 (
.... 3 2 1
2 2
3 3 3 3

n n
n

3. Prove that a graph G is connected if and only if it has a spanning tree.

4. Prove that ) (modm b a is an equivalence relation.

5. Explain the concept of a Transition graph.

6. Explain the steps of conversion of Mealy machine into Moore machine