Scribd
Upload
211 views2 pages

TKR College of Engineering and Technology: (Autonomous & Accredited With 'A' Grade by NAAC)

This document contains the details of a mid-term exam for the subject "Formal Languages and Automata Theory" taken by students of the IT branch at TKR College of Engineering and Technology. The exam contains two parts - a multiple choice/fill in the blank objective paper worth 5 marks and a descriptive paper worth 15 marks. The descriptive paper contains 3 questions assessing different cognitive levels based on the subject's learning outcomes. Guidelines are provided on setting the question paper and marking scheme.

Uploaded by

Vaishnavi Vaishu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
211 views2 pages

TKR College of Engineering and Technology: (Autonomous & Accredited With 'A' Grade by NAAC)

This document contains the details of a mid-term exam for the subject "Formal Languages and Automata Theory" taken by students of the IT branch at TKR College of Engineering and Technology. The exam contains two parts - a multiple choice/fill in the blank objective paper worth 5 marks and a descriptive paper worth 15 marks. The descriptive paper contains 3 questions assessing different cognitive levels based on the subject's learning outcomes. Guidelines are provided on setting the question paper and marking scheme.

Uploaded by

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

TKR COLLEGE OF ENGINEERING AND TECHNOLOGY

(Autonomous & Accredited with 'A' Grade by NAAC)

B.Tech IIYR II Semester Second Mid-Term Examinations May- 2019


Branch Name: IT
Subject Name: Formal Languages and Automata Theory
Maximum Marks: 20 Duration: 1Hour 20 Minutes

Part-A (Objective Paper)


Answer All the following questions. (5 Multiple choice & 5 Fill in the Blooms Attainment
blanks) Taxonomy of Course
Marks: 10x1/2M = 5M Level Outcomes
1 __________is the stack alphabet in PDA [ ] L2 CO2
A)F B)𝜖 C)𝜏 D)Z0

2 How many tuples are required to define a Turing machine L2 CO3


[ ]
A)4 B)5 C)6 D)7

3 By using ____________machine we can accept regular L2 CO2


language [ ]
A)Finite Automata
B)Pushdown Automata
C)Linear Bounded Automata
D)None of the above
4 The productions of a right linear grammar is____________ L2 CO2
[ ]
A)SAd|b B)S dA|b
C) SAdB|b D)None of the above

5 Context Sensitive Grammar is_______________________ L2 CO2


[ ]
A)Type 0 B) Type 1
C) Type 2 D) Type 3

6 Construct a CFG for set of all strings starts and ends with L6 CO2
different symbols__________________.
7 In Turing machine,_______________ symbol is the bottom of L2 CO3
the stack.
8 DPDA is______________powerful then NDPDA. L2 CO2
9 In PDA,acceptance of a string is done L2 CO2
by________________and __________________

10 PCP stands for__________________ L2 CO4


TKR COLLEGE OF ENGINEERING AND TECHNOLOGY
(Autonomous & Accredited with 'A' Grade by NAAC)

Part-B (Descriptive Paper)


Answer All the following questions. Marks: 5Mx3= 15M Blooms Attainment
Taxonomy of Course
Level Outcomes
1 a)Find CFG with no useless symbols equivalent to L1 CO2
S →AB | CA
A →a
B → BC| AB
C →aB| b
&
Eliminate the ∈ production from the CFG given below
A → OB|1B|l ∈
B → OB|1B| ∈

OR
b) Design a PDA for 𝐿 = {w wR| w∈ {a,b}*} L6 CO2

2 a)Explain pumping lemma for Context free language with an suitable L5 CO2
example.

OR
b)Design a Turing machine for unary multiplication. L6 CO3
3 a)Define undecidability with an example.

OR
b)Explain PCP problem? L5 CO4

Note: 1. Set the question paper as per Syllabus mentioned

2. Descriptive each question carries 5 marks and may have a,b,c,d or i,ii,iii,iv as sub
questions.
3. Indicate blooms taxonomy level as applicable. Example: Remembering as L1

You might also like