JNTU World

or

ld

www.alljntuworld.in

Group - A (Short Answer Questions)

Questions

JN
TU

S. No.

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
1.
2.
3.
4.
5.
6.
7.
8.
9.

UNIT - I
Explain transition diagram, transition table with example.
Define transition function of DFA.
Define transitions.
Construct a DFA to accept even number of 0s.
Define Klean closure.
Construct a DFA to accept empty language.
Explain power of an alphabet?
Write transition diagram for DFA accepting string ending with 00.
Write transition diagram for DFA to accept exactly one a.
Define the language of NFA.
UNIT II
Define Regular Languages.
Define Pumping Lemma.
Write the applications of pumping lemma for regular languages.
List any two applications of regular expression.
Define Context Free Grammars.
Write through an intermediate state whose number is not greater than
K-1.
Write regular expression for denoting language containing empty
string.
Differentiate LMD and RMD.
Define ambiguous grammar.

Blooms
Taxonomy
Level

Course
Outcomes

Understand
Remember
Remember
Apply
Remember
Apply
Understand
Apply
Apply
Remember

1
2
2
2
1
2
1
2
2
2

Remember
Remember
Apply
Remember
Remember
Apply

7
7
7
7
8
7

Apply

Understand
Remember

8
8

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in

4.
5.
6.
7.
8.
9.
10.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

JN
TU

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.

Course
Outcomes
8

Remember
Remember
Remember

9
8
9

ld

1.
2.
3.

State the following grammar is ambiguous.

S-> AB|aaB
A->a / Aa
B->b
UNIT III
Define Greibach normal form.
Define nullable Variable.
State the nullable variables from the following CFG.
SABCa | bD
ABC |b
Bb |
C |
Dd
State the symbol is used to label the interior node of the parse tree.
Define the language of PDA accepted by final state.
List the steps to convert CFG to PDA.
Define CNF.
Define PDA.
Define NPDA.
Differentiate between deterministic and nondeterministic PDA.
UNIT - IV
Write the Turing Machine model.
Explain the moves in Turing Machine
Define an ID of a Turing Machine?
Define the Language of Turing Machine.
List types of TM
Define Turing Machine.
Write the difference between Pushdown Automata and Turing
Machine.
Explain Churchs Hypothesis.
Define Context sensitive language.
Define multi head Turing Machine, multi dimensional Turing
Machine.
UNIT - V
Define Chomsky hierarchy of languages.
Define Universal Turing Machine
Define LR(0) grammars.
Define decidability & undecidability
Define P,NP problems.
Define Rice s theorem
Give examples for Undecidable Problems
Define Turing Machine halting problem.
Define Turing Reducibility
Define PCP.

Blooms
Taxonomy
Level
Remember

Remember
Remember
Remember
Remember
Remember
Remember
Understand

8
10
11
9
10
10
10

Apply
Understand
Remember
Remember
Remember
Remember
Apply

12
12
12
12
12
12
12

Understand
Remember
Remember

12
12
12

Remember
Remember
Remember
Remember
Remember
Remember
Understand
Remember
Remember
Remember

4
12
5
13
13
13
13
13
13
13

or

10.

Questions

S. No.

JNTU World

2. Group - II (Long Answer Questions)

S. No.

1.
2.
3.
4.
5.
6.

Questions

10 Marks Questions
UNIT - I
Define language over an alphabet with examples.
Write a DFA to accept set of all strings ending with 010.
Give example for Minimize the DFA .
Construct a Moore machine to accept the following language.
L = { w |w mod 3 = 0} on = { 0,1,2}
Write any four differences between DFA and NFA
Convert NFA with to NFA with an example.
Construct NFA for (0 + 1)*(00 + 11)(0 + 1)* and Convert to DFA.

Blooms
Taxonomy
Level

Course
Outcomes

Remember

Understand
Apply

2
3

Apply
Understand

2
2

Apply

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in

8.
9.
10.
1.
2.
3.
4.
5.
6.

Construct NFA for (0 +1)*(00 + 11)(0 + 1)* and Draw the transition
table and transition diagram and example strings.
Illustrate given 2 FAs are equivalent or not with an example.
Construct Mealy machine for (0 + 1)*(00 + 11) and convert to Moore
machine.
Convert Moore machine to Mealy machine with an example.
UNIT - II
Convert Regular Expression 01* + 1 to Finite Automata.
Convert given Finite Automat to Regular Expression using Ardens
theorem.
Convert given Finite Automat to Regular Expression using standard
method(RijK method)
Explain Identity rules . Give an example using the identity rules for
the simplification.
Construct Regular grammar for the given Finite Automata.
Use G be the grammar
SaBbA
Aa aS bAA
Bb bS aBB
For the string aaabbabbba ,

Find
a. Leftmost Derivation.
b . Rightmost Derivation.
c. Derivation Tree.

9.
10.

JN
TU

1.

Explain the properties, applications of Context Free Languages

Construct right linear and left linear grammars for given Regular
Expression.
Construct a Transition System M accepting L(G) for a given
Regular Grammar G.
Discuss the properties of Context free Language. Explain the
pumping lemma with an example.
UNIT III
Write a short notes on Chomsky Normal Form and Griebach Normal
Form.
Show that the following grammar is ambiguous with respect to the
string aaabbabbba.
S
aB | bA
A
aS| bAA| a
B
bS | aBB | b
Use the following grammar :
S
ABC | BbB
A
aA | BaC|aaa
B
bBb| a|D
CCA|AC
D

Eliminate -productions.
Eliminate any unit productions in the resulting grammar.
Eliminate any useless symbols in the resulting grammar.
Convert the resulting grammar into Chomsky Normal Form
Illustrate the construction of Griebach normal form with an example.
Show that the following CFG ambiguous.
S
iCtS | iCtSeS | a
C
b
Discuss the Pumping lemma for Context Free Languages concept
with example {anbncn where n>0}
Write the procedure to convert CFG to PDA and also convert the
following CFG to PDA.
S
B | aAA
A
aBB | a
B
bBB|A
C
a

7.
8.

2.

3.

4.
5.

6.
7.

Blooms
Taxonomy
Level
Apply

Course
Outcomes
2

Apply
Apply

6
3

Understand

Understand
Understand

e
7

Understand

ld

7.

Questions

Understand

Apply
Apply

7
8

or

S. No.

JNTU World

Understand
Apply

8
7

Apply

Understand

Apply

Understand

Apply

Apply
Apply

9
8

Understand

Apply

11

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in

10.

1.
2.
3.
4.

5.
6.
7.
8.

JN
TU

9.

10.
1.
2.
3.
4.

5.
6.
7.
8.

9.
10.

Course
Outcomes
10

Apply

10

Apply

11

ld

9.

Construct a PDA to accept the language L ={ anbn | n >= 1}

by a final state. Draw
the graphical representation of the PDA.
Also show the moves made by the PDA for the string aaabbb
Construct NPDA for L = { W WR /W ( 0 + 1)*}
M = ({q1,q2},{0,1}.{R,B,G},,q1,R,}
Write the procedure to convert from the given PDA to a CFG.
Convert the following example.
(q0,b,z0)={q0,zz0)
(q0, b, z)=(q0,zz)
(q0, ,z0)=(q0,)
(q0,a,z) = (q1,z)
(q1,b,z)=(q1,)
(q1,a,z0)=(q0,z0)
UNIT IV
Define a Turing Machine. With a neat diagram explain the working
of a Turing Machine.
Construct a Turing Machine which shift non block symbols 3 cells
to the right.
Construct a Turing Machine to accept the following language.
L = { 0n1n0n | n 1}
Construct a Turing Machine that accepts the language
L = {0n1n | n 1}. Give the transition diagram for the Turing
Machine obtained and also show the moves made by the
Turing machine for the string 000111.
Construct a Turing Machine to accept the language
L= { w#wR | w ( a + b ) *}
Write short notes on Recursive and Recursively Enumerable
languages?
Write the properties of recursive and recursively enumerable
languages
Construct a Turing Machine to accept strings formed with 0
and 1 and having substring 000.
Construct a Turing Machine that accepts the language
L = {1n2n3n | n 1}. Give the transition diagram for the Turing
Machine obtained and also show the moves made by the
Turing machine for the string 111222333.
Construct a Turing Machine to implement Subtraction ( m-n ).
UNIT V
Explain the concept of undecidability problems about Turing
Machine
Write a note on Modified PCP and Multi tape Turing machine.
Explain individually classes P and NP
Write a shot notes on post's correspondence problem
and check the following is PCP or not.
I
A
B
1
11
111
2
100
001
3
111
11
Explain the Halting problem and Turing Reducibility.
Write a short notes on universal Turing machine
Write a short notes on Chomsky hierarchy.
Write a short notes on Context sensitive language and linear
bounded automata.
Write a short notes on NP complete , NP hard problems.
Define LR(0) items. Find LR(0) for the following example.
S Sc
S SA / A
A aSb/ab

Blooms
Taxonomy
Level
Apply

Remember

12

Apply

12

Apply

12

Apply

12

Apply

12

Apply

12

Apply

12

Apply

12

Apply

12

Apply

12

Understand

12

Apply
Understand
Apply

13
13
13

Understand
Apply
Apply
Apply

13
12
4
4

Apply
Remember

13
5

or

8.

Questions

S. No.

JNTU World

Downloaded From JNTU World (http://www.alljntuworld.in)

www.alljntuworld.in

JNTU World

3. Group - III (Analytical Questions)

1
2
3
4

1
2

Understand

Apply

Convert Regular Expression (11 + 0)*(00 + 1)* to NFA with .

Convert Regular Expression (a + b)*(aa + bb)(a + b)* to DFA.
Construct Regular Grammars for Finite Automata 0*(1(0 + 1))* .
Construct Finite Automata for
A0 a A1
A1 b A1
A1 a
A1 bA0
UNIT - III
Construct PDA for equal number of xs and ys
Convert the following grammar into GNF
A1 A2 A3
A2 A3 A1 /b
A3 A1 A2 /a
Construct NPDA for L = { W WR /W ( X + Y)*}
M = ({q1,q2},{x,y}.{R,B,G},,q1,R,}
Convert the following PDA to CFG
(q0,0,z0)={q0,xz0)
(q0,0,x)=(q0,xx)
(q0,1,x)=(q1,)
(q1,1,x) = (q1,)
(q1,,x)=(q1,)
(q1,,z0)=(q1,)
UNIT - IV
Construct a Turing Machine that accepts the language
L = {a2nbn| n 0}. Give the transition diagram for the
Turing Machine obtained.
Construct a Turing Machine that gives twos compliment for the
given binary representation.
Construct a Turing Machine to accept the following language.
L = { wnxnynzn | n 1}
Construct a Turing Machine which shift non block symbols 2 cells
to the right.
UNIT - V
Explain PCP and MPCP with examples.
Explain Turing theorem ,Halting problems, Turing Reducibility.
Construct LR(0) for
SE
E E*B
E E + B
E id
Construct LR(0) for
A aAa/B
Bb

Understand

Understand
Apply
Apply

7
7
7

JN
TU

Explain the steps for the minimization of given DFA with an

example.
Construct Mealy Machine for Residue Modulo of 5 for the ternary
number system and convert to Moore Machines.
UNIT - II

ld

Blooms
Course
Taxonomy
Outcomes
Level
PROBLEM SOLVING/ANALYTICAL/CRITICAL THINKING QUESTIONS
UNIT - I
Construct NFA for (0 + 1)*0(0 + 1)0(0 + 1)* and convert to DFA.
Apply
2
Construct NFA for (0 + 1)*010(0 + 1)* and Convert to DFA.
Apply
2
Apply
2
Construct NFA with for 0*1*12* and Convert to NFA .

or

1
2
3

Questions

S. No.

2
3
4

1
2
3

Apply
Understand

10
9

Apply

10

Understand

11

Apply

12

Apply

12

Apply

12

Apply

12

Understand
Understand
Apply

13
13
5

Apply

Downloaded From JNTU World (http://www.alljntuworld.in)