Scribd
Upload
85 views2 pages

BCS503

Uploaded by

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

BCS503

Uploaded by

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

Max Time Allowed: 3.00 Hrs. / 180 minutes.

Name ____________________
Max Marks: 60 Regd. No _________________

B. Tech CSE/CC/IOT -5th Semester


END SEMESTER EXAMINATION-DECEMBER-2022(ODD SEMESTER)
FORMAL LANGUAGE AND AUTOMATA THEORY, BCS503

This question paper is based on Outcome Based Education pattern, contains five sections and distribution
of marks is mentioned in the brackets.
Q.NO. QUESTIONS COURSE MARKS BLOOM
OUTCOME LEVEL
Section A (All questions are compulsory)
1. a) Define Alphabet. CO1 2 L1
b) Discuss any Finite Automata with output. CO2 2 L2
c) Identify English Language of the description: b(a*b) *a*. CO1 2 L2
d) Explain Turing Machine. How a TM accepts a language? CO2 2 L2
e) Explain Context Sensitive Languages? CO2 2 L2
f) Write an example of an undecidable problem. CO5 2 L3
+ *
g) Differentiate L and L . CO5 2 L2
h) Examine the concept of Computability. CO5 2 L3
i) Examine Arden’s Theorem. CO3 2 L2
j) Analyze the concept of Chomsky Normal Form (CNF). CO2 2 L3
Section B (Attempt any one question)
2 Examine left & right derivations and left & right derivation trees with 10 L2
examples CO2

3 10 L3

Convert above automation to DFA


Section C (Attempt any one question)
4 Differentiate between PDA and NPDA with the help of example. 10 L2
CO3
5 Construct CFG, G=({S,A,B}, {a,b},P,S) with production set P as 10 L3
S-> aAbB; A->Ab/b ; B-> Ba/a to CNF

Section D (Attempt any one question)


6 Design a DFA which accepts even number of a’s over the alphabet 10 L2
{a,b}. CO5
7 Design a Turing Machine that recognizes any palindrome of digits {0, 10 L3
1}. Give its state transition diagram and table.
Section E (Attempt any one question)
8 Write brief about the following 10 L2
a) Decidability of problems CO6
b) RICE Theorem
c) Undecidability of post correspondence problem.
Page 1 of 2| EO-221219
9 Simplify the following CFG and convert into CNF: 10 L3

*********GNA UNIVERSITY**********

Page 2 of 2| EO-221219

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy