Code : 20A05503 SET: 1 R20 Roll No:

RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL

Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 20 minutes Max. Marks: 10M
Choose the Correct Answers:
1. The entity which generate Language is termed as: [ ]
a) Automata b) Tokens c) Grammar d) Data
2. The Grammar can be defined as: G=(V, ∑, p, S). In the given definition, what does S represents? [ ]
a) Accepting State b) Starting Variable c) Sensitive Grammar d) None of the above
3. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w
could be: [ ]
a) program b) SQL-query c) XML document d) All of the above
4. A->aA | a| b . The number of steps to form aab: [ ]
a) 2 b) 3 c) 4 d) 5
5. The language accepted by Push down Automaton: [ ]
a) Recursive Language b) Context free language c) Linearly Bounded language d) All of the above
6. Which of the following the given language belongs to? L={ambmcm| m>=1} [ ]
a) Context free language b) Regular language
c) Context free language & Regular language d) None of the above
7. Which of the following is true for a grammar G in Chomsky Normal Form: [ ]
a) G has useless symbols b) G has unit productions
c) G has epsilon productions d) All of the above
8. A push down automaton employs ________ data structure. [ ]
a) Stack b) Linked List c) Hash Table d) Queue
9. Push down automata accepts _________ languages. [ ]
a) Type 3 b) Type 2 c) Type 1 d) Type 0
10. Which of the operations are eligible in PDA? [ ]
a) Push b) Delete c) Insert d) Add
11. A string is accepted by a PDA when [ ]
a) Stack is not empty b) Acceptance state c) Both a & b d) None of the above
12. The production of the form A->B , where A and B are non terminals is called [ ]
a) Null production b) Greibach Normal Form c) Unit production d) Chomsky Normal Form
13. Halting states are of two types. They are: [ ]
a) Accept and Reject b) Reject and Allow c) Start and Reject d) None of the above
14. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d). What does the symbol z0 represents?
a) an element of G b) initial stack symbol c) top stack alphabet d) All of the above [ ]
15. A language is accepted by a push down automata if it is: [ ]
a) regular b) context free c) regular and context free d) None of the above
16. Which of the following strings is not generated by the given grammar: S->SaSbS | € [ ]
a) aabb b) abab c) abaabb d) None of the above
17. The following denotion belongs to which type of language: G=(V, T, P, S) [ ]
a) Regular grammar b) Context free grammar c) Context Sensitive grammar d) All of the above
18. A turing machine operates over: [ ]
a) infinite memory tape b) finite memory tape c) depends on the algorithm d) None of the above
19. Which of the following a turing machine does not consist of? [ ]
a) input tape b) head c) state register d) None of the above
20. The moves in the PDA is technically termed as: [ ]
a) Turnstile b) Shifter c) Router d) None of the above
Code : 20A05503 SET: 2 R20 Roll No:
RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 20 minutes Max. Marks: 10M
Choose the Correct Answers:
1. Which of the operations are eligible in PDA? [ ]
a) Push b) Delete c) Insert d) Add
2. A string is accepted by a PDA when [ ]
a) Stack is not empty b) Acceptance state c) Both a & b d) None of the above
3. The production of the form A->B , where A and B are non terminals is called [ ]
a) Null production b) Greibach Normal Form c) Unit production d) Chomsky Normal Form
4. Halting states are of two types. They are: [ ]
a) Accept and Reject b) Reject and Allow c) Start and Reject d) None of the above
5. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d). What does the symbol z0 represents?
a) an element of G b) initial stack symbol c) top stack alphabet d) All of the above [ ]
6. A language is accepted by a push down automata if it is: [ ]
a) regular b) context free c) regular and context free d) None of the above
7. Which of the following strings is not generated by the given grammar: S->SaSbS | € [ ]
a) aabb b) abab c) abaabb d) None of the above
8. The following denotion belongs to which type of language: G=(V, T, P, S) [ ]
a) Regular grammar b) Context free grammar c) Context Sensitive grammar d) All of the above
9. A turing machine operates over: [ ]
a) infinite memory tape b) finite memory tape c) depends on the algorithm d) None of the above
10. Which of the following a turing machine does not consist of? [ ]
a) input tape b) head c) state register d) None of the above
11. The moves in the PDA is technically termed as: [ ]
a) Turnstile b) Shifter c) Router d) None of the above
12. The entity which generate Language is termed as: [ ]
a) Automata b) Tokens c) Grammar d) Data
13. The Grammar can be defined as: G=(V, ∑, p, S). In the given definition, what does S represents? [ ]
a) Accepting State b) Starting Variable c) Sensitive Grammar d) None of the above
14. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w
could be: [ ]
a) program b) SQL-query c) XML document d) All of the above
15. A->aA | a| b . The number of steps to form aab: [ ]
a) 2 b) 3 c) 4 d) 5
16. The language accepted by Push down Automaton: [ ]
a) Recursive Language b) Context free language c) Linearly Bounded language d) All of the above
17. Which of the following the given language belongs to? L={ambmcm| m>=1} [ ]
a) Context free language b) Regular language
c) Context free language & Regular language d) None of the above
18. Which of the following is true for a grammar G in Chomsky Normal Form: [ ]
a) G has useless symbols b) G has unit productions
c) G has epsilon productions d) All of the above
19. A push down automaton employs ________ data structure. [ ]
a) Stack b) Linked List c) Hash Table d) Queue
20. Push down automata accepts _________ languages. [ ]
a) Type 3 b) Type 2 c) Type 1 d) Type 0
Code : 20A05503 SET: 3 R20 Roll No:
RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 20 minutes Max. Marks: 10M
Choose the Correct Answers:
1. Which of the following the given language belongs to? L={ambmcm| m>=1} [ ]
a) Context free language b) Regular language
c) Context free language & Regular language d) None of the above
2. Which of the following is true for a grammar G in Chomsky Normal Form: [ ]
a) G has useless symbols b) G has unit productions
c) G has epsilon productions d) All of the above
3. A push down automaton employs ________ data structure. [ ]
a) Stack b) Linked List c) Hash Table d) Queue
4. Push down automata accepts _________ languages. [ ]
a) Type 3 b) Type 2 c) Type 1 d) Type 0
5. Which of the operations are eligible in PDA? [ ]
a) Push b) Delete c) Insert d) Add
6. A string is accepted by a PDA when [ ]
a) Stack is not empty b) Acceptance state c) Both a & b d) None of the above
7. The production of the form A->B , where A and B are non terminals is called [ ]
a) Null production b) Greibach Normal Form c) Unit production d) Chomsky Normal Form
8. Halting states are of two types. They are: [ ]
a) Accept and Reject b) Reject and Allow c) Start and Reject d) None of the above
9. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d). What does the symbol z0 represents?
a) an element of G b) initial stack symbol c) top stack alphabet d) All of the above [ ]
10. A language is accepted by a push down automata if it is: [ ]
a) regular b) context free c) regular and context free d) None of the above
11. Which of the following strings is not generated by the given grammar: S->SaSbS | € [ ]
a) aabb b) abab c) abaabb d) None of the above
12. The following denotion belongs to which type of language: G=(V, T, P, S) [ ]
a) Regular grammar b) Context free grammar c) Context Sensitive grammar d) All of the above
13. A turing machine operates over: [ ]
a) infinite memory tape b) finite memory tape c) depends on the algorithm d) None of the above
14. Which of the following a turing machine does not consist of? [ ]
a) input tape b) head c) state register d) None of the above
15. The moves in the PDA is technically termed as: [ ]
a) Turnstile b) Shifter c) Router d) None of the above
16. The entity which generate Language is termed as: [ ]
a) Automata b) Tokens c) Grammar d) Data
17. The Grammar can be defined as: G=(V, ∑, p, S). In the given definition, what does S represents? [ ]
a) Accepting State b) Starting Variable c) Sensitive Grammar d) None of the above
18. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w
could be: [ ]
a) program b) SQL-query c) XML document d) All of the above
19. A->aA | a| b . The number of steps to form aab: [ ]
a) 2 b) 3 c) 4 d) 5
20. The language accepted by Push down Automaton: [ ]
a) Recursive Language b) Context free language c) Linearly Bounded language d) All of the above
Code : 20A05503 SET: 4 R20 Roll No:
RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY
Time: 20 minutes Max. Marks: 10M
Choose the Correct Answers:
1. Which of the following strings is not generated by the given grammar: S->SaSbS | € [ ]
a) aabb b) abab c) abaabb d) None of the above
2. The following denotion belongs to which type of language: G=(V, T, P, S) [ ]
a) Regular grammar b) Context free grammar c) Context Sensitive grammar d) All of the above
3. A turing machine operates over: [ ]
a) infinite memory tape b) finite memory tape c) depends on the algorithm d) None of the above
4. Which of the following a turing machine does not consist of? [ ]
a) input tape b) head c) state register d) None of the above
5. The moves in the PDA is technically termed as: [ ]
a) Turnstile b) Shifter c) Router d) None of the above
6. The entity which generate Language is termed as: [ ]
a) Automata b) Tokens c) Grammar d) Data
7. The Grammar can be defined as: G=(V, ∑, p, S). In the given definition, what does S represents? [ ]
a) Accepting State b) Starting Variable c) Sensitive Grammar d) None of the above
8. If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w
could be: [ ]
a) program b) SQL-query c) XML document d) All of the above
9. A->aA | a| b . The number of steps to form aab: [ ]
a) 2 b) 3 c) 4 d) 5
10. The language accepted by Push down Automaton: [ ]
a) Recursive Language b) Context free language c) Linearly Bounded language d) All of the above
11. Which of the following the given language belongs to? L={ambmcm| m>=1} [ ]
a) Context free language b) Regular language
c) Context free language & Regular language d) None of the above
12. Which of the following is true for a grammar G in Chomsky Normal Form: [ ]
a) G has useless symbols b) G has unit productions
c) G has epsilon productions d) All of the above
13. A push down automaton employs ________ data structure. [ ]
a) Stack b) Linked List c) Hash Table d) Queue
14. Push down automata accepts _________ languages. [ ]
a) Type 3 b) Type 2 c) Type 1 d) Type 0
15. Which of the operations are eligible in PDA? [ ]
a) Push b) Delete c) Insert d) Add
16. A string is accepted by a PDA when [ ]
a) Stack is not empty b) Acceptance state c) Both a & b d) None of the above
17. The production of the form A->B , where A and B are non terminals is called [ ]
a) Null production b) Greibach Normal Form c) Unit production d) Chomsky Normal Form
18. Halting states are of two types. They are: [ ]
a) Accept and Reject b) Reject and Allow c) Start and Reject d) None of the above
19. A pushdown automata can be defined as: (Q, ∑, G, q0, z0, A, d). What does the symbol z0 represents?
a) an element of G b) initial stack symbol c) top stack alphabet d) All of the above [ ]
20. A language is accepted by a push down automata if it is: [ ]
a) regular b) context free c) regular and context free d) None of the above
Code : 20A05503 SET: 1 R20
RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY

Time: 90 minutes Max. Marks: 30

Note: Answer ALL Questions.

Mark Cognitive
Answer the following Unit CO
s Level
1. a) Explain the closure properties of context free 5M
languages. C303.
5M 3 Understand
b) Discuss Chomsky’s Hierarchy of formal 3
languages.
OR
2. a) Write the procedure for conversion of CNF to
GNF with example
b) Define CNF and convert the following Grammar 5M
C303.
into CNF 5M 3 Remember
3
S -> aAB / Aba
A -> aA / a / Ba
B->ab / bc

Mar Cognitive
Answer the following Unit CO
ks Level
3. a) Explain procedure for conversion of grammar to
PDA.
b) Construct PDA from the following Grammar. 5M C303.
4 Understand
S -> aB 5M 4
B -> bA / b
A -> ba
OR
4. Explain Deterministic Push down Automata with 10M C303.
example. 4 Understand
4

Cognitive
Answer the following Marks Unit CO
Level
5. a) Design a Turing Machine for 0 n 1n where n>=1. 5M
b) Explain various types of Turing Machine with 5M 5 C303.5 Understand
examples.
OR
6. a) Explain about Halting Problem. 5M
b) Explain what undecidable problem is and post 5M 5 C303.6 Understand
correspondence problem.
Code : 20A05503 SET: 2 R20
RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY

Time: 90 minutes Max. Marks: 30

Note: Answer ALL Questions.

Cognitive
Answer the following Marks Unit CO
Level
1. a) Write the procedure for conversion of CNF to
GNF with example.
b) Define CNF and convert the following 5M
Grammar into CNF 5M 3 C303.3 Remember
S -> aAB / Aba
A -> aA / a / Ba
B->ab / bc
OR
2. a) Explain the closure properties of context free 5M
languages. 5M 3 C303.3 Understand
b) Discuss Chomsky’s Hierarchy of formal
languages.

Cognitive
Answer the following Marks Unit CO
Level
3. Explain Deterministic Push down Automata with 10M C303.
example. 4 Understand
4
OR
4. a) Explain procedure for conversion of grammar
to PDA.
b) Construct PDA from the following Grammar. 5M C303.
4 Understand
S -> aB 5M 4
B -> bA / b
A -> ba

Cognitive
Answer the following Marks Unit CO
Level
5. a) Explain about Halting Problem. 5M
b) Explain what undecidable problem is and post 5M 5 C303.6 Understand
correspondence problem.
OR
6. a) Design a Turing Machine for 0 n 1n where n>=1. 5M
b) Explain various types of Turing Machine with 5M 5 C303.5 Understand
examples.

Code : 20A05503 SET: 3 R20

 RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY

Time: 90 minutes Max. Marks: 30

Note: Answer ALL Questions.

Mark Cognitive
Answer the following Unit CO
s Level
1. a) Explain the closure properties of context free 5M
languages. C303.
5M 3 Understand
b) Discuss Chomsky’s Hierarchy of formal 3
languages.
OR
2. a) Write the procedure for conversion of CNF to
GNF with example
b) Define CNF and convert the following Grammar 5M
C303.
into CNF 5M 3 Remember
3
S -> aAB / Aba
A -> aA / a / Ba
B->ab / bc

Mar Cognitive
Answer the following Unit CO
ks Level
3. a) Explain procedure for conversion of grammar to
PDA.
b) Construct PDA from the following Grammar. 5M C303.
4 Understand
S -> aB 5M 4
B -> bA / b
A -> ba
OR
4. Explain Deterministic Push down Automata with 10M C303.
example. 4 Understand
4

Cognitive
Answer the following Marks Unit CO
Level
5. a) Design a Turing Machine for 0 n 1n where n>=1. 5M
b) Explain various types of Turing Machine with 5M 5 C303.5 Understand
examples.
OR
6. a) Explain about Halting Problem. 5M
b) Explain what undecidable problem is and post 5M 5 C303.6 Understand
correspondence problem.

Code : 20A05503 SET: 4 R20

 RAVINDRA COLLEGE OF ENGINEERING FOR WOMEN: KURNOOL
Department of Computer Science & Engineering
B. Tech III Year-I SEMESTER (R20) Second Mid – Term Examinations, December, 2023
FORMAL LANGUAGES AND AUTOMATA THEORY

Time: 90 minutes

Cognitive
Answer the following Marks Unit CO
Level
1. a) Write the procedure for conversion of CNF to
GNF with example.
b) Define CNF and convert the following 5M
Grammar into CNF 5M 3 C303.3 Remember
S -> aAB / Aba
A -> aA / a / Ba
B->ab / bc
OR
2. a) Explain the closure properties of context free 5M
languages. 5M 3 C303.3 Understand
b) Discuss Chomsky’s Hierarchy of formal
languages.

Cognitive
Answer the following Marks Unit CO
Level
3. Explain Deterministic Push down Automata with 10M C303.
example. 4 Understand
4
OR
4. a) Explain procedure for conversion of grammar
to PDA.
b) Construct PDA from the following Grammar. 5M C303.
4 Understand
S -> aB 5M 4
B -> bA / b
A -> ba

Cognitive
Answer the following Marks Unit CO
Level
5. a) Explain about Halting Problem. 5M
b) Explain what undecidable problem is and post 5M 5 C303.6 Understand
correspondence problem.
OR
6. a) Design a Turing Machine for 0 n 1n where n>=1. 5M
b) Explain various types of Turing Machine with 5M 5 C303.5 Understand
examples.