SANTHIRAM ENGINEERING COLLEGE: NANDYAL

Program & Branch: B. Tech & CSE Year & Sem: III-I Regulations: R19 Mid: II
Course Name & Code: Formal Language and Finite Month & Year: Jan-2021
Automata & 19A05505 Time: 20 MINS
HALL TICKET NUMBER: MARKS AWAREDED:
Signature of the Invigilator: Signature of Examiner:

Q.NO QUESTION CO ANS

All the context free grammars are in the form of _____________
1 CO3
a) β  α b) α  α c) α β d) None
Which of these does not belong to CFG?
2 CO3
a) Terminal b) Non Terminal c) Start Symbol d) End Symbol
____ is a method, in which input strings are derived from left to right.
3 CO3
(a) RMD b) Parse Tree c) LMD d) All
Which of the following statement is false?
4 CO3
a) CFG to CNF b) CFG to GNF c) CFG to PDA d) None
Grammar that produce more than one Parse tree for same sentence is ___________
5 CO3
a) Concatenation b) Intersection c) Ambiguous d) Unambiguous
Which of the technique can be used to prove that a language is non regular?
6 CO3
a) Ardens theorem b) Ogdens Lemma c) CSL d) Pumping Lemma
Graphical Representation of Context free grammar is called _________
7 CO3
a) Grammar b) RMD c) Parse Tree d) LMD
Which of the following language accepted by a Push down Automata?
8 CO4
a) Type-0 b) Type-1 c)Type-3 d)Type-2
Initially the stack contains ________ symbol.
9 CO4
a) S b) B c) Zo d) None
M={Q, ∑, δ , Γ, qo , Zo, F} is a _______
10 CO4
a) Finite automata b) Turing Machine c) LBA d) PDA
The transition a push down automation makes is additionally dependent upon the ______
11 CO4
a)Input Tape b) Terminals c) Stack d) None
If PDA does not stop on an accepting state and the stack is not empty , then the string is__
12 CO4
a) Accepting b) goes into loop forever c) can’t say d) Rejected
A Language is accepted by a push down automata if it is _______
13 CO4
a)Regular b) Context Free c) Both Regular & Context free d) None
While converting from CFG to PDA the Symbol ‘ Γ ‘ has replaced with_____
14 CO4
a) Variable (V) b) Terminal (T) c) Both V &T d) None
_____ is not suitable for Turing machine.
15 CO5
a) Q b) ∑ c) Zo d) B
Turing machine accepted by _______ Language.
16 CO5
a) Regular b) CFG c) CSL d) All
δ (q , x)= (q, Y , D) where D cannot be a ______
17 CO5
a) L b) R c) S d)None
Which of the following does not having the Turing machine is ______
18 CO5
a)Input Tape b) Head c) State Register d) None
If d is not defined on the current state and the current tape symbol, then the machine is ____
19 CO5
a)Accept b) does not halt c) halt d) goes into loop forever
A Turing machine can be represented by using the following tools __________
20 CO5
a)Transition Graph b) Transition Table c)Input tape d) all

Mr.P.Bhaskar
Date: Name of the paper setter Signature of the paper setter