6.

E[IT- Part II CAutonopuus)

Theory. ofComPutati2.
19-11-20o 24
Seat
Ques tion
No WU23IV-223B
Code
Paper

WALCHAND INSTITUTE OF TECHNOLOGY, SOLAPUR

An Autonomous Institute affiliated to PAH Soapur Univers ity, Solapur

Information Technology
S.Y.B.Tech. Sem-IV
2023-24(CBCS pattern)
End SemesterExamination

Course: 1heory of Computation Max. Marks:60 SET: P

Course Code: 221TU4CC2T
Day and Date: Tuesday 19/1 1/2024
Time: 0230 pm to 0530 pm
Jnstructions:

1. All questions are compulsory.

2. Assume suitable data wherever necessary.
3. Draw neat sketches wherever necessary.
4 O.1 shoukd be solved in first 30minutes and answers should be written only on the first
page of answer book.
5. Supplements will not be provided.

6. Use of nonprogrammable calculator is permitted.

Q.NoSub
Que Marks
Multiple Choice Questions
12

Let M (Q..q0. A. 6)be an NFA. For anyqEQ,6*s deined as

a. 8*(q A) =A b. 8*(q, A) ={4}

c. G*(q.A) =A{q} d. 8*(q. A) ={q, A}

ii. The Language ofall strings containing atleast two b's over alphabet fa,

b} is represented by regular expression

a. (a+ b)*b(a + b)*b(a + b)* b. (bb)*

c. (abba)* d. bb

ii. For the given Mealy machine, what is the output sequence for input

sequence 01001
00

00

a.01010 b. 01101
c. 001101 d. 10011
Seat
Question
No
Paper Code

v.
WUZ3INN
Definition of S for NFA -A is

a.6:0XO b.6:0X 20
c.6: Q X {U} 20 d. S: Q

V. Number of states required to accept a Language having strings ending

with tba' over {a, b} is
a. 3 b. 2
C.
d. 4
1
vi. Which of the below production denies the format of Chomsky Normal
form:

a. SA b. S AS
C. S SA d. S a

vi.
The Language L generated by the Grammar S >aSbb |abb is

a. L= fa"br} b. L = {a"b²n}
c. L= {abr} d. L= {a"b}

viii. CFL's are not closed under

a. Union b. Intersection
c. Concatenation d. Kleene closure

ix. Push Down Automata by

M
a.

C.
(Q. ,.qo,Zo, A, 8)
is represented

b. M =(Q, E, 6, qo. A, A)
M(0,,6,q0, A) d.M (Q,, 1, 6.q0. Zo. A. )
X. If A a a production
is in grammar G, then an equivale nt move in PDA

a.ô(q, A., A) contains (q, a) b. ö(q, A. A)contains (4, a)

c. ö(q, A, A)contains (q, a) d. ö(q, A, A)contains (q, a)

xi. Pumping Lemma is used to prove that a Language is

a. Context Free b. Not ContextFree

c. Regular d. Not Regular

Xii. Which of the follow ing is not a part of Turing Machine

a, Stack
b. Tape
c. Read/write head d. Control Unit
Seat Ques tion
WU23IV-223B
No Paper Code

WALCHAND INSTITUTE OF TECHNOLOGY, SOLAPUR

An Autonomo us Institute afiliated to PAH Solapur University, Solapur

Information Technology
S.Y. B. Tech.Sen-IV
2023-24(CBCS pattern)
End Semester Examination

Course: Theory of Computation Max. Marks:60 SET: P

Course Code: 22ITU4CC2T
Day and Date: Tuesday 19/1|/2024 Time: 02:30 pm to 0530 pm
Instructions:

1. All questions are compulsory.

2. Assume suitable data wherever necessary.

3. Draw neat sketches wherever necessary.

4. Q1 should be soved in first 30 minutes and answers should be writen only on the first

page of answer book.

5. Supplements will not be provided.
6. Use of nonprogrammab le calculator is permitted.

Q.No Sub Marks

Que
Q.2 Attempt any Three 12

Construct a Regular Expression over -{0, 1} that represents the

Language of:
1. All strings containing exactly two 0's

2. All strings starting with 10andending with 11

3. All strings of length 6

4. All strings of atleast length 6

Let M1, M2 be Finite Automata recognizing Languages LI and L2

respectively over {0.1}. Find LI UL2.

0. I
Seat Ques tion
No Paper Code
WU231V-2238
im.
Design Finite Automata for a Language having Regular Expression
(0+1)* 10over {0. 1}.
v.
Convert the following NFA to DFA:

ab

q0 g2

Q.3 Attempt any Two:

i.
12
Minimize the given Finite Automata:

Convert the given NFA-A to DFA:

iii. Construct Finite Automata cquivalent to the given regular

expressions
using Kleene's Theorem:
1. (010 + 00)*
2. 10(0 01)* +
3. (0+ 1)* (11 +00)
Seat Question
No WU23IV-223B
Paper Code

Q.4 Attempt any Three: 12

Consider the CFG given below:

SS+S|S-SS*S S/S|(S)|a
Give the derivation and draw parse tree for the expression a+H(a*aya

Using pumping Lemma prove that L= {a"bnc|n 20} is not CFL.

Eliminate Unit productions from the given CFG and simplify:

a) S A0 |B
BA| 11

A 12 |B
b) S Aa B| Ca
B >aB|b
C>Db|D
DE|d
E ab
iV. Convert the given CFG to Chomsky Normal form:

Sa aA B |
>aBB|A
A

B Aa |b
Q.5 Attempt the following: 12

Attempt any Two:

(A)Construct an equivale nt PDA for the given CFG G where,
G=((S, A}, {a, b}, P, S}
P={S AA |a
A SA |b}

(B) Construct PDA for Language L accepting Balanced Parenthesis

L={),00,(0)., over E={60}

(C) Explain Variations in Turing Machine.

Attempt any one:

ii.
(A) Design Turing machine to accept the Language L=(a"b"c" n > 0}
|
(B)Design Turing machine to accept the Language L containing strings of
even length Palindrome over {a. b}.