NAME ROLL NUMBER LEARNING CENTER

: : :

VIKASH KUMAR 511037846

INSOFT
01822, Noida MCA 5TH
Theory of Computer Science

LEARNING CENTER CODE COURSE SEMESTER SUBJECT MODULE NO. (Set No.) DATE OF SUBMISSION : : : : :

FACULTY SIGNATURE :
Directorate of Distance Education Sikkim Manipal University 2nd Floor, Syndicate House Manipal-576104

Master of Computer Application (MCA) Semester 5 MC0082 Theory of Computer Science Assignment Set 1

Que1. Prove by the principle of mathematical induction that

n 2 (n + 1) 2 4

13 + 2 3 + 33 + ........ + n 3 =

13 + 2 3 + ... + n 3 = Base Step:

n 2 (n + 1) 2 4

Let n=0 then the sum of the left side is 0 Since there is nothing to add the expression on the right side is also 0 If n=1 then left side is 1 & right side = 12 (1 + 1) 2 =1 4

Hence the result is true for n=1 Induction Hypothesis: Assume that the result to be true for n=m then 13 + 2 3 + ... + m 3 = m 2 (m + 1) 2 4 m 2 (m + 1) 2 + (m + 1) 3 4

Adding the (m+1)th term i.e (m+1)3 to both side of the above equation 13 + 2 3 + ... + m 3 + (m + 1) 3 = = =

(m + 1) 2 {m 2 + 4(m + 1)} 4 (m + 1) 2 {m 2 + 4m + 4} 4

= =

(m + 1) 2 (m + 2) 2 4 (m + 1) 2 (m + 2) 2 4

There for the result is true for n=m+1. Hence the mathematical induction, the given result is true for all positive integer n. Que2: The number of vertices of odd degrees is always even. Ans2.

Que 3. Construct a grammer for the language L = {x/x {a, b}, the number of as in x is a multiple of 3} Ans:-

Q.4. Briefly explain in your own words Turing machine model. A.4. Turing Machine Model

Que.5. Define a Pushdown automata and explain its construction.

Ans. 5.

Q.6. Explain Backus-Naur Form.

A.6.

NAME ROLL NUMBER LEARNING CENTER

: : :

VIKASH KUMAR 511037846

INSOFT
01822, Noida MCA 5TH
Theory of Computer Science

LEARNING CENTER CODE COURSE SEMESTER SUBJECT MODULE NO. (Set No.) DATE OF SUBMISSION : : : : :

FACULTY SIGNATURE :
Directorate of Distance Education Sikkim Manipal University 2nd Floor, Syndicate House Manipal-576104

Master of Computer Application (MCA) Semester 5 MC0082 Theory of Computer Science

Assignment Set 2 Q.1. Prove that any connected graph with n vertices and n-1 edges is a tree. A.1.

Q.2.

Construct a grammar for the language L={aaaa, aabb, bbaa, bbbb}.

A.2.

Q.3. Briefly write in your own words the concept of transition graph.

10

A.3.

Q.4.Explain the steps involved in the conversion of mealy machine into moore machine.

11

A.4.

12

Q.5. Differentiate between DFA and NDFA. A.5.

13