Вы находитесь на странице: 1из 3

# Hall Ticket No.: R15 Set No.

## QIS COLLEGE OF ENGINEERING AND TECHNOLOGY: ONGOLE

(AUTONOMOUS)
III B. Tech., I Semester I Mid Examinations, August - 2019
THEORY OF COMPUTATION (A0517)
(Mechanical Engineering)
Date: 05/08/2019 Time: 90 Min. Max. Marks: 20
All Questions Carry Equal Marks

1 a What is Model of Computation. List the basic models of computation. 2 M CO1 BTL1
b Construct NFA which accepts all strings ending with ‘aa’ over the ∑={a,b} 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Justify that there is an equivalent NFA for the following ↋-NFA 5 M CO3 BTL5

## 4 A grammar G which is context-free has the productions 5 M CO4 BTL2

S → aAB (Rule: 1)
A → Bba (Rule: 2)
B → bB (Rule: 3)
B→c (Rule: 4)
Compute the string w = ‘acbabc’ with left most derivation and draw the
Derivation Tree
Hall Ticket No.: R15 Set No. 2

## QIS COLLEGE OF ENGINEERING AND TECHNOLOGY: ONGOLE

(AUTONOMOUS)
III B. Tech., I Semester I Mid Examinations, August - 2019
THEORY OF COMPUTATION (A0517)
(Mechanical Engineering)
Date: 05/08/2019 Time: 90 Min. Max. Marks: 20
All Questions Carry Equal Marks

1 a What is Model of Computation. List the basic models of computation. 2 M CO1 BTL1
b Give ↋-NFA which accepts string ‘abac’ and all its suffixes over ∑={a,b,c} 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Convert the following NFA with to DFA 5 M CO3 BTL5

## 4 A grammar G which is context-free has the productions 5 M CO4 BTL2

S → aAB (Rule: 1)
A → Bba (Rule: 2)
B → bB (Rule: 3)
B→c (Rule: 4)
Compute the string w = ‘acbabc’ with left most derivation and draw the
Derivation Tree
Hall Ticket No.: R15 Set No. 3

## QIS COLLEGE OF ENGINEERING AND TECHNOLOGY: ONGOLE

(AUTONOMOUS)
III B. Tech., I Semester I Mid Examinations, August - 2019
THEORY OF COMPUTATION (A0517)
(Mechanical Engineering)
Date: 05/08/2019 Time: 90 Min. Max. Marks: 20
All Questions Carry Equal Marks

1 a What is Finite State Machine and give the mathematical representation. 2 M CO1 BTL1
b Give DFA which accepts only the string ‘abab’ over the ∑={a,b}. 2 M CO3 BTL2
c Define Context Free Grammar 1 M CO4 BLT1
2 Explain about Finite State Automata Model and explain its elements. 5 M CO2 BTL2
3 Convert the following NFA with to DFA 5 M CO3 BTL5

## 4 A grammar G which is context-free has the productions 5 M CO4 BTL2

S → aAB (Rule: 1)
A → Bba (Rule: 2)
B → bB (Rule: 3)
B→c (Rule: 4)
Compute the string w = ‘acbabc’ with left most derivation and draw the
Derivation Tree