0% found this document useful (0 votes)
36 views2 pages

II-II CSE ACD MID-2 Descriptive QP Set 1&2 July 2024

Jntu

Uploaded by

medaramrakesh286
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
36 views2 pages

II-II CSE ACD MID-2 Descriptive QP Set 1&2 July 2024

Jntu

Uploaded by

medaramrakesh286
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

BHARAT INSTITUTE OF ENGINEERING AND TECHNOLOGY

Ibrahimpatnam - 501 510, Hyderabad.


DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Class: II Year II Semester (CSM ) Marks: 10
Subject Automata Theory and Compiler Design Units Covered: 2.5 to 5
Faculty: Dr. K. Thirupal Reddy Set: 1
Mid Term #2 Examination: July 2024
Answer Any Four Questions
Blooms Taxonomy
Q. No. Questions Course Outcomes
Level
R *
1 Design a PDA to accept the palindrome strings L = {WCW | Wϵ(0+1) } L6: CREATE CO3
Construct a PDA equivalent to the following CFG. L6: CREATE CO3
2 S → aAA
A → aS | bS | a
Design a TM to accept the language L = {anbncn| n≥1} L6: CREATE CO3

Discuss about various types Turing Machines (TM’s) with neat block L2: UNDERSTAND CO4
diagrams.

Write short notes on role of lexical analyzer and Input Buffering L6: CREATE CO4
5

Write short notes on Syntax Directed Definition And Evaluation order L6: CREATE CO5
6 of SDD’s
BHARAT INSTITUTE OF ENGINEERING AND TECHNOLOGY
Ibrahimpatnam - 501 510, Hyderabad.
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Class: II Year II Semester (CSM) Marks: 10


Subject: Automata Theory and Compiler Design Units Covered: 2.5 to 5
Faculty: Dr. K. Thirupal Reddy Set: 2
Mid Term #2 Examination: July 2024
Answer Any Four Questions
Q. Blooms Taxonomy Course
Questions
No. Level Outcomes
1 Design a PDA for the language L = {anbn | n≥1} L6: CREATE CO3, CO3
Reduce the following grammar to Chomsky Normal Form (CNF) L4: ANALYZE CO3,

2 S → ABA | AB | BA | AA | B A → aA | a
S → bB | b
Design a TM to accept the language L = {anbn | n≥1} L6: CREATE CO3,

Discuss about Post Correspondence Problem (PCP). Does PC with two lists have a L2: CO4
3 UNDERSTAND
4 solution? List A = {b, bab , ba}
List B = { b3, ba, a}
Explain about Three-address code L6: CREATE CO5
5.

Write short notes on Heap Management and Stack allocation of space L6: CREATE CO5
6.

You might also like