Scribd
Upload
32 views6 pages

August 2010 Bachelor of Computer Application (BCA) - Semester 5 BC0052 - Theory of Computer Science 4 Credits

This document contains two assignments related to theory of computer science. The first assignment contains 6 questions asking to prove properties related to equivalence relations, order of functions, proof by contradiction, mathematical induction, properties of graphs and trees. The second assignment contains 6 similar questions asking to prove properties of trees, regular languages, finite state automata, Moore and Mealy machines, and regular expressions. The document provides definitions and context for mathematical concepts like equivalence relations, order of functions, proof by contradiction, mathematical induction, graphs, trees, finite automata and regular expressions.

Uploaded by

Sandeep Sheoran
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
32 views6 pages

August 2010 Bachelor of Computer Application (BCA) - Semester 5 BC0052 - Theory of Computer Science 4 Credits

This document contains two assignments related to theory of computer science. The first assignment contains 6 questions asking to prove properties related to equivalence relations, order of functions, proof by contradiction, mathematical induction, properties of graphs and trees. The second assignment contains 6 similar questions asking to prove properties of trees, regular languages, finite state automata, Moore and Mealy machines, and regular expressions. The document provides definitions and context for mathematical concepts like equivalence relations, order of functions, proof by contradiction, mathematical induction, graphs, trees, finite automata and regular expressions.

Uploaded by

Sandeep Sheoran
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

1

August 2010 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:

6 10 = 60

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

2. Using the definition of order show that x 2 + 2x + 1 isO ( x 2 ).

Answer

2
3. Prove by the method of contradiction that number.

2 is not a rational

Answer Definition of: Proof by contradiction this method is very useful technique to prove that some statements are true. In this technique, let us assume that property q is not true. Using logical reasoning we have to get a conclusion that contradicts the given conditions.

4. Prove by mathematical induction

12 + 22 + 32 + .......+ n 2 =

n ( n + 1)( 2n + 1) 6

Answer Definition of: The principle of mathematical induction states that any set of natural numbers containing zero and with the property that it contains n+1 whenever it contains all the numbers up to and including n must in fact be the set of all natural numbers.

5. Prove that The sum of the degrees of the vertices of a graph G is twice the number of edges

Answer

6. Prove that T is a tree there is one and only one path between every pair of vertices

Answer

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

Assignment Set 2 (60 Marks)

Answer the following:

6 10 = 60

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

Answer

, S }, S )then find L(G), the language 2. If G =({ S },{ 0,1},{S 0S 1


generated by G. 3. Obtain a DFA to accept strings of as and bs starting with the string ab. 4. Briefly describe Moore and Mealy machines 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 q
1

q
2

q
2

( R ) ={w /w { 0,1} 6. Obtain a regular expression such that L } with at least

three consecutive 0s.

You might also like