Toc MCQ
Toc MCQ
1.Number of states of FSM required to simulate behaviour of a computer with a memory capable of
storing “m” words, each of length ‘n’
a.m x 2^n
b.2^mn
c.2^(m+n)
d.All of the mentioned
Answer: (b). 2^mn
Answer: (c).=
19.The lexical analysis for a modern language such as Java needs the power of which one of the
following machine models in a necessary and sufficient sense?
a.Finite state automata
b.Deterministic pushdown automata
c.Non-deterministic pushdown automata
d.Turing machine
Answer: (a).Finite state automata
20.The classes of languages P and NP are closed under certain operations, and not closed under
others. Decide whether P and NP are closed under each of the following operations.
1. Union
2. Intersection
3. Intersection with a regular language
4. Kleene closure (star)
5. Homomorphism
6. Inverse homomorphism
a.P is not closed under union
b.NP is not closed under intersection
c.None of the mentioned
d.Both of the mentioned
Answer: (d).Both of the mentioned
Answer: (b).(x+y)*
6.The regular expression denote a language comprising all possible strings of even length over the
alphabet (0, 1)
a.1 + 0(1+0)*
b.(0+1) (1+0)*
c.(1+0)
d.(00+0111+10)*
Answer: (d).(00+0111+10)*
8.The RE in which any number of 0′s is followed by any number of 1′s followed by any number of 2′s is
a.(0+1+2)*
b.0*1*2*
c.0* + 1 + 2
d.(0+1)*2*
Answer: (b). 0*1*2*
11.The set of all strings over ∑ ={a,b} in which a single a is followed by any number of b’s a single b
followed by any number of a’s is
a.ab* + ba*
b.ab*ba*
c.a*b + b*a
d.None of the mentioned
Answer: (a). ab* + ba*
12.The set of all strings over ∑ = {a,b} in which strings consisting a’s and b’s and ending with in bb is
a.ab
b.a*bbb
c.(a+b)* bb
d.All of the mentioned
Answer: (c). (a+b)* bb
13. If P, Q, R are three regular expressions and if P does not contain a then the equation R = R + RP has
a unique solution given by
a.R = QP*
b.R = P*Q
c.R = RP
d.None of the mentioned
Answer: (a).R = QP*
15.Let the class of language accepted by finite state machine be L1 and the class of languages
represented by regular expressions be L2 then
a.L1=L2
b.L1 U L2 = .*
c.L1=L2
d.None of the above
Answer: (c). L1=L2
S→A∣B
A→a∣c
B→b∣c
where {S, A, B} is the set of non-terminals, {a, b, c,} is the set of terminals.
a.Only S1
b.Only S2
c.Both S1 and S2
d.Neither S1 nor S2
Answer: (d). Neither S1 nor S2
10. The grammar S → (S) ∣ SS ∣ ϵ is not suitable for predictive parsing because the grammar is
a.Right recursive
b.Left recursive
c.Ambiguous
d.An operator grammar
Answer: (c). Ambiguous
11. To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of
productions to be used is:
a.2n−1
b.2n
c.n+1
d.n^2
Answer: (a).2n−1
G1 : S → SbS | a
G2 : S → aB | ab, A→GAB | a, B→ABb | b
13.The set A={ 0^n 1^n 2^n | n=1, 2, 3, ......... } is an example of a grammar that is:
a.Context sensitive
b.Context free
c.Regular
d.None of the above
Answer: (a). Context sensitive
S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same
language.
S2 : The problem of determining whether a Turing machine halts on any input is undecidable.
17. Pumping lemma for regular language is generally used for proving:
a.whether two given regular expressions are equivalent
b.a given grammar is ambiguous
c.a given grammar is regular
d.a given grammar is not regular
Answer: (a). whether two given regular expressions are equivalent
18.Which of the following problems is undecidable?
a.To determine if two finite automata are equivalent
b.Membership problem for context free grammar
c.Finiteness problem for finite automata
d.Ambiguity problem for context free grammar
Answer: (d). Ambiguity problem for context free grammar
L1 = {a^m b^n | m ≠ n}
L2 = {a^m b^n | m = 2n+1}
L3 = {a^m b^n | m ≠ 2n}
Correct hierarchical relationship among context- free, right-linear, and context-sensitive language
is
Option: D
Explanation :
2:
x::=x ⊕y| 4
y::=z*yI2
z : : = id
D.None of these
Option: A
Explanation :
3:
A.S --> Sa | b
B. S --> aSb | ab
Option: B
Explanation :
Option (b) generates the set {an bn ,n=1,2,3 ....}which is not regular ,Option (a) is left linear
where as option (C) is right linear .
4:
ADG is said to be in Chomsky Form (CNF), if all the productions are of the form A --> BC or
A --> a. Let G be a CFG in CNF. To derive a string of terminals of length x , the number of
productions to be used is
A.2x - 1
B. 2x
C. 2x + I
D.None of these
Option: A
Explanation :
5:
B. Set B of all strings of equal number of a's and b's deines a regular language
D.None of these
Option: C
Explanation :
If we include A and B in a set and if we write A* it means except then A i.e. B same
as B* means except then B i.e.A so if we intersect (A*B*) and B then get A because in any
regular language
if we write A-B then A-B=A intersection B' so if we intersect A and B means A-B So
intersection of (A*B*) and B = (BA) intersection B means (BA)-B' and B'=A so (BA)
intersection(A)=A
So ans is (C)
6:
B. Q cannot be regular
Option: C
Explanation :
7:
Option: D
Explanation :
8:
The productions
E—>E+E
E—>E—E
E-->E*E
E —> E / E
E —> id
D.can generate all possible fixed length valid computation for carrying out addition, subtraction,
multipication and division, which can be expressed in one expression
Option: B
Explanation :
9:
Which of the folowing definitions below generates the same language as L, where
L = {xn yn such that n > = 1} ?
I. E —> xEy | xy
III .x+y+
A.I only
B. I and II
C. II and III
D.II only
Option: A
Explanation :
II generates strings like xxyyy, which are not supposed to be.
III generates strings like xyy, which are not supposed to be.
I can be verified to generate all the strings in L and only those.
10:
Option: A
Explanation :
S �> aB �> aaBB-->aabB �> aabb
So (b) is wrong. We have
S --> a B �> a b So (c) is wrong.
A careful observation of the productions will
reveal a similarity. Change A to B, B to A, a to b
and b to a. The new set of productions will be
the same as the original set. So (d) is false and
(a) is the correct answer.
11:
If L { w | w is nonempty and has an equal number of 0's and 1's}, then init (L) is set of all binary
strings
D.None of these
Option: B
Explanation :
12:
A.s ---> sa | a
C. s ---> a sb | ab
D.none of these
Option: C
Explanation :
13:
D.None of these
Option: A
Explanation :
14:
D.None of these
Option: C
Explanation :
15:
B. S �>aaSbb + abS
C. S�> ab | aSb | E
D.S �>aaSbb | ab | aabb
Option: D
Explanation :
Option (b) is wrong because it can't generate aabb
(in fact any even power).
Option (c) is wrong since it generates E also.
Both options (a) and (d) are correct.
The CFG
s---> as | bs | a | b
A.(a + b)
B. (a + b) (a + b)*
C. (a + b) (a + b)
D.None of these
Option: B
Explanation :
17:
A.abc
B. aab
C. abcc
D.abbb
Option: A
Explanation :
18:
D.None of these
Option: B
Explanation :
19:
The language of all words with at least 2 a's can be described by the regular expression
C. b* ab* a (a + b)*
D.all of these
Option: D
Explanation :
20:
Explanation :
A.context free
Option: D
Explanation :
22:
A.Regular, Regular
D.None of these
Option: B
Explanation :
23:
A.any grammar
B. only CG
Option: D
Explanation :
24:
A.union
B. complementation
C. intersection
D.All of these
Option: D
Explanation :
25:
Option: D
Explanation :
CFG is a higher than regular language. So we can draw a regular equivalent to CFG. And some
non regular like context sensitive can't be generated by cfg. So, option 3 and 2 are correct. So
answer is 'D'.
26:
Given A = (0,1) and L = A*. If R = (0n 1n, n > 0) , then language L ∪ R and R are respectively
A.regular, regular
Option: D
Explanation :
27:
Let L {w/w is noempty and has an equal number of 0’s and 1’s)
A.set of all binary strings with unequal number of 0’s and 1’s
C. set of all binary strings with exactly one more 0’s than the number of 1’s or 1 more than the
number of 0’s
D.none of these
Option: B
Explanation :
28:
If L1 and L2 are context free language and R a regular set, then which one of the languages below
is not necessarily a context free language?
A.L1 L2
B. L1 ∩ L2
C. L1 ∩ R
D.L1 ∪ L2
Option: B
Explanation :
Click on Discuss to view users comments.
29:
A.Context free
B. regular
C. context sensitive
D.LR ( k )
Option: C
Explanation :
30:
What can be said about a regular language L over {a} whose minimal finite state automation has
two states?
B. L must be { an | n is even}
Option: B
Explanation :
31:
In a context-sensitive grammar, number of grammar symbols on the left hand side of a production
can't be greater than the number of
A.grammar symbols on the right hand side
D. all of these
Option: C
Explanation :
32:
In a context-free grammar
B. terminal symbols can't be present in the left hand side of any production
C. number of grammar symbols in the left hand side is not greater than the number of grammar
symbols in the right hand side
D.all of these
Option: D
Explanation :
33:
A.push-down automata
D.none of these
Option: C
Explanation :
34:
A.I and II
B. I, III and IV
C. I, II and III
D.I, II and IV
Option: B
Explanation :
35:
A.two or more productions have the same non-terminal on the left hand side
Option: C
Explanation :
A.regular language
B. context-free language
C. context-sensitive language
Option: A
Explanation :
37:
The grammars G = ( { s }, { 0, 1 }, p , s)
where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a
B. regular language
C. context-sensitive language
D.context-free language
Option: B
Explanation :
38:
A.pigeon-hole principle
B. divide-and-conquer technique
C. recursion
D.iteration
Option: A
Explanation :
The pigeon hole principle is nothing more than the obvious remark: if you have fewer pigeon
holes than pigeons and you put every pigeon in a pigeon hole, then there must result at least
one pigeon hole with more than one pigeon. It is surprising how useful this can be as a proof
strategy.
39:
The intersection of CFL and regular language
Option: B
Explanation :
40:
L1 = (a + b)* a and L2 = b (a + b ) *
,
the intersection of L1 and L2 is given by
A.(a + b ) * ab
B. ab (a + b ) *
C. a ( a + b ) * b
D.b (a + b ) * a
Option: D
Explanation :
A.product
B. union
C. complementation
D.kleen star
Option: C
Explanation :
A.regular language
B. context-free language
C. context-sensitive language
Option: A
Explanation :
43:
For which of the following application, regular expressions can not be used ?
A.Designing computers
B. Designing compilers
D.Developing computers
Option: C
Explanation :
44:
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?
A.xw * y + xw * yx + ywx
B. xwy + xw * xy + ywx
C. xw * y + xw x yx + ywx
Option: A
Explanation :
45:
B. If a language and its complement are both regular, the language is recursive
D. All of these
Option: D
Explanation :
46:
Option: D
Explanation :
47:
Consider a grammar :
G = ( { x , y ) , { s , x , y } , p , s)
A.Chomsky type 0
B. Chomsky type 1
C. Chomsky type 2
D.Chomsky type 3
Option: D
Explanation :
48:
Consider a grammar :
G={{S},{0,1},p,s}
S --> ss
S--> 0S1
S--> 1S0
S--> empty
A.regular language
B. context-free language
C. context-sensitive language
Option: A
Explanation :
A grammar that produces more than one parse tree for some sentence is called
A.ambiguos
B. unambigous
C. regular
D.none of these
Option: A
Explanation :
50:
Given a grammar G a production of G with a dot at some position of the right side is called
B. LR (1) item of G
D.none of these
Option: A
Explanation :
51:
A.yx
B. xyx
C. x
D.x y x y x
Option: D
Explanation :
52:
If every string of a language can be determined, whether it is legal or illegal in finite time, the
language is called
A.decidable
B. undecidable
C. interpretive
D.non-deterministic
Option: A
Explanation :
53:
The defining language for developing a formalism in which language definitions can be stated, is
called
B. decidable language
C. intermediate language
Option: A
Explanation :
54:
A.
B.
C.
D.
Option: B
Explanation :
55:
If e1 and e2 are the regular expressions denoting the languages L1 and L2 respectively, then which
of the following is wrong ?
Option: C
Explanation :
56:
Option: D
Explanation :
57:
C. regular language
Option: B
Explanation :
58:
A.union, intersection
C. intersection, complement
Option: B
Explanation :
59:
A.L (G) = φ
B. L(G) = an
C. L (G) = a*
Option: A
Explanation :
60:
Grammar
S —> a,
S —> A3A4 ,
A3 —> A1, A3, A2 ,
A3 —> A1 A2, A1
A2—> aA2A1 ,
A1a —> a A1,
A2a —> aA2,
A1A4 —> A4a,
A2A4 —> A5a,
A2A5 —> A5a,
A5 —> a
generates
A.an^2
B. n2a
C. 2an
D.none of these
Option: A
Explanation :
61:
If L1 = {x | x is a palindrome in (0 + 1)*}
L2 = {letter (letter + digit)* };
L3 = (0n 1n 2n | n > 1}
L4 = {ambnam+n | m, n > 1}
Option: A
Explanation :
62:
A grammar to generate
{ (ab)n I n ≥ 1 } ∪ { (ba)n I n ≥ 1 }
is constructed as
A.S ---> S1, S1 ---> abS1, S1 ---> ab, S ---> S2, S2 —> baS2, S2 —> ba
B. S ---> S1 , Sl ---> aS1, S1 ---> ab, S ---> S2, S2 ---> bS2, S2 —> bc
D.none of these
Option: C
Explanation :
63:
A.n2
B. n + 1
C. 2n
D.2n - 1
Option: D
Explanation :
64:
What is the highest type number which can be applied to the following grammar ?
S —> Aa, A —> Ba, B —> abc
A.Type 0
B. Type 1
C. Type 2
D.Type 3
Explanation :
65:
Following syntax-directed translation scheme is used with a shift reduction (bottom up) parser
that perform the action in braces immediately after a reduction by the corresponding production
A.0202021
B. 1202020
C. 1020202
D.none of these
Option: A
Explanation :
1:
D.None of these
Option: C
Explanation :
2:
B. o( f 2)
C. o(h)
D.O(h2)
Option: A
Explanation :
3:
If T is a TM recognizing L, and T reads every symbol in the input string, τT(n) ≥ 2n + 2, then any
language that can be accepted by a TM T with τT(n) = 2n + 2 is
A.regular
B. not regular
C. uncertain
D.none of these
Option: C
Explanation :
4:
Consider an alternate Turing machine model, in which there is an input tape on which the tape
head can move in both directions but cannot write, and one or more work tapes, one of which
serves as an output tape. For a function f, denoted by DSpace ( f ) , the set of languages that can
be recognized by a Turning machine of this type which uses no more than f(n) squares on any work
tape for any input string of length n. The only restriction we need to make on f is that f(n) > 0 for
every n. The language of balanced strings of parentheses are in
A.DSpace (1+ ⌈log2 (n + 1 ⌉). (⌈ x ⌉) means the smallest integer greater than or equal to x.
D.none of these
Option: A
Explanation :
Click on Discuss to view users comments.
5:
C. Determining of a universal turing machine can be written for fewer than k instructions for
some k
Option: A
Explanation :
A.Carnot's function
B. Ricmann function
C. Bounded function
D.Ackermann's function
Option: D
Explanation :
7:
Turing machine (TM) is more powerful than FMS (Finite State Machine) because
D.none of these
Option: C
Explanation :
If f : N--> N. If L can be recoognized by a TM T, so that τT(n) ≤ f (n) for all but finitely many n, then (
Time (f) means Time ( max ( f, 2n +2))).
B. L ∈ Time(cf)
C. L ∈ Time (h)
D.none of these
Option: A
Explanation :
9:
A.Space(s)
B. F(n)
C. Time(f)
D.Time(h)
Option: A
Explanation :
10:
C. Given two arbitrary context-free grammars G1 G2 and it is undecidable whether L (G1) = L (G2).
Option: D
Explanation :
Click on Discuss to view users comments.
11:
Option: C
Explanation :
12:
If there exists a language L, for which there exists a TM, T, that accepts every word in L and either
rejects or loops for every word that is not in L, is called
A.recursive
B. recursively enumerable
C. NP-HARD
D.none of these
Option: B
Explanation :
13:
D.All of these
Explanation :
14:
C. computability
D.all of these
Option: D
Explanation :
15:
A.1
B. 2
C. 3
D.4
Option: B
Explanation :
16:
A.true
B. false
D.all of these
Answer Report Discuss
Option: A
Explanation :
17:
If there exists a TM which when applied to any problem in the class, terminates, if correct answer
is yes and may or may not terminate otherwise is called
A.stable
B. unsolvable
C. partially solvable
D.unstable
Option: C
Explanation :
18:
Given a Turing machine T and a step-counting function f, is the language accepted by T in Time(f) ?
This decision problem is
A.solvable
B. unsolvable
C. uncertain
D.none of these
Option: B
Explanation :
19:
Option: D
Explanation :
20:
The running time T (n), where 'n' is input size of a recursive algorithm, is given as
T (n) = c + T (n - 1), if n > 1
= d, if n ≤ 1
The order of the algorithm is
A.n2
B. n
C. n3
D.nn
Option: B
Explanation :
21:
A.δ : Q x Σ --> Q x Γ
B. δ : Q x Γ ---> Q x Σ x {L, R}
C. δ : Q x Σ ---> Q x Γ x {L, R}
Option: D
Explanation :
22:
If L can be recognized by a TM T with a doubly infinite tape, and τt = f, then L can be recognized by
an ordinary TM with time complexity
A.O(f)
B. o(f)
C. O(h)
D.o(h)
Option: A
Explanation :
1:
Number of states of the FSM required to simulate behaviour of a computer with a memory
capable of storing "m" words, each of length 'n'
A.m x 2n
B. 2mn
C. 2m+n
D.all of these
Option: B
Explanation :
For every data here length is ‘n’ and memory's states are defined in terms of power of 2,
Here the total memory capability for all the words = mn
Hence number of states are 2mn
2:
An FSM with
D.None of these
Option: C
Explanation :
3:
D.None of these
Option: A
Explanation :
4:
Power of
Option: D
Explanation :
5:
D.All of these
Option: D
Explanation :
Option (a) and option (b) are similar deriving expressions using rule :- (pq)*p = p(qp)*
(x+x*+) will be
--->(xx*)(x*x**)
--->x+
6:
A finite state machine with the following state table has a single input x and a single output z. If
initial state is unknown, then shortest input sequence to reach the inal state C is
X=1 X =0
A D, 0 B, 0
B B, 1 C, 1
C B, 0 D, 1
D B, 1 C, 0
A.01
B. 10
C. 110
D.110
Option: B
Explanation :
7:
A.1
B. 3
C. 4
D.2
Option: D
Explanation :
Finite Automata (FA) or Finite State Machine to add two integers can be constructed using
two states:
q0: Start state to represent carry bit is 0
q1: State to represent carry bit is 1
8:
If two finite state machines are equivalent, they should have the same number of
A.states
B. edges
D.none of these
Option: D
Explanation :
9:
For which of the following applications regular expressions can be used ?
A.Designing compilers
D.All of these
Option: D
Explanation :
10:
L = {aP | p ; } is prime is
A.regular
B. not regular
C. accepted by DFA
D.accepted by PDA
Option: B
Explanation :
B. from any given state, there can't be any token leading to two different states
Option: D
Explanation :
12:
If f : {a, b}* —> (a, b}* be given by f (n) = ax for every value of n ∈ (a, b}, then f is
Option: A
Explanation :
13:
Option: C
Explanation :
14:
Running time of NFA to DFA conversion including the case where NFA has e-transition is
A.0 (n3)
B. 0 (n332)
C. 0 (n32n)
D.0 (n22n)
Option: C
Explanation :
15:
A.The task of lexical analyzer is to translate the input source language text into tokens and
determine the groups of tokens are inter-related.
B. Two basic approaches to translation are generation and interpretation.
C. A load-and-go compiler is capable o translating the source language text on a host machine A
that can be later run on any target machine B.
D.None of these
Option: D
Explanation :
D.All of these
Option: D
Explanation :
Strings of odd number of zeroes can be generated by the regular expression (00) *0.Pumping
lemma can be used to prove the non-regularity of the other options.
17:
C. in DFSA, from any given state, there can't be any alphabet leading to two diferent states
D.in NDFSA, from any given state, there can't be any alphabet leading to two diferent states
Option: C
Explanation :
18:
A.even
B. odd
C. null
D.none of these
Option: A
Explanation :
19:
A PDM behaves like an FSM wnen the number of auxiliary memory it has, is
A.0
B. 1
C. 2
D.None of these
Option: A
Explanation :
20:
A.any grammar
Option: D
Explanation :
21:
D.all of these
Option: B
Explanation :
22:
A. regular expression
B. DFSM
C. NDFSM
D.all of these
Option: D
Explanation :
23:
A.Designing computers
B. Designing compilers
D.Developing computers
Option: D
Explanation :
Click on Discuss to view users comments.
24:
Option: C
Explanation :
25:
A.Mathematical semantics
B. Interpretative semantics
C. Translational semantics
D.Axiomatic semantics
Option: A
Explanation :
26:
Which of the following regular expressions denotes a language comprising all possible strings over
the alphabet {a, b } ?
A. a* b*
B. (a | b)*
C. (ab)+
D. (a | b*)
Option: B
Explanation :
27:
An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length
Option: A
Explanation :
28:
C. even if mid-point is known, FSM be can't be found whether, second half of the string matches
the first half
D.all of these
Option: D
Explanation :
29:
If ∑ = {a, b, c, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used more
than once in a string is
A.35
B. 360
C. 49
D.720
Option: B
Explanation :
Here string length is 4 so we can create string of length 4 by 6 values. Suppose at first place
we can arrange any value by 6 methods.so 6. then Remaining total numbers are 5 so we can
arrange them by 5 methods at second place. then remaining total numbers are 4 so we can
arrange them by 4 methods. now remaining total numbers are 3 and we can arrange them by
3 methods. so according to permutation technique. We multiply them i.e. 6*5*4*3=360. So,
'B'
30:
A.context - free
B. context-sensitive
C. recursive
D.Right-linear
Option: D
Explanation :
31:
A.NO
B. YES
C. SOMETIMES
D.Depends on NFA
Option: B
Explanation :
32:
A.The language accepted by finite automata are the languages denoted by regular expressions
C. For a regular expression r, there does not exist NFA with L(r) any transit that accept
D.None of these
Option: C
Explanation :
33:
A. {a}
B. { ∈ , a, b }
C. {a, b}
D.{ ab }
Option: C
Explanation :
34:
A.{ a, b, ab, aa }
B. { a, b, ba, bb }
C. { a, b }
Option: D
Explanation :
35:
A.a | b
B. (ab)*
C. (a | b)*
D.a* I b
Option: C
Explanation :
36:
Which of the following regular expressions denotes a language comprising all possible strings of
even length over the alphabet ( 0 , 1 ) ?
A.(0 | 1) *
B. (0 | 1) (0 | 1)*
C. (00 01 10 11 )*
D.(0 | 1 ) (0 | 1)(0 | 1 ) *
Option: C
Explanation :
37:
The regular expression (a | b)* denotes the set of all strings
Option: D
Explanation :
38:
C. b* c l a
Option: C
Explanation :
39:
A.generative, cognitive
B. generative, acceptor
C. acceptor, cognitive
D.cognitive, generative
Option: D
Explanation :
40:
In the figure given below, a deterministic finite automation M has start state A and
accepting state D. Which of the following regular expression denoted the set of all words accepted
by
M?
A. 001
B. 10 * 1 * 0
C. ( 0 | 1) * 011
D.1* 0 * 001
Option: C
Explanation :
41:
A.union
B. concatenation
C. Kleene's closure
D. all of these
Explanation :
42:
A.compile time
B. Run time
D.none of these
Option: B
Explanation :
43:
A.(a ∪ b) *
B. (b* ∪ a*)*
C. (b ∪ a)*
D.All of above
Option: D
Explanation :
44:
A.can
B. can't
C. may
D.may not
Answer Report Discuss
Option: B
Explanation :
45:
A.S ⊂ T
B. T⊂ S
C. S = T
D.S ∩ T= φ
Option: C
Explanation :
46:
A.n states
B. n + 1 states
C. n + 2 states
D. none of these
Option: B
Explanation :
47:
If regular set A is represented by A = (01 + 1)* and the regular set 'B' is represented by B =
((01)*1*)*, then
A.A ⊂ B
B. B ⊂ A
D. A=B
Option: D
Explanation :
48:
B.
C. Set of binary string in which number of zeros is same as the number of ones.
Option: A
Explanation :
49:
D.All of these
Option: D
Explanation :
50:
An FSM with
A.1 stack is more powerful than an FSM with no stack
D.none of these
Option: C
Explanation :
51:
A.even
B. odd
C. null
D.none of these
Option: A
Explanation :
52:
A PDM behaves like an FSM wnen the number of auxiliary memory it has, is
A.0
B. 1
C. 2
D.none of these
Option: A
Explanation :
53:
A finite state machine with the following state table has a single input x and a single output z
A.01
A D, 0 B, 0
B. 10
C. 10
B B,1 C,1
D.110
Option: B
D B, 1 C, 0
Explanation :
54:
A.all strings
B. no string
C. ε- alone
D.none of these
Option: C
Explanation :
55:
If f : {a, b}* ---> {a , b } * be given by f(n) = ax for every value of n ∈ {a, b}, then f is
Option: A
Explanation :
56:
D.none of these
Option: A
Explanation :
57:
Regular expression corresponding to the state diagram given in the figure is
B. (1 + 0 (0 + 10) 00)*
C. (0 + 1 (1 + 10) 00)*
Option: A
Explanation :
58:
Option: C
Explanation :
1. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are
_____________
a) reflexive
b) transitive
c) symmetric
d) reflexive and transitive
View Answer
Answer: d
Explanation: A partially ordered relation refers to one which is Reflexive, Transitive and
Antisymmetric.
2. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} |
where string s contains even number of 0 and 1
a) 01,0011,010101
b) 0011,11001100
c) ε,0011,11001100
d) ε,0011,11001100
View Answer
Answer: b
Explanation: The Kleene star of A, denoted by A*, is the set of all strings obtained by concatenating
zero or more strings from A.
3. A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages
using the operation
a) Union
b) Concatenation
c) Kleene*
d) All of the mentioned
View Answer
Answer: d
Explanation: Union, Intersection, Concatenation, Kleene*, Reverse are all the closure properties of
Regular Language.
4. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its
states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
a) Statement 1 is false but Statement 2 and 3 are correct
b) Statement 1 and 2 are correct while 3 is wrong
c) None of the mentioned statements are correct
d) All of the mentioned
View Answer
Answer: d
Explanation: It is possible to represent a finite automaton graphically, with nodes for states, and arcs
for transitions.
5. The minimum number of states required to recognize an octal number divisible by 3 are/is
a) 1
b) 3
c) 5
d) 7
View Answer
Answer: b
Explanation: According to the question, minimum of 3 states are required to recognize an octal
number divisible by 3.
Answer: d
Explanation: A FA can be represented as FA= (Q, ∑, δ, q0, F) where Q=Finite Set of States, ∑=Finite
Input Alphabet, δ=Transition Function, q0=Initial State, F=Final/Acceptance State).
7. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the
infinite input tape is ______________
a) Compiler
b) Interpreter
c) Loader and Linkers
d) None of the mentioned
View Answer
Answer: a
Explanation: A Compiler is used to give a finite solution to an infinite phenomenon. Example of an
infinite phenomenon is Language C, etc.
8. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and
∑={0,1} is_________
a) 7
b) 6
c) 8
d) 5
View Answer
Answer: a
Explanation: ∑r= {1,0} and a Kleene* operation would lead to the following
set=COUNT{ε,0,1,00,11,01,10} =7.
9. For the following change of state in FA, which of the following codes is an incorrect option?
a) δ (m, 1) =n
b) δ (0, n) =m
c) δ (m,0) =ε
d) s: accept = false; cin >> char;
if char = “0” goto n;
View Answer
Answer: b
Explanation: δ(QX∑) = Q1 is the correct representation of change of state. Here, δ is called the
Transition function.
Answer: b
Explanation: ∑* represents any combination of the given set while ∑x represents the set of
combinations with length x where x ϵ
Answer: b
Explanation: Finite automaton with an output is categorize din two parts: Moore M/C and Mealy
M/C.
Answer: b
Explanation: Moore machine produces an output over the change of transition states while mealy
machine does it so for transitions itself.
3. For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
a) |Input|+1
b) |Input|
c) |Input-1|
d) Cannot be predicted
View Answer
Answer: a
Explanation: Initial state, from which the operations begin is also initialized with a value.
Answer: a
Explanation: Even ε, when passed as an input to Moore machine produces an output.
5. The total number of states and transitions required to form a moore machine that will produce
residue mod 3.
a) 3 and 6
b) 3 and 5
c) 2 and 4
d) 2 and 5
View Answer
Answer: a
Explanation:
Present State
Next State
Output
0
1
Q0
Q1
Q2
1
Q1
Q2
1
Q2
Q0
a) Q0, Q2, 0
b) Q0, Q2, 1
c) Q1, Q2, 1
d) Q1, Q0, 0
View Answer
Answer: a
Explanation: The table can be filled accordingly seeing the graph.
Answer: a
Explanation: The outputs are as per the input, produced.
Answer: b
Explanation: Source-The tuple definition of Moore and mealy machine comprises one new member
i.e. output alphabet as these are finite machines with output.
Answer: a
Explanation: Op(t)=δ(Op(t)) is the defined definition of how the output is received on giving a
specific input to Moore machine.
Answer: a
Explanation: Statement a and b is correct while c is false. Finite machines with output have no
accepting states and can be converted within each other.
Answer: c
Explanation: Definition of Mealy Machine.
Answer: c
Explanation: Finite Automaton with Output has a common definition for both the categories.
a) 9’s Complement
b) 2’s Complement
c) 1’s Complement
d) 10’s Complement
View Answer
Answer: b
Explanation: The input can be taken in form of a binary string and can be verified.
Answer: b
Explanation: The output of mealy machine depends on the present state as well as the input to that
state.
5.The ratio of number of input to the number of output in a mealy machine can be given as:
a) 1
b) n: n+1
c) n+1: n
d) None of the mentioned
View Answer
Answer: a
Explanation: The number of output here follows the transitions in place of states as in Moore
machine.
Answer: b
Explanation: They are collectively known as Transducers.
Answer: a
Explanation: Mealy and Moore machine vary over how the outputs depends on prior one
(transitions) and on the latter one(states).
Answer: a
Explanation: Being an input dependent and output capable FSM, Mealy machine reacts faster to
inputs.
9. Which of the following does the given Mealy machine represents?
a) 9’s Complement
b) 2’s Complement
c) 1’s Complement
d) 10’s Complement
View Answer
Answer: c
Explanation: Inputs can be taken and can be verified.
Answer: d
Explanation: It does not produce a language or a grammar or can be converted to a NFA
1. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e
d) none of the mentioned
View Answer
Answer: c
Explanation: The automaton may be allowed to change its state without reading the input symbol
using epsilon but this does not mean that epsilon has become an input symbol. On the contrary, one
assumes that the symbol epsilon does not belong to any alphabet.
Answer: b
Explanation: An e-NFA consist of 5 tuples: A=(Q, S, d, q0. F)
Note: e is never a member of S.
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend the
class of languages that can be represented.
Answer: b
Explanation: The epsilon closure of the set q is the set that contains q, together with all the states
which can be reached starting at q by following only epsilon transitions.
a) 0
b) 1
c) 2
d) 3
View Answer
Answer: c
Explanation: The epsilon closure set of f2 consist of the elements:{f2, f3}. Thus the count of the
element in the closure set is 2.
8. Which of the steps are non useful while eliminating the e-transitions for the given diagram?
Answer: d
Explanation: The given are the steps followed while eliminating epsilon transitions from a NFA or
converting an e-NFA to just NFA.
9. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no
View Answer
Answer: a
Explanation: Yes, the language is preserved during the dteps of construction: L(N)=L(N1)=L(N2)=L(3).
10. Remove all the epsilon transitions in the given diagram and compute the number of a-transitions
in the result?
a) 5
b) 7
c) 9
d) 6
View Answer
Answer: b
Explanation:
Answer: b
Explanation: A language for which there is no existence of a deterministic finite automata is always
Non Regular and methods like Pumping Lemma can be used to prove the same.
Answer: d
Explanation: A DFA can be represented in the following formats: Transition Graph, Transition Table,
Transition tree/forest/Any programming Language.
Answer: c
Explanation: Two states are said to be equivalent if and only if they have same number of states as
well as transitions.
Answer: c
Explanation: The figure represents the initial as well as the final state with an iteration of x.
a) ababaabaa
b) abbbaa
c) abbbaabb
d) abbaabbaa
View Answer
Answer: a
Explanation: All the Strings are getting accepted except ‘ababaabaa’ as it is directed to dumping
state. Dumping state also refers to the reject state of the automata.
a) ε
b) 11010
c) 10001010
d) String of letter count 11
View Answer
Answer: a
Explanation: As the initial state is not made an acceptance state, thus ε will not be accepted by the
given DFA. For the automata to accept ε as an entity, one should make the initial state as also the
final state.
Answer: b
Explanation: Language to accept a palindrome number or string will be non-regular and thus, its DFA
cannot be obtained. Though, PDA is possible.
10. Which of the following is not an example of finite state machine system?
a) Control Mechanism of an elevator
b) Combinational Locks
c) Traffic Lights
d) Digital Watches
View Answer
Answer: d
Explanation: Proper and sequential combination of events leads the machines to work in hand which
includes The elevator, Combinational Locks, Traffic Lights, vending machine, etc. Other applications
of Finite machine state system are Communication Protocol Design, Artificial Intelligence Research,
A Turnstile, etc.
1. The password to the admins account=”administrator”. The total number of states required to
make a password-pass system using DFA would be __________
a) 14 states
b) 13 states
c) 12 states
d) A password pass system cannot be created using DFA
View Answer
Answer: a
Explanation: For a string of n characters with no repetitive substrings, the number of states required
to pass the string is n+1.
Answer: b
Explanation: The Language can be anonymously checked and thus the answer can be predicted. The
language needs to be accepted by the automata (acceptance state) in order to prove its regularity.
3. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be
represented as:
a) {Hello, World, Input, Output, ε}
b) {Hello, World, ε}
c) {Input, Output, ε}
d) {}
View Answer
Answer: d
Explanation: Union operation creates the universal set by combining all the elements of first and
second set while intersection operation creates a set of common elements of the first and the
second state.
4. Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization
of DFA?
a) 3
b) 2
c) 1
d) 4
View Answer
Answer: b
Explanation: Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA.
5. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states
in DFA would be required?
a) 3
b) 2
c) 22
d) 27
View Answer
Answer: a
Explanation:
Answer: d
Explanation: The string a state receives is the combination of all input alphabets which lie across the
path covered.
7. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?
a) Regularity is dependent upon the length of the string
b) Regularity is not dependent upon the length of the string
c) Can’t be said for a particular string of a language
d) It may depend on the length of the string
View Answer
Answer: b
Explanation: DFA can be made for infinite language with an infinite length. Thus, dependency over
length is unfruitful.
8. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?
a) Yes
b) No
View Answer
Answer: b
Explanation: It is not possible to have a count of equal number of 0 and 1 at any instant in DFA. Thus,
It is not possible to build a DFA for the given Language.
9. δ(A,1) = B, δ(A,0) =A
Δ (B, (0,1)) =C
δ(C,0) = A (Initial state =A)
String=”011001” is transit at which of the states?
a) A
b) C
c) B
d) Invalid String
View Answer
Answer: a
Explanation: It is east and simple to create the table and then the corresponding transition graph in
order to get the result, at which state the given string would be accepted
1.Given Language: L= {xϵ∑= {a, b} |x has a substring ‘aa’ in the production}. Which of the
corresponding representation notate the same?
a)
b)
c)
d)
View Answer
Answer: a
Explanation: The states transited has been written corresponding to the transitions as per the row
and column. The row represents the transitions made and the ultimate.
2.Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information what is
the identity element for the string?
a) u-1
b) v-1
c) u-1v-1
d) ε
View Answer
Answer: d
Explanation: Identity relation: εw = wε = w, thus the one satisfying the given relation will be the
identity element.
a) 0101011
b) 0101010
c) 010100
d) 100001
View Answer
Answer: c
Explanation: The given DFA notation accepts the string of even length and prefix ‘01’.
4.Predict the following step in the given bunch of steps which accepts a strings which is of even
length and has a prefix=’01’
δ (q0, ε) =q0 < δ(q0,0) =δ (δ (q0, ε),0) =δ(q0,0) =q1 < _______________
a) δ (q0, 011) =δ (δ (q0,1), 1) =δ (q2, 1) =q3
b) δ (q0, 01) =δ (δ (q0, 0), 1) = δ (q1, 1) =q2
c) δ (q0, 011) =δ (δ (q01, 1), 1) =δ (q2, 0) =q3
d) δ (q0, 0111) =δ (δ (q0, 011), 0) = δ (q3, 1) =q2
View Answer
Answer: b
Explanation: Here, δ refers to transition function and results into new state or function when an
transition is performed over its state.
a) Q0
b) Q1
c) Q2
d) No Transition
View Answer
Answer: Q1
Explanation: The tabular representation of DFA is quite readable and can be used to some ore
complex problems. Here, we need to form the transition graph and fill up the given blank.
6.Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
a) δ (q0, a) =q0
b) δ (F, a) =q1
c) δ (F, a) =D
d) δ (q1, a) =D
View Answer
Answer: b
Explanation: For the given Language, the transition missing is δ (F, a) =q1.
7.The complement of a language will only be defined when and only when the __________ over the
language is defined.
a) String
b) Word
c) Alphabet
d) Grammar
View Answer
Answer: c
Explanation: It is not possible to define the complement of a language without defining the input
alphabets. Example: A language which does not consist of substring ‘ab’ while the complement
would be the language which does contain a substring ‘ab’.
Answer: Factorial
Explanation: Factorial, here is the most appropriate non-infinite domain. Otherwise, palindrome and
reverse have infinite domains.
9.Which among the following states would be notated as the final state/acceptance state?
L= {xϵ∑= {a, b} | length of x is 2}
a) q1
b) q2
c) q1, q2
d) q3
View Answer
Answer: b
Explanation: According to the given language, q2 Is to become the final/acceptance state in order to
satisfy.
10.Which of the following are the final states in the given DFA according to the Language given.?
L= {xϵ∑= {a, b} |length of x is at most 2}
a) q0, q1
b) q0, q2
c) q1, q2
d) q0, q1, q2
View Answer
Answer: d
Explanation: According to the given language, the length is at most 2, thus the answer is found
accordingly.
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The
Language of DFA”
Answer: d
Explanation: A language over an alphabet R is a set of strings over A which is uncountable and
infinite.
2. According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}
Statement 1: q ϵ Q’; Statement 2: FϵQ
a) Statement 1 is true, Statement 2 is false
b) Statement 1 is false, Statement 2 is true
c) Statement 1 is false, Statement 2 may be true
d) Statement 1 may be true, Statement 2 is false
View Answer
Answer: b
Explanation: Q is the Finite set of states, whose elements i.e. the states constitute the finite
automata.
Answer: a
Explanation: δ or the Transition function describes the best, how a DFA behaves on a string where to
transit next, which direction to take.
Answer: b
Explanation: As the question has dot operation, ε will not be a part of the concatenated set. Had it
been a union operation, ε would be a part of the operated set.
5. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the
possible remainders?
a) 0
b) 0,2
c) 0,2,4
d) 0,1,2,3
View Answer
Answer: d
Explanation: All the decimal numbers on division would lead to only 4 remainders i.e. 0,1,2,3
(Property of Decimal division).
6. Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?
a) divisible by 3
b) divisible by 2
c) divisible by 2 and 3
d) divisible by 3 and 2
View Answer
Answer: d
Explanation: The given DFA accepts all the binary strings such that they are divisible by 3 and 2.Thus,
it can be said that it also accepts all the strings which is divisible by 6.
7. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}
L2= {xϵ ∑*|x contains odd no’s of 1’s}
No of final states in Language L1 U L2?
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation:
8. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation: The maximum number of transitions which a DFA allows for a language is the number
of elements the transitions constitute.
9. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}
a) 4+4
b) 4+16
c) 4+0
d) depends on the Language
View Answer
Answer: d
Explanation: The out degree for a DFA I fixed while the in degree depends on the number of states in
the DFA and that cannot be determined without the dependence over the Language.
10. The sum of minimum and maximum number of final states for a DFA n states is equal to:
a) n+1
b) n
c) n-1
d) n+2
View Answer
Answer: a
Explanation: The maximum number of final states for a DFA can be total number of states itself and
minimum would always be 1, as no DFA exits without a final state. Therefore, the solution is n+1
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Regular
Language & Expression”.
Answer:b
Explanation: States, input symbols,initial state,accepting state and transition function.
Answer:d
Explanation: Inputs are state and input string output is states.
Answer:a
Explanation: This is minimal finite automata.
Answer:a
Explanation: This takes single state and string of input to produce a state.
5. δ*(q,ya) is equivalent to .
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
View Answer
Answer:b
Explanation: First it parse y string after that it parse a.
Answer:c
Explanation: If automata starts with starting state and after finite moves if reaches to final step then
it called accepted.
7. Languages of a automata is
a) If it is accepted by automata
b) If it halts
c) If automata touch final state in its life time
d) All language are language of automata
View Answer
Answer:a
Explanation: If a string accepted by automata it is called language of automata.
Answer:d
Explanation: According to Chomsky classification.
Answer:b
Explanation: Finite automata doesn’t require any stack operation .
Answer:d
Explanation: No final state requires.
11. Regular expression for all strings starts with ab and ends with bba is.
a) aba*b*bba
b) ab(ab)*bba
c) ab(a+b)*bba
d) All of the mentioned
View Answer
Answer:c
Explanation: Starts with ab then any number of a or b and ends with bba.
12. How many DFA’s exits with two states over input alphabet {0,1} ?
a) 16
b) 26
c) 32
d) 64
View Answer
Answer:d
Explanation: Number of DFA’s = 2n * n(2*n).
Answer:a
Explanation:Because there is no memory associated with automata.
14. Number of states require to simulate a computer with memory capable of storing ‘3’ words each
of length ‘8’.
a) 3 * 28
b) 2(3*8)
c) 2(3+8)
d) None of the mentioned
View Answer
Answer:b
Explanation: 2(m*n) states requires .
15. FSM with output capability can be used to add two given integer in binary representation. This is
a) True
b) False
c) May be true
d) None of the mentioned
View Answer
Answer:a
Explanation: Use them as a flip flop output .
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non
Deterministic Finite Automata – Introduction”
Answer: a
Explanation: Statement 1 and 2 always true for a given Language.
Answer: a
Explanation: Construct the DFA and NFA individually, and the attain the difference of states.
Answer: c
Explanation: A transducer is an automaton that produces an output on the basis of what input has
been given currently or previous state.
4. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of
states for the DFA is ?
a) 64
b) 32
c) 128
d) 127
View Answer
Answer: c
Explanation: The maximum number of sets for DFA converted from NFA would be not greater than
2n.
Answer: b
Explanation: Non deterministic or deterministic depends upon the definite path defined for the
transition from one state to another or undefined(multiple paths).
Answer: b
Explanation: DFA is a specific case of NFA.
Answer: a
Explanation: The individual Transition graphs can be made and the difference of transitions can be
determined.
8. The construction time for DFA from an equivalent NFA (m number of node)is:
a) O(m2)
b) O(2m)
c) O(m)
d) O(log m)
View Answer
Answer: b
Explanation: From the coded NFA-DFA conversion.
9. If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of
NFA.Find x?
a) 1/m2
b) 2m
c) 1/m
d) log m
View Answer
Answer: a
Explanation: Running time of DFA: O(n) and Running time of NFA =O(m2n).
Answer: c
Explanation: NFA, while computing strings, take parallel paths, make different copies of input and
goes along different paths in order to search for the result. This creates the difference in processing
speed of DFA and NFA
Answer: a
Explanation: For NFA or extended transition function on NFA, the tuple elements remains same i.e.
5.
a) Correct
b) Incorrect, Incomplete DFA
c) Wrong proposition
d) May be correct
View Answer
Answer: c
Explanation: The given figure is an NFA. The statement contradicts itself.
Answer: c
Explanation: q3 does not belong to Q where Q= set of finite states.
4. If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting the
same language would be:
Note: S is a subset of Q and a is a symbol.
a) δ’ (S, a) =Upϵs δ (p, a)
b) δ’ (S, a) =Up≠s δ (p, a)
c) δ’ (S, a) =Upϵs δ(p)
d) δ’ (S) =Up≠s δ(p)
View Answer
Answer: a
Explanation: According to subset construction, equation 1 holds true.
5. What is the relation between DFA and NFA on the basis of computational power?
a) DFA > NFA
b) NFA > DFA
c) Equal
d) Can’t be said
View Answer
Answer: c
Explanation: DFA is said to be a specific case of NFA and for every NFA that exists for a given
language, an equivalent DFA also exists.
6. If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there exists a
sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then r(n) is:
a) initial state
b) transition symbol
c) accepting state
d) intermediate state
View Answer
Answer: c
Explanation: r(n) is the final state and accepts the string S after the string being traversed through
r(i) other states where I ϵ 01,2…(n-2).
7. According to the given table, compute the number of transitions with 1 as its symbol but not 0:
a) 4
b) 3
c) 2
d) 1
View Answer
Answer: d
Explanation: The transition graph is made and thus the answer can be found.
a) {q0}
b) {q1} U {q0, q1, q2}
c) {q2, q1}
d) {q3, q1, q2, q0}
View Answer
Answer: b
Explanation: δ*(q0,011) = Urϵδ*(q0,01) δ (r, 1) = {q0, q1, q2}.
a) 6
b) 5
c) 4
d) 7
View Answer
Answer: a
Explanation: According to the question, presence of q2 or q1 would count so it does and the answer
according to the diagram is 6.
1.Δ(Q0, ε) ={Q0},
2.Δ(Q0, 01) = {Q0, Q1}
3.δ(Q0, 010) =?
Answer: c
Explanation: According to given table and extended transition state implementation, we can find the
state at which it rests.
Answer: a
Explanation: The conversion of a non-deterministic automata into a deterministic one is a process
we call subset construction or power set construction.
2. Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}
How many state are required to execute L3 using NFA?
a) 16
b) 15
c) 8
d) 7
View Answer
Answer: b
Explanation: The finite automaton for the given language is made and thus, the answer can be
obtained.
3. Which of the following does the given NFA represent?
Answer: c
Explanation: The given diagram can be analysed and thus the option can be seeked.
4. The number of transitions required to convert the following into equivalents DFA:
a) 2
b) 3
c) 1
d) 0
View Answer
Answer: a
Explanation:
5. If L is a regular language, Lc and Lr both will be:
a) Accepted by NFA
b) Rejected by NFA
c) One of them will be accepted
d) Cannot be said
View Answer
Answer: a
Explanation: If L is a regular Language, Lc and Lr both are regular even.
Answer: b
Explanation: REJECT state will be like a halting state which rejects a particular invalid input.
Answer: a
Explanation: We can represent one language in more one FSMs, example for a same language we
have a DFA and an equivalent NFA.
Answer: b
Explanation: The production of form non-terminal ->ε is call null production.
Answer: d
Explanation: DFSM’s for the first three option is not possible; hence they aren’t regular.
10. Which of the following recognizes the same formal language as of DFA and NFA?
a) Power set Construction
b) Subset Construction
c) Robin-Scott Construction
d) All of the mentioned
View Answer
Answer: d
Explanation: All the three option refers to same technique if distinguishing similar constructions for
different type of automata.
Answer: d
Explanation: NFA is said to be closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Kleene
e) Negation
2. It is less complex to prove the closure properties over regular languages using
a) NFA
b) DFA
c) PDA
d) Can’t be said
View Answer
Answer: a
Explanation: We use the construction method to prove the validity of closure properties of regular
languages. Thus, it can be observe, how tedious and complex is the construction of a DFA as
compared to an NFA with respect to space.
Answer: d
Explanation: There are many applications of finite automata, mainly in the field of Compiler Design
and Parsers and Search Engines.
4. John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’
in it. How many number of transitions would John use such that, the string processing application
works?
a) 9
b) 11
c) 12
d) 15
View Answer
Answer: a
Explanation:
Answer: c
Explanation: Thompson Construction method is used to turn a regular expression in an NFA by
fragmenting the given regular expression through the operations performed on the input alphabets.
6. Which among the following can be an example of application of finite state machine(FSM)?
a) Communication Link
b) Adder
c) Stack
d) None of the mentioned
View Answer
Answer: a
Explanation: Idle is the state when data in form of packets is send and returns if NAK is received else
waits for the NAK to be received.
Answer: d
Explanation: Finite state automation is used in Lexical Analyser, Computer BOT (used in games),
State charts, etc.
8. L1= {w | w does not contain the string tr }
L2= {w | w does contain the string tr}
Given ∑= {t, r}, The difference of the minimum number of states required to form L1 and L2?
a) 0
b) 1
c) 2
d) Cannot be said
View Answer
Answer: a
Explanation:
9. Predict the number of transitions required to automate the following language using only 3 states:
L= {w | w ends with 00}
a) 3
b) 2
c) 4
d) Cannot be said
View Answer
Answer: a
Explanation:
10. The total number of states to build the given language using DFA:
L= {w | w has exactly 2 a’s and at least 2 b’s}
a) 10
b) 11
c) 12
d) 13
View Answer
Answer: a
Explanation: We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus, using
this condition a finite automata can be created using 1 states
Answer: c
Explanation: The DFA for the given language can be constructed as follows:
Answer: a
Explanation: If the string is divisible by four, it surely ends with the substring ‘100’ while a binary
string divisible by 2 would surely end with the substring ‘10’.
3. Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further
consists of a dumping state. Predict the number of acceptance states in Lc.
a) 16
b) 11
c) 5
d) 6
View Answer
Answer: a
Explanation: If L leads to FA1, then for Lc, the FA can be obtained by exchanging the final and non-
final states.
4. If L1 and L2 are regular languages, which among the following is an exception?
a) L1 U L2
b) L1 – L2
c) L1 ∩ L2
d) All of the mentioned
View Answer
Answer: d
Explanation: It the closure property of Regular language which lays down the following statement:
If L1, L2 are 2- regular languages, then L1 U L2, L1 ∩ L2, L1C, L1 – L2 are regular language.
Answer: a
Explanation: When set operation ‘-‘ is performed between two sets, it points to those values of prior
set which belongs to it but not to the latter set analogous to basic subtraction operation.
6. Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1} | 3rd bit from right is 0}
a)
b)
c)
d) None of the mentioned
View Answer
Answer: a
Explanation: The NFA accepts all binary strings such that the third bit from right end is 1 and if not, is
send to Dumping state. Note: It is assumed that the input is given from the right end bit by bit.
Answer: c
Explanation: While the machine runs on some input string, if it has the choice to split, it goes in all
possible way and each one is different copy of the machine. The machine takes subsequent choice to
split further giving rise to more copies of the machine getting each copy run parallel. If any one copy
of the machine accepts the strings, then NFA accepts, otherwise it rejects.
Answer: a
Explanation: If K is the number of states in NFA, the DFA simulating the same language would have
states equal to or less than 2k.
9. Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’, A’), which
among the following is true?
a) Q’ = P(Q)
b) Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, a), for some r ϵ R}
c) Q’={q0}
d) All of the mentioned
View Answer
Answer: d
Explanation: All the optioned mentioned are the instruction formats of how to convert a NFA to a
DFA.
10. There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict the
maximum number of states in its equivalent DFA?
a) 226
b) 224
c) 225
d) 223
View Answer
Answer: a
Explanation: The maximum number of states an equivalent DFA can comprise for its respective NFA
with k states will be 2k.
1. According to the given transitions, which among the following are the epsilon closures of q1 for
the given NFA?
Δ (q1, ε) = {q2, q3, q4}
Δ (q4, 1) =q1
Δ (q1, ε) =q1
a) q4
b) q2
c) q1
d) q1, q2, q3, q4
View Answer
Answer: d
Explanation: The set of states which can be reached from q using ε-transitions, is called the ε-closure
over state q.
Answer: a
Explanation: It is possible to construct an NFA with ε-transitions, presence of no input symbols, and
that is called NFA with ε-moves.
Answer: c
Explanation: The transition with ε leads to a jump but without any shift in read head. Further, the
method can be called one to introduce hidden non-determinism.
Answer: c
Explanation: ε-closure is defined as the set of states being reached through ε-transitions from a
starting state.
6. Predict the total number of final states after removing the ε-moves from the given NFA?
a) 1
b) 2
c) 3
d) 0
View Answer
Answer: c
Explanation: The NFA which would result after eliminating ε-moves can be shown diagramatically.
Answer: a
Explanation: Due to the presence of ε symbol, or rather an epsilon-move, the input alphabets unites
with it to form a set including ε.
Answer: d
Explanation: All the mentioned are the closure properties of ε and encircles all the elements if it
satisfies the following options:
a) Every element of S ϵ Q
b) For any q ϵ ε(S), every element of δ (q, ε) is in ε(S)
c) No other element is in ε(S)
9. The automaton which allows transformation to a new state without consuming any input symbols:
a) NFA
b) DFA
c) NFA-l
d) All of the mentioned
View Answer
Answer: c
Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are usually
called NFA with epsilon moves or lambda transitions.
Answer: b
Explanation: An epsilon move is a transition from one state to another that doesnt require any
specific condition.
11. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any
state in P following e-transitions.
a) e-closure
b) e-pack
c) Q in the tuple
d) None of the mentioned
View Answer
Answer: a
Explanation: The e-closure of a set of states, P, of an NFA is defined as the set of states reachable
from any state in P following e-transitions.
1. The automaton which allows transformation to a new state without consuming any input symbols:
a) NFA
b) DFA
c) NFA-l
d) All of the mentioned
View Answer
Answer: c
Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are usually
called NFA with epsilon moves or lambda transitions.
2. e-transitions are
a) conditional
b) unconditional
c) input dependent
d) none of the mentioned
View Answer
Answer: b
Explanation: An epsilon move is a transition from one state to another that doesn’t require any
specific condition.
3. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any
state in P following e-transitions.
a) e-closure
b) e-pack
c) Q in the tuple
d) None of the mentioned
View Answer
Answer: a
Explanation: The e-closure of a set of states, P, of an NFAis defined as the set of states reachable
from any state in P following e-transitions.
5. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no
View Answer
Answer: a
Explanation: Yes, the language is preserved during the dteps of construction: L(N)=L(N1)=L(N2)=L(3).
Answer: b
Explanation: An e-NFA consist of 5 tuples: A=(Q, S, d, q0, F)
Note: e is never a member of S.
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend the
class of languages that can be represented.
1. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e
d) none of the mentioned
View Answer
Answer: c
Explanation: The automaton may be allowed to change its state without reading the input symbol
using epsilon but this does not mean that epsilon has become an input symbol. On the contrary, one
assumes that the symbol epsilon does not belong to any alphabet.
Answer: b
Explanation:
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend the
class of languages that can be represented.
Answer: c
Explanation: It is more convenient to simulate a machine using e-NFA else the method of Power
Construction is used from the union-closure of DFA’s.
5. Which of the following belongs to the epsilon closure set of a?
Answer: b
Explanation: The epsilon closure of the set q is the set that contains q, together with all the states
which can be reached starting at q by following only epsilon transitions.
Answer: c
Explanation: The epsilon closure set of f2 consist of the elements:{f2, f3}. Thus the count of the
element in the closure set is 2.
7. Which of the steps are non useful while eliminating the e-transitions for the given diagram?
Answer: d
Explanation: The given are the steps followed while eliminating epsilon transitions from a NFA or
converting an e-NFA to just NFA.
8. Remove all the epsilon transitions in the given diagram and compute the number of a-transitions
in the result?
a) 5
b) 7
c) 9
d) 6
View Answer
Answer: b
Explanation:
Answer:a
Explanation: Regular sets are closed under these three operation.
Answer:c
Explanation: String accepted in previous DFA will not be accepted and non accepting string will be
accepted .
Answer:a
Explanation: Regular sets are closed under complement operation.
Answer:a
Explanation: Regular expression are also colsed under intersection.
Answer:d
Explanation: Regular is closed under difference.
Answer:c
Explanation: By making final state as starting state string starting from end will be accepted.
Answer:c
Explanation: There is only one state which is start and final state of DFA so interchanging starting
start and final state doesn’t change DFA.
Answer:c
Explanation: This operation replace using a function .
Answer:c
Explanation: Regular set are closed under homomorphism.
Answer:d
Explanation: It is a regular expression.
Answer:d
Explanation: Only d is regular language.
Answer:d
Explanation: It is a regular expression.
Answer:d
Explanation: It is a regular expression.
Answer:d
Explanation: It is a regular expression.
Answer:a
Explanation: Given expression accept all string so complement will accept nothing
Answer: a
Explanation: According to Myhill Nerode theorem, the corollary proves the given statement correct
for equivalence classes.
2. A language can be generated from simple primitive language in a simple way if and only if
a) It is recognized by a device of infinite states
b) It takes no auxiliary memory
c) Both are correct
d) Both are wrong
View Answer
Answer: b
Explanation: A language is regular if and only if it can be accepted by a finite automaton. Secondly, It
supports no concept of auxiliary memory as it loses the data as soon as the device is shut down.
Answer: d
Explanation: The given option represents {0, 01} in different forms using set operations and Regular
Expressions. The operator like ^, v, etc. are logical operation and they form invalid regular
expressions when used.
4. According to the given language, which among the following expressions does it corresponds to?
Language L={xϵ{0,1}|x is of length 4 or less}
a) (0+1+0+1+0+1+0+1)4
b) (0+1)4
c) (01)4
d) (0+1+ε)4
View Answer
Answer: d
Explanation: The extended notation would be (0+1)4 but however, we may allow some or all the
factors to be ε. Thus ε needs to be included in the given regular expression.
Answer: a
Explanation: The given regular expression corresponds to a language of binary strings which is of
even length including a length of 0.
6. If R represents a regular language, which of the following represents the Venn-diagram most
correctly?
a) An Irregular Set
b) R*
c) R complement
d) R reverse
View Answer
Answer: b
Explanation: The given diagram represents the Kleene operation over the Regular Language R in
which the final states become the initial and the initial state becomes final.
Answer: a
Explanation: The transition states shown are the result of breaking down the given regular
expression in fragments. For dot operation, we change a state, for union (plus) operation, we
diverge into two transitions and for Kleene Operation, we apply a loop.
Answer: b
Explanation: Two operands are said to be performing Concatenation operation AB = A•B = {xy: x ∈ A
& y ∈ B}.
Answer: b
Explanation: By distributive property (Regular expression identities), we can prove the given identity
to be Ф.
10. RR* can be expressed in which of the forms:
a) R+
b) R-
c) R+ U R-
d) R
View Answer
Answer: a
Explanation: RR*=R+ as R+ means the occurrence to be at least once.
Answer: d
Explanation: Type 3 refers to Regular Languages which is accepted by a finite automaton.
Answer: d
Explanation: There are few identities over Regular Expressions which include: RФ=ФR=Ф≠R
Answer: a
Explanation: ε+1*(011) *(1*(011) *) *
ε + RR*= ε + R*R= ε + R+= R*
a) Q*P
b) QP*
c) Q*P*
d) (P*O*) *
View Answer
Answer: b
Explanation: The given statement is the Arden’s Theorem and it tends to have a unique solution as
QP*.
Let P and Q be regular expressions,
R=Q+RP
R=Q+(Q+RP) P
R=Q+((Q+RP) +RP) +P=Q+QP+RPP+RPP=Q+QP+(Q+RP) PP+(Q+RP) PP=Q+QP+QPP+RPPP+QPP+RPPP,
If we do this recursively, we get:
R= QP*
Answer: c
Explanation: Arden’s theorem strictly assumes the following;
a) No null transitions in the transition diagrams
b) True for only single initial state
6. The difference between number of states with regular expression (a + b) and (a + b) * is:
a) 1
b) 2
c) 3
d) 0
View Answer
Answer: a
Explanation:
7. In order to represent a regular expression, the first step to create the transition diagram is:
a) Create the NFA using Null moves
b) Null moves are not acceptable, thus should not be used
c) Predict the number of states to be used in order to construct the Regular expression
d) None of the mentioned
View Answer
Answer: a
Explanation: Two steps are to be followed while converting a regular expression into a transition
diagram:
a) Construct the NFA using null moves.
b) Remove the null transitions and convert it into its equivalent DFA.
9. The minimum number of states required to automate the following Regular Expression:
(1) *(01+10) (1) *
a) 4
b) 3
c) 2
d) 5
View Answer
Answer: a
Answer: a
Explanation: Regular Expression denote precisely the class of regular language. Given any regular
expression, L(R) is a regular language. Given any regular language L, there is a regular expression R,
such that L(R)=L.
Answer: a
Explanation: ε represents a single string in the set namely, the empty string while Statement 2 is also
correct.
Answer: c
Explanation: If a regular language expression is given, the appropriate order of precedence if the
parenthesis is ignored is: Star or Kleene, Dot or Concatenation, Union or Plus.
3. Regular Expression R and the language it describes can be represented as:
a) R, R(L)
b) L(R), R(L)
c) R, L(R)
d) All of the mentioned
View Answer
Answer: c
Explanation: When we wish to distinguish between a regular expression R and the language it
represents; we write L(R) to be the language of R.
Answer: b
Explanation: This regular expression can be used to eliminate the answers and get the result. The
length can be even and as well more than 3 when R= (∑∑∑) (∑∑∑) (particular case).
Answer: a
Explanation: The star operation brings together any number of strings from the language to get a
string in the result. If the language is empty, the star operation can put together 0 strings, resulting
only the empty string.
Answer: a
Explanation: The Regular expression (ab U a) * is converted to NFA in a sequence of stages as it can
be clearly seen in the diagram. This NFA consist of 8 stated while its minimized form only contains 2
states.
7. Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?
a) (0+10)*(1+ε)
b) (0+10)*(1+ε)*
c) (0+101)*(0+ε)
d) (1+010)*(1+ε)
View Answer
Answer: a
Explanation: All the options except ‘a’ accept those strings which comprises minimum one pair of 1’s
together.
Answer: c
Explanation: A finite automaton accepts the languages which are regular and for which a DFA can be
constructed.
Answer: d
Explanation: Following the rules of precedence, Kleene or star operation would be done first, then
concatenation and finally union or plus operation.
10. Which of the following regular expressions represents the set of strings which do not contain a
substring ‘rt’ if ∑= {r, t}
a) (rt)*
b) (tr)*
c) (r*t*)
d) (t*r*)
View Answer
Answer: d
Explanation: As Kleene operation is not on the whole of the substring, it will not repeat and maintain
the order of t, r.
11. According to the precedence rules, x-y-z is equivalent to which of the following?
a) (x-y)-z
b) x-(y-z)
c) Both (x-y)-z and x-(y-z)
d) None of the mentioned
View Answer
Answer: a
Explanation: In arithmetic, we group two of the same operators from the left, hence x-y-z is
equivalent to (x-y)-z and not x-(y—z).
12. Dot operator in regular expression resembles which of the following?
a) Expressions are juxtaposed
b) Expressions are multiplied
c) Cross operation
d) None of the mentioned
View Answer
Answer: a
Explanation: Dot operation or concatenation operation means that the two expressions are
juxtaposed i.e. there are no intervening operators in between. In fact, UNIX regular expressions use
the dot for an entirely different purpose: representing any ASCII character.
Answer: d
Explanation: It does not matter in which order we group the expression with the operators as they
are associative. If one gets a chance to group the expression, one should group them from left for
convenience. For instance, 012 is grouped as (01)2.
Answer: c
Explanation: Using the rules of precedence on the give expression, c is the appropriate choice with
the order of: Bracket>Kleene>Dot>Union
a) (0+1)*001(0+1)*
b) 1*001(0+1)*
c) (01)*(0+0+1)(01)*
d) None of the mentioned
View Answer
Answer: a
Explanation: There needs to be 001 together in the string as an essential substring. Thus, the other
components can be anything, 0 or 1 or e.
Answer: b
Explanation: Using NFA with e moves, we can represent all the regular expressions as an automata.
As regular expressions include e, we need to use e moves.
3. The total number of states required to automate the given regular expression
(00)*(11)*
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: c
Explanation:
4. Which of the given regular expressions correspond to the automata shown?
a) (110+1)*0
b) (11+110)*1
c) (110+11)*0
d) (1+110)*1
View Answer
Answer: c
Explanation: There is no state change for union operation, but has two different paths while for
concatenation or dot operation, we have a state change for every element of the string.
Answer: a
Explanation: Passwords like abc123, 123XYZ, should not be accepted . If one also wants to include
special characters as one of the constraint, one can use the following regular expression:
^(?=.*[a-z])(?=.*[A-Z])(?=.*\d)(?=.*[^\da-za-Z]).{8,15}$
Answer: a
Explanation: As the input variables are under Kleene Operation, we need to include e,thus option c is
not correct,thereby option (a) is the right answer.
7. The minimum number of states required in a DFA (along with a dumping state) to check whether
the 3rd bit is 1 or not for |n|>=3
a) 3
b) 4
c) 5
d) 1
View Answer
Answer: c
Explanation:
Answer: c
Explanation: Identifiers in C Programming Language follows the following identifiers rule:
a) The name of the identifier should not begin with a digit.
b) It can only begin with a letter or a underscore.
c) It can be of length 1 or more.
Answer: c
Explanation: (a) and (b) are the general cases where we restrict the acceptance of a string witrh
substring 00 but we ignore the case where the string needs to end with 1 which therby, does not
allows the acceptance of e.
10. The minimum number of transitions to pass to reach the final state as per the following regular
expression is:
{a,b}*{baaa}
a) 4
b) 5
c) 6
d) 3
View Answer
Answer: a
Answer: c
Explanation: We use this algorithm to simplify a finite automaton to regular expression or vice versa.
We eliminate states while converting a given finite automata to its corresponding regular
expression.
2. If we have more than one accepting states or an accepting state with an outdegree, which of the
following actions will be taken?
a) addition of new state
b) removal of a state
c) make the newly added state as final
d) more than one option is correct
View Answer
Answer: d
Explanation: If there is more than one accepting state or if the single accepting state as an out
degree , add a new accepting state, make all other states non accepting, and hold an e-transitions
from each former accepting state to the new accepting state.
a) Yes
b) No
View Answer
Answer: a
Explanation: The state q2 can be eliminated with ease and the reduced state diagram can be
represented as:
Answer: a
Explanation: Brzozowski method takes a unique approach to generating regular expressions. We
create a system of regular expressions with one regular expression unknown for each state in M, and
then we solve the system for Rλ where Rλ is the regular expression associated with starting state qλ.
Answer: a
Explanation: For every NFA, there exists an equivalent DFA and vice versa.
Answer: d
Explanation: For converting RE to DFA , first we convert RE to NFA (Thompson Construction), and
then NFA is converted into DFA(Subset Construction).
Answer: a
Explanation: For every state which is eliminated, a new regular expression is produced. The newly
generated regular expression act as an input for a state which is next to removed state.
10. Is it possible to obtain more than one regular expression from a given DFA using the state
elimination method?
a) Yes
b) No
View Answer
Answer: a
Explanation: Using different sequence of removal of state, we can have different possible solution of
regular expressions. For n-state deterministic finite automata excluding starting and final states, n!
Removal sequences are there. It is very tough to try all the possible removal sequences for smaller
expressions.
Answer: d
Explanation: None.
Answer: d
Explanation: All are equivalent to union operation.
Answer: a
Explanation: None.
Answer: a
Explanation: None.
5. a? is equivalent to
a) a
b) a+Φ
c) a+ϵ
d) wrong expression
View Answer
Answer: c
Explanation: Zero or one time repetition of previous character .
6. ϵL is equivalent to
a) ϵ
b) Φ
c) L
d) Lϵ
View Answer
Answer: c,d
Explanation: None.
7. (a+b)* is equivalent to
a) b*a*
b) (a*b*)*
c) a*b*
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
8. ΦL is equivalent to
a) LΦ
b) Φ
c) L
d) ϵ
View Answer
Answer: a,b
Explanation: None.
Answer: c
Explanation: (ab)*=(a*b*)*.
Answer: d
Explanation: All are equivalent to (a+b)*.
1. How many strings of length less than 4 contains the language described by the regular expression
(x+y)*y(a+ab)*?
a) 7
b) 10
c) 12
d) 11
View Answer
Answer: c
Explanation: string of length 0 = Not possible (because y is always present).
string of length 1 = 1 (y)
string of length 2 = 3 (xy,yy,ya)
string of length 3 = 8 (xxy,xyy,yxy,yyy,yaa,yab,xya,yya)
Answer: d
Explanation: None.
Answer: a
Explanation: All of above machine can accept regular language but all string accepted by machine is
regular only for DFA.
4. Regular grammar is
a) context free grammar
b) non context free grammar
c) english grammar
d) none of the mentioned
View Answer
Answer: a
Explanation: Regular grammar is subset of context free grammar.
5. Let the class of language accepted by finite state machine be L1 and the class of languages
represented by regular expressions be L2 then
a) L1<L2
b) L1>=L2
c) L1 U L2 = .*
d) L1=L2
View Answer
Answer: d
Explanation: Finite state machine and regular expression have same power to express a language.
Answer: b
Explanation: Except b all are regular expression*.
Answer: a
Explanation: According to Chomsky hierarchy .
Answer: b
Explanation: None.
Answer: d
Explanation:If L is recursive enumerable and its complement too if and only if L is recursive.
Answer: d
Explanation: According to definition of regular expression
Answer: d
Explanation: Regexp processors are found in several search engines, seach and replace mechanisms,
and text processing utilities.
Answer: a
Explanation: Many languages come with built in support of regexps like Perl, Javascript, Ruby etc.
While some provide support using standard libraries like .NET, Java, Python, C++, C and POSIX.
Answer: c
Explanation: A regexp processor translates the syntax into internal representation which can be
executed and matched with a string and that internal representation can have several approaches
like the ones mentioned.
Answer: a
Explanation: Paranthesis can be used to define the scope and precedence of operators. Thus, both
the expression represents the same pattern.
Answer: d
Explanation: A quantifier after a token specifies how often the preceding element is allowed to
occur. ?, *, +, {n}, {min, }, {min, max} are few quantifiers we use in regexps implementations.
7. Which of the following cannot be used to decide whether and how a given regexp matches a
string:
a) NFA to DFA
b) Lazy DFA algorithm
c) Backtracking
d) None of the mentioned
View Answer
Answer: d
Explanation: There are at least three algorithms which decides for us, whether and how a regexp
matches a string which included the transformation of Non deterministic automaton to deterministic
finite automaton, The lazy DFA algorithm where one simulates the NFA directly, building each DFA
on demand and then discarding it at the next step and the process of backtracking whose running
time is exponential.
if ($string1 =~ m/(H..).(l..)/) {
Answer: c
Explanation: () groups a series of pattern element to a single element.
When we use pattern in parenthesis, we can use any of ‘$1’, ‘$2’ later to refer to the previously
matched pattern.
$string1 = "Hello\nWorld\n";
if ($string1 =~ m/d\n\z/) {
Answer: c
Explanation: It matches the end of a string and not an internal line.The given segment of code
outputs:
Hello
World
is a string that ends with ‘d\n’
Answer: a
Explanation: Thompson construction algorithm is an algorithm in automata theory used to convert a
given regular expression into NFA. Similarly, Kleene algorithm is used to convert a finite automaton
to a regular expression.
1. Which among the following is not a UNIX command for regular expressions?
a) ed
b) sed
c) vi
d) none of the mentioned
View Answer
Answer: d
Explanation: Regular expressions are used by different commands in Unix like ed, sed, grep, awk, vi,
etc. Sed stands for stream editor which is exclusively used for executing scripts.
Answer: b
Explanation: Regular expression provides more flexibility while matching string patterns. Special
characters like ^, $, *, . are very useful.
Answer: d
Explanation: There are few expressions which provide the utility of matching metacharacters
including /^$/ for blank lines, / */ for matching one or more spaces, /^.*$/ for matching an entire
line whatever it is.
4. For the given syntax of sed, which among the following is not a correct option?
General syntax of sed: /pattern/action
a) / are used as delimiters
b) pattern refers to a regular expression
c) pattern refers to the string to be matched
d) action refers to the command
View Answer
Answer: c
Explanation: In the general syntax of sed, pattern is the regular expression and action refers to the
command given (p: prints the line, d: deletes the line, etc).
Answer: b
Explanation: The grep is a standard UNIX utility program that searches through a set of files in search
of a text pattern,specified through a regular expression.
Answer: a
Explanation: Such a generated pattern could be a fixed word or describe something like more
general.
Answer: c
Explanation: grep is a command which finds the pattern in a particular text segment.Here, it scans
each line in heroes.txt and looks for an m followed by a and then followed by n.
Answer: b
Explanation: There are many other common regular expression operators like $, ^, etc. Which have
their own respective purposes.
Answer: d
Explanation: There are many UNIX tools including vi, Emacs, sed, awk and modern programming
languages which support regular expressions.
Answer: b
Explanation: A lexeme is a string of characters that form a syntactic unit. It is reasonable to say that
is the sequence of alphanumeric characters in a token.
2. If the lexical analyser finds a lexeme with the same name as that of a reserved word,it _________
a) overwrites the word
b) overwrites the functionality
c) generates an error
d) something else
View Answer
Answer: c
Explanation: Reserved words are known as keywords and they are specific and reserved with its
functionality to a language. Thus, getting an input with the same name by the analyzer will generate
an error.
3. The methodology to show an error when the analyzer faces a keyword over an user’s input is
based on:
a) rule priority
b) longest match rule
c) keyword-out rule
d) none of mentioned
View Answer
Answer: a
Explanation: The lexical analyzer follows the rule priority where its prioritizes keywords over an input
it gets with the same name as that of the keyword and thus generates an error.
Answer: b
Explanation: A lexical analyzer reads the source code letter by letter and when it encounters a space
or an operator or any special character, it decides that the word is completed.
Answer: b
Explanation: The Longest Match rule states that the lexeme scanned should be determined on the
basis of longest match among all the token available.
6. The output of the lexical and syntax analyzer can stated as:
a) parse stream, parse tree
b) token tree, parse tree
c) token stream, parse tree
d) all of the mentioned
View Answer
Answer: c
Explanation: The lexical analyzer outputs the stream of token which is taken up by syntax analyzer
one by one against the production rule and parse tree is generated.
7. Which among the following is not a tool to construct lexical analyzer from a regular expression?
a) lex
b) flex
c) jflex
d) none of the mentioned
View Answer
Answer: d
Explanation: Lexical analysis is done using few tools such as lex, flex and jflex. Jflex is a computer
program that generates lexical analyzers (also known as lexers or scanners) and works apparently
like lex and flex. Lex is commonly used with yacc parser generator.
Answer: d
Explanation: A program which performs lexical analysis is called lexer, scanner or lexer. Nowadays,
lexer is combined with a parser which allows syntactic analysis.
Answer: d
Explanation: Lexers and parsers are most commonly used in compilers, but it has more application
elsewhere like in prettyprinters or linters(application of stylistic formatting conventions to textfiles,
source code, etc.).
Answer: a
Explanation: The first phase of compilation process is called lexical analysis. It fragments the source
code into token which is the smallest programming unit of a program.
11. Which of the following characters are ignored while lexical analysis?
a) .
b) =
c) #
d) WhiteSpace
View Answer
Answer: d
Explanation: The lexical analyzer ignores all the whitespaces and fragments the program into tokens.
Answer: d
Explanation: oolex, flex, lex, jflex, all are lexical analyzer tools which perform the following function.
13. The action of parsing the source code into proper syntactic classes is known as:
a) Parsing
b) Interpretation analysis
c) Lexicography
d) Lexical Analysis
View Answer
Answer: d
Explanation: Lexical analysis or scanning is the process of parsing the source code into proper
syntactic classes. It gets things ready for the parser with lexemes to built the parse tree.
Answer: a
Explanation: Lexical analysis involves the following task:
a) Building a uniform symbol table
b) Parsing the source code into tokens
c) Building a literal and identifier table
Answer: a
Explanation: A scanner or a lexical analyzer takes a source code as input and outputs a stream of
token after fragmenting the code.
16. The phase of compilation which involves type checking is:
a) Parsing
b) Scanning
c) Syntax directed translation
d) Semantic Analyzer
View Answer
Answer: c
1. The minimum length of a string {0,1}* not in the language corresponding to the given regular
expression:
(0*+1*)(0*+1*)(0*+1*)
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: b
Explanation: 0101 or 1010 the strings with minimum length on {0,1}* which does not belong to the
language of the given regular expression.Other strings like 111, 000, 1101, etc are accepted by the
language .
Answer: a
Explanation: What we observe from the question is that, it includes e and 11 and any number of 1’s
then. Therefore, its simplifies when we write the same reg. Expression as (11+111)*.
3. The minimum number of 1’s to be used in a regular expression of the given language:
R(x): The language of all strings containing exactly 2 zeroes.
a) 2
b) 3
c) 0
d) 1
View Answer
Answer: b
Explanation: It is not required to automate the question if asked theoretically.The number of zeroes
fixed is 2. Therefore, we can represent the regular expression as 1*01*01*.
4. The given regular language corresponds to which of the given regular language
e+1+(1+0)*0+(0+1)*11
a) The language of all strings that end with 11 or 00
b) The language of all strings that end with 0 or 1
c) The language of all strings which does not end with 01
d) None of the mentioned
View Answer
Answer: c
Explanation: According to the given regular expression, e is accepted by its language and it does not
end with 00 or 11 or 0 or 1. Thus option a and b are eliminated. Further, the regular expression is
valid for the third option.
5. Statement: If we take the union of two identical expression, we can replace them by one copy of
the expression.
Which of the following is a correct option for the given statement?
a) Absorption Law
b) Idempotent Law
c) Closure Law
d) Commutative Law
View Answer
Answer: b
Explanation: Idempotent Law states that if we take the union of two like expression, we can use a
copy of the expression instead i.e. L+L=L. The common arithmetic operators are not idempotent.
Answer: a
Explanation: An annihilator for an operator is a value such that when the operator is applied to the
annihilator and some other value, the result is the annihilator.
7. Statement: A digit, when used in the CFG notation, will always be used as a terminal.
State true or false?
a) True
b) False
View Answer
Answer: a
Explanation: Lowercase letters near the beginning of an alphabet, a, b and so on are terminal
symbols. We shall also assume that digits and other characters such as + or parenthesis are
terminals.
8. Choose the incorrect process to check whether the string belongs to the language of certain
variable or not?
a) recursive inference
b) derivations
c) head to body method
d) All of the mentioned
View Answer
Answer: d
Explanation: There are two approaches to infer that certain string are in the language of a certain
variable. The most conventional way is to use the rules from body to head, recursive inference. The
second approach is expanding the starting variable using one of its productions whose head is tart
symbol and derive a string consisting entirely of terminals(head to body or derivations).
9. Statement: Left most derivations are lengthy as compared to Right most derivations.
Choose the correct option:
a) correct statement
b) incorrect statement
c) may or may not be correct
d) depends on the language of the grammar
View Answer
Answer: c
Explanation: It completely depends on the person who develops the grammar of any language, how
to make use of the tools i.e. leftmost and rightmost derivations.
10. A->aAa|bAb|a|b|e
Which among the following is the correct option for the given production?
a) Left most derivation
b) Right most derivation
c) Recursive Inference
d) None of the mentioned
View Answer
Answer: a
Explanation: The given form represents leftmost derivations in which at each step we replace the
leftmost variable by one of its production bodies.
1. All the regular languages can have one or more of the following descriptions:
i) DFA ii) NFA iii) e-NFA iv) Regular Expressions
Which of the following are correct?
a) i, ii, iv
b) i, ii, iii
c) i, iv
d) i, ii, iii, iv
View Answer
Answer: d
Explanation: The class of languages known as the regular language has atleast four different
descriptions: i) DFA ii) NFA iii) e-NFA iv) Regular Expressions
2. Which of the technique can be used to prove that a language is non regular?
a) Ardens theorem
b) Pumping Lemma
c) Ogden’s Lemma
d) None of the mentioned
View Answer
Answer: b
Explanation: We use the powerful technique called Pumping Lemma, for showing certain languages
not to be regular. We use Ardens theorem to find out a regular expression out of a finite automaton.
Answer: b
Explanation: Here, i has limits i.e. the language is finite, contains few elements and can be graphed
using a deterministic finite automata. Thus, it is regular. Others can be proved non regular using
Pumping lemma.
Answer: d
Explanation: All of the given languages are regular and finite and thus, can be represented using
respective deterministic finite automata. We can also use mealy or moore machine to represent
remainders for option c.
5. If L is DFA-regular, L’ is
a) Non regular
b) DFA-regular
c) Non-finite
d) None of the mentioned
View Answer
Answer: b
Explanation: This is a simple example of a closure property: a property saying that the set of DFA-
regular languages is closed under certain operations.
Answer: b
Explanation: Let L be a regular language. If ~L has k equivalent classes, then any DFA that recognizes
L must have atleast k states.
7. Myphill Nerode does the following:
a) Minimization of DFA
b) Tells us exactly when a language is regular
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: c
Explanation: In automata theory, the Myphill Nerode theorem provides a necessary and sufficient
condition for a language to be regular. The Myphill Nerode theorem can be used to show a language
L is regular by proving that the number of equivalence classes of RL(relation) is finite.
Answer: d
Explanation: The myphill nerode theorem can be generalized to trees and an application of tree
automata prove an algorithmic meta theorem about graphs.
9. Given languages:
i) {anbn|n>=0}
ii) <div>n</div>n
iii) {w∈{a,b}∗| #a(w)=#b(w)}, # represents occurrences
Which of the following is/are non regular?
a) i, iii
b) i
c) iii
d) i, ii, iii
View Answer
Answer: d
Explanation: There is no regular expression that can parse HTML documents. Other options are also
non-regular as they cannot be drawn into finite automaton.
10. Finite state machine are not able to recognize Palindromes because:
a) Finite automata cannot deterministically find the midpoint
b) Finite automata cannot remember arbitarily large amount of data
c) Even if the mid point is known, it cannot find whether the second half matches the first
d) All of the mentioned
View Answer
Answer: d
Answer: b
Explanation: Pumping lemma defines an essential property for every regular language in automata
theory. It has certain rules which decide whether a language is regular or not.
2. While applying Pumping lemma over a language, we consider a string w that belong to L and
fragment it into _________ parts.
a) 2
b) 5
c) 3
d) 6
View Answer
Answer: c
Explanation: We select a string w such that w=xyz and |y|>0 and other conditions. However, there
exists an integer n such that |w|>=n for any wÎL.
3. If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an
empty string?
a) x
b) y
c) z
d) all of the mentioned
View Answer
Answer: b
Explanation: The lemma says, the portion y in xyz cannot be zero or empty i.e. |y|>0, this condition
needs to be fulfilled to check the conclusion condition.
4. Let w= xyz and y refers to the middle portion and |y|>0.What do we call the process of repeating
y 0 or more times before checking that they still belong to the language L or not?
a) Generating
b) Pumping
c) Producing
d) None of the mentioned
View Answer
Answer: b
Explanation: The process of repeatation is called pumping and so, pumping is the process we
perform before we check whether the pumped string belongs to L or not.
5. There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some
constant integer n.What can be the maximum length of the substring xy i.e. |xy|<=?
a) n
b) |y|
c) |x|
d) none of the mentioned
View Answer
Answer: a
Explanation: It is the first conditional statement of the lemma that states that |xy|<=n, i.e. the
maximum length of the substring xy in w can be n only.
Answer: b
Explanation: Finite languages trivially satisfy the pumping lemma by having n equal to the maximum
string length in l plus 1.
Answer: d
Explanation: Suppose L is a regular language . Then there is an integer n so that for any x∈L and
|x|>=n, there are strings u,v,w so that
x= uvw
|uv|<=n
|v|>0
for any m>=0, uvmw ∈L.
8. If d is a final state, which of the following is correct according to the given diagram?
Answer: a
Explanation: The FSA accepts the string pqrs. In terms of pumping lemma, the string pqrs is broken
into an x portion an a, a y portion qr and a z portion s.
9. Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What does
these variables represent?
a) string count
b) string
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: a
Explanation: Given: w =xyz. Here, xyz individually represents strings or rather substrings which we
compute over conditions to check the regularity of the language.
10. Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must contain
more than one item.
a) Pumping lemma
b) Pigeon Hole principle
c) Count principle
d) None of the mentioned
View Answer
Answer: b
Explanation: Pigeon hole principle states the following example: If there exists n=10 pigeons in m=9
holes, then since 10>9, the pigeonhole principle says that at least one hole has more than one
pigeon
1. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be ____________
under an operation op.
a) open
b) closed
c) decidable
d) none of the mentioned
View Answer
Answer: b
Explanation: If two regular languages are closed under an operation op, then the resultant of the
languages over an operation op will also be regular.
2. Suppose a regular language L is closed under the operation halving, then the result would be:
a) 1/4 L will be regular
b) 1/2 L will be regular
c) 1/8 L will be regular
d) Al of the mentioned
View Answer
Answer: d
Explanation: At first stage 1/2 L will be regular and subsequently, all the options will be regular.
Answer: a
Explanation: Regular language is closed under complement operation. Thus, if L1′ and L2′ are regular
so are L1 and L2. And if L1 and L2 are regular so is L1.L2.
Answer: a
Explanation: If L1 is regular, so is L1′ and if L1′ and L2′ are regular so is L1′ U L2′. Further, regular
languages are also closed under intersection operation.
Answer: a
Explanation: If A and B are regular languages, then A Ç B is a regular language and A ∩ B is
equivalent to !(A’ U B’).
6. Which among the following are the boolean operations that under which regular languages are
closed?
a) Union
b) Intersection
c) Complement
d) All of the mentioned
View Answer
Answer: d
Explanation: Regular languages are closed under the following operations:
a) Regular expression operations
b) Boolean operations
c) Homomorphism
d) Inverse Homomorphism
7. Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product construction
method, we have a machine M that accepts L1 ∩ L2. The total number of states in M:
a) 6
b) 4
c) 2
d) 8
View Answer
Answer: 4
Explanation: M is defined as: (Q, S, d, q0, F)
where Q=Q1*Q2 and F=F1*F2
Answer: a
Explanation: (L’)’ is equivalent to L and L U L is subsequently equivalent to L.
Answer: a
Explanation: If L is regular so is its complement, if L’ is regular so is its reverse, if (L’)r is regular so is
its Kleene.
10. Which among the following is the closure property of a regular language?
a) Emptiness
b) Universality
c) Membership
d) None of the mentioned
View Answer
Answer: d
Explanation: All the following mentioned are decidability properties of a regular language. The
closure properties of a regular language include union, concatenation, intersection, Kleene,
complement , reverse and many more operations.
Answer: d
Explanation: Lr, L’, L* i.e. reversal, complementation and kleene all are the closure properties of
regular language.
3. If E=F+G;
Er=?
a) Fr+Gr
b) (F+G)r
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: If E is a symbol a, e, or f, then Er=E. Other inductive properties include union of
reversals, concatenation and Kleene.
4. If E= FG, Er=?
a) FrGr
b) GrFr
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: b
Explanation: If E= FG, Er=GrFr . Example: (01*)R=(1*)R(0)R
Answer: a
Explanation: 01*+10*
ER=(01*)R+(10*)R=>(1*)R0R+(0*)R1R=>1*0+0*1
6. Which of the following obey the closure properties of Regular language?
a) Homomorphism
b) Inverse Homomorphism
c) Reversal
d) All of the mentioned
View Answer
Answer: d
Explanation: Homomorphism on an aphabet is a function that gives a string for each symbol in that
alphabet. Example: h(0)=ab, etc.
Answer:
abe*+e(ab)*(Using the identities e=e*, eE=Ee=E)
=ab+(ab)*=> ab will contain inside (ab)*, thus =>(ab)*.
Answer: b
Explanation: h-1(L) is the language with two 0’s and any number of 1’s=>(1*01*01*).
9. While proving Inverse Homomorphism, which of the following steps are needed?
a) Start with a DFA Ain L
b) Construct a DFA B for h-1(L)
c) The set of states, initial and final states should be same.
d) All of the mentioned
View Answer
Answer: d
Explanation: While constructing DFA B, we need to take care of the following:
a) The same set of states
b) The same start state
c) The same final state
d) Input alphabet = the symbols to which homomorphism h applies.
Answer: b
Explanation: Let h be a homomorphism and L a language whose alphabet is the output language of
h.
h-1(L) = {w | h(w) is in L}.
Answer: d
Explanation: Each of the four formats of representation of the regular language be it, DFA, NFA,
Regular Expression or e-NFA can be converted to the rest three forms.
Answer: b
Explanation: We must search from each of the n states along all arcs labelled e. If there are n states,
there can be no more than n2 states.
3. For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).
a) n
b) n1/2
c) n2
d) 2n
View Answer
Answer: a
Explanation: The conversion DFA to NFA is simple, and takes O(n) time on an n-state DFA.
4. With reference to Automaton to Regular Expression Conversion, for each of the n rounds, where n
is the number of states of DFA, we can _________ the size of the regular expression constructed.
a) double
b) triple
c) quadruple
d) none of the mentioned
View Answer
Answer: c
Explanation: We can quadruple the size of the regular expression per round. Thus, we can simply
write n3 expressions can take time O(n34n), where n =number of states of the DFA.
Answer: a
Explanation: It is possible to parse the expression efficiently, using a technique that takes only O(n)
time on a expression of length n3.
Answer: a
Explanation: We can eliminate e-transitions from an n state epsilon-NFA to build an ordinary NFA in
O(n3) time, without changing the number of states.Next, producing to DFA can take exponential
time.
Answer: d
Explanation: Each of the following can expressed in terms of ordinary NFA with different time
complexities.
Answer: a
Explanation: Powerset or subset construction method is a standard method for converting a non
deterministic finite automata into DFA which recognizes the same formal language.
Answer: b
Explanation: There exists subsequent steps like formation of epsilon-NFA and NFA before the
formation of corresponding DFA.
Answer: a
Explanation: Thompson’s Construction is used to find out a Finite Automaton from a Regular
Expression. We will reduce the regular expression into smallest regular expressions and convert
them to NFA and finally to DFA.
Answer: c
Explanation: A decision property of a language class is an algorithm that takes a formal description of
a language(e.g., a DFA) and tells whether or not some property holds.
Answer: d
Explanation: Emptiness, Infiniteness and Membership are the decision properties of any language
class. Example: Is the language L empty? Or Is w, a string belongs to the regular language L?
3. Pick the odd one out of the given properties of a regular language:
a) Kleene
b) Reversal
c) Homomorphism
d) Membership
View Answer
Answer: d
Explanation: Membership is a decision property of language class while others mentioned like
Kleene, Reversal and Homomorphism are Closure properties of language class.
4. For an automata, which of the following are equivalent variants?
DFA,NFA and NFA with epsilon transitions
a) DFA and NFA
b) NFA and epsilon NFA
c) DFA and epsilon NFA
d) All of the mentioned
View Answer
Answer: d
Explanation: For a given automata, all the formats of representation be it deterministic finite
automata or non deterministic finite automata or non deterministic finite automata with epsilon
transitions, all are equivalent variants.
Answer: d
Explanation: It is possible to convert from one specification to another. We can express a regular
language in all the given four variants.
Answer: d
Explanation: To give a solution to the mentioned problems, we require decision properties and for
some, we need additional tools like minimized automaton and Pumping lemma.
Answer: c
Explanation: Using closure properties we can give a=solution to many problems like :
Is the regular languages L1 and L2 closed on concatenation operation?, etc.
8. Suppose there is a string w=abbab, and there exists a DFA which accepts w. How many stepts will
be required to test its membership?
a) 2
b) 1
c) 4
d) None of the mentioned
View Answer
Answer: If a string belongs to a language, the number of steps required to test that member ship is
equal to the length of string i.e. 5.
9. If a DFA has n states and the language contains any string of length n or more, the language is
termed as:
a) Infinite
b) Empty
c) Non regular
d) None of the mentioned
View Answer
Answer: The language is surely finite if it is limited to string of length n or less. This is because there
are atleast n+1 states along the path while traversing w(string).
Answer: a
Answer: c
Explanation: The entity which accepts a language is termed as Automata while the one which
generates it is called Grammar. Tokens are the smallest individual unit of a program.
Answer: c
Explanation: Context Sensitive Language or Type 1 or Linearly Bounded Non deterministic Language
has the production rule where the production is context dependent i.e. aAb->agb.
Answer: d
Explanation: Every regular language can be produced by context free grammar and context free
language can be produced by context sensitive grammar and so on.
Answer: b
Explanation: G=(V, ∑, p, S), here V=Finite set of variables, ∑= set of terminals, p= finite productions,
S= Starting Variable.
Answer: d
Explanation: There exists no finite automata to accept the given language i.e. 0n1n. For other options,
it is possible to make a dfa or nfa representing the language set.
Answer: c
Explanation: According to the definition, the starting variable can produce another variable or any
terminal or a variable which leads to terminal.
7. For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?
a) Non regular language
b) 0n1n | n>=0
c) 0n1n | n>=1
d) None of the mentioned
View Answer
Answer: d
Explanation: L={e, 01, 0011, 000111, ……0n1n }. As epsilon is a part of the set, thus all the options are
correct implying none of them to be wrong.
Answer: c
Explanation: The grammar which produces a palindrome set can be written as:
S-> aSa | bSb | e | a | b
L={e, a, b, aba, abbbaabbba…..}
Answer: a
Explanation: Regular grammar is a subset of context free grammar and thus all regular grammars are
context free.
Answer: a
Explanation: A context free grammar G is ambiguous if there is atleast one string in L(G) which has
two or more distinct leftmost derivations
Answer: d
Explanation: The following are the notions to express Context free grammars:
a) Recursive Inferences
b) Derivations
c) Sentential form
d) Parse trees
Answer: a
Explanation: We apply the productions of CFG to infer that certain strings are in the language of a
certain variable.
Answer: c
Explanation: Two inference approaches:
1. Recursive inference, using productions from body to head
2. Derivations, using productions from head to body
4. 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 mentioned
View Answer
Answer: d
Explanation: Parse trees are an alternative representation to derivations and recursive inferences.
There can be several parse trees for the same string.
Answer: a
Explanation: Yes, they are equivalent. Both the terminologies represent the two approaches of
recursive inferencing.
6. A->aA| a| b
The number of steps to form aab:
a) 2
b) 3
c) 4
d) 5
View Answer
Answer: b
Explanation: A->aA=>aaA=>aab
7. An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such
that a change in those could make the expression correct.
L(G)={w in T*|S→*w}
a) 0 Errors
b) 1 Error
c) 2 Error
d) Invalid Expression
View Answer
Answer: a
Explanation: For the given expression, L(G)={w in T*|S→*w}, If G(V, T, P, S) is a CFG, the language of
G, denoted by L(G), is the set of terminal strings that have derivations from the start symbol.
Answer: b
Explanation: Push down automata accepts context free language.
9. Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00
a) {0a1b|a=2,b=3}
b) {0a1b|a=1,b=5}
c) {0a1b|a=b}
d) More than one of the mentioned is correct
View Answer
Answer: a
Explanation: Using the recursive approach, we can conclude that option a is the correct answer, and
its not possible for a grammar to have more than one language.
a) true
b) partially true
c) false
d) none of the mentioned
View Answer
Answer: a
Explanation: We apply the productions of a CFG to infer that certain strings are in a language of
certain variable.
Answer: b
Explanation: Both the statements are false. Recursive Inference, using productions from body to
head. Derivations, using productions from head to body.
13. Which of the following statements are correct for a concept called inherent ambiguity in CFL?
a) Every CFG for L is ambiguous
b) Every CFG for L is unambiguous
c) Every CFG is also regular
d) None of the mentioned
View Answer
Answer: a
Explanation: A CFL L is said to be inherently ambiguous if every CFG for L is ambiguous.
Answer: a
1. State true or false:
Statement: Every right-linear grammar generates a regular language.
a) True
b) False
View Answer
Answer: a
Explanation: A CFG is said to right linear if each production body has at most one variable, and that
variable is at the right end. That is, all productions of a right linear grammar are of the form A->wB
or A->w, where A and B are variables while w is some terminal.
Answer: c
Explanation: Using the derivation approach, we can conclude that the given grammar produces a
language with a set of string which have equal number of a’s and b’s.
3. If L1 and L2 are context free languages, which of the following is context free?
a) L1*
b) L2UL1
c) L1.L2
d) All of the mentioned
View Answer
Answer: d
Explanation: The following is a theorem which states the closure property of context free languages
which includes Kleene operation, Union operation and Dot operation.
4. For the given Regular expression, the minimum number of variables including starting variable
required to derive its grammar is:
(011+1)*(01)*
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: c
Explanation: The grammar can be written as:
S->BC
B->AB|ε
A->011|1
C->DC|ε
D->01
5. For the given Regular expression, the minimum number of terminals required to derive its
grammar is:
(011+1)*(01)*
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: b
Explanation: The grammar can be written as:
S->BC
B->AB|ε
A->011|1
C->DC|ε
D->01
6. A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC
B->a
a) Ambiguous
b) Regular
c) Non Regular
d) None of the mentioned
View Answer
Answer: b
Explanation: The following format of grammar is of Regular grammar and is a part of Context free
grammar i.e. like a specific form whose finite automata can be generated.
Answer: c
Explanation: We can build context free grammar through different approaches, recursively defining
the variables and terminals inorder to fulfil the conditions.
8. Which of the following languages are most suitable for implement context free languages ?
a) C
b) Perl
c) Assembly Language
d) None of the mentioned
View Answer
Answer: a
Explanation: The advantage of using high level programming language like C and Pascal is that they
allow us to write statements that look more like English.
9. Which among the following is the correct grammar for the given language?
L={x∈{0,1}*|number of zeroes in x¹number of one’s in x}
a) S-> 0|SS|1SS|SS1|S1S
b) S-> 1|0S|0SS|SS0|S0S
c) S-> 0|0S|1SS|SS1|S1S
d) None of the mentioned
View Answer
Answer: c
Explanation: L={0, 1, 00, 11, 001, 010,…}
The grammar can be framed as: S-> 0|0S|1SS|SS1|S1S
Answer: a
1. The most suitable data structure used to represent the derivations in compiler:
a) Queue
b) Linked List
c) Tree
d) Hash Tables
View Answer
Answer: c
Explanation: The tree, known as “Parse tree” when used in a compiler, is the data structure of choice
to represent the source program.
Answer: a
Explanation: A node has atmost one parent, drawn above the node, and zero or more children
drawn below. Lines connect parents to children. There is one node, one root, that has no parent; this
node appears to be at the top of the tree. Nodes with no children are called leaves. Nodes that are
not leaves are called interior nodes.
Answer: a
Explanation: The children of a node are ordered from the left and drawn so. If N is to the left of node
M, then all the descendents of N are considered to be to the left of all the descendents of M.
Answer: d
Explanation: The root is labelled by the start symbol. All the leaves are either labelled by a a terminal
or with e.
5. For the expression E*(E) where * and brackets are the operation, number of nodes in the
respective parse tree are:
a) 6
b) 7
c) 5
d) 2
View Answer
Answer: b
Explanation:
6. The number of leaves in a parse tree with expression E*(E) where * and () are operators
a) 5
b) 2
c) 4
d) 3
View Answer
Answer: a
Explanation:
7. Which of the following does the given parse tree correspond to?
a) P->1100
b) P->0110
c) P->1100ε
d) P->0101
View Answer
Answer: b
Explanation: The following is a parse tree for the production 0110 over {0,1}*.
Answer: c
Explanation: In order to graphically represent a derivation of a grammar we need to use parse trees.
Answer: Parser or syntax analyzer is the one responsible for checking the grammar and reporting
errors. In this phase, parse tree is generated and syntax is analyzed.
Answer: a
Explanation: A symbol X is generating if there exists : X->*w for some w that belongs to T*.
Also, a symbol can never be context free.
Answer: c
Explanation: For a symbol X to be useful, it has to be both reachable and generating i.e.
S->* aXb -> * w where w belongs to T*.
4. Given Checklist:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) Normal form for production is violated
Is it possible for the grammar G to be in CNF with the following checklisy ?
a) Yes
b) No
View Answer
Answer: b
Explanation: The grammar is not in CNF if it violates the normal form of the productions which is
strictly restricted.
Answer: a
Explanation: It is the parse tree theorem which states:
Given: Suppose we have a parse tree for a string w, according to a CNF grammar, G=(V, T, P, S). Let h
be the height of the parse tree. Now, Implication: |w|<=2h-1.
Answer: b
Explanation: It is the basic implication of Parse tree theorem (assuming CNF). If the height of the
parse tree is h, then |w| <=2h-1.
7. If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________ structure
of w.
a) semantic
b) syntactic
c) lexical
d) all of the mentioned
View Answer
Answer: b
Explanation: A parse tree or concrete syntactic tree is an ordered, rooted tree that represents the
syntactic structure of a string according to some context free grammar.
Answer: c
Explanation: Both of the mentioned are different from parse trees. Sentence diagrams are pictorial
representations of grammatical structure of a sentence.
Answer: a
Explanation: Ideally, there should be only one parse tree for each string, i.e. the language should be
unambiguous.
Answer: a
Explanation: It is also true that multiple leftmost or rightmost derivations do cause ambiguity.
Unfortunately, it is not possible to remove the ambiguity always.
Answer: b
Explanation: Parsing is required to check the acceptability of a string. Further, comes the syntactical
phase which is taken care by other phases of compiler.
2. Which of the following parser reaches the root symbol of the tree at last?
a) Top down parser
b) Bottom up parser
c) TOP down and Bottom up parser
d) None of the mentioned
View Answer
Answer: b
Explanation: Bottom up parser starts from the bottom with the string and comes up to the start
symbolusing a parse tree or a derivation tree.
Answer: c
Explanation: It is a hybrid method which works bottom up along the left edges of each subtree, and
top down on the rest of the parse tree.
Answer: b
Explanation: Bottom up parsing is done by shift reduce parsers like LALR parsers, Operator
precedence parsers, simple precedence parsers, etc.
Answer: d
Explanation: The mentioned are the correct and proper functions of a shift reduce parsers. The
parsing methods are most commonly used for parsing programming languages, etc.
Answer: b
Explanation: It is exactly the opposite case where LALR parsers uses mutually recursive functions
instead of tables. It is a simplified version of canonical left to right parser.
7. LALR in LALR parser stands for:
a) Left aligned left right parser
b) Look ahead left to right parser
c) Language Argument left to right parser
d) None of the mentioned
View Answer
Answer:
Explanation: LALR stands for Look ahead left to right parsers. It has more language recognition
power than LR(0) parser.
Answer: c
Explanation: YACC is a computer code for UNIX operating system which generates a LALR parser. On
the other hand GNU Bison or Bison can generate LALR and GLR parsers.
Answer: d
Explanation: All the following mentioned are top down parsers and begin their operation from the
starting symbol.
Answer: c
Explanation: Predictive parsing is possible only for the class of LL-grammars, which are the CFG for
which there exists some positive integer k that allows a recursive descent parser to decide which
production to use by examining only the next k tokens of input.
Answer: c
Explanation: YACC stands for ‘Yet another compiler compiler’ and it was developed by Stephen
Johnson in B programming language later translated to C.
Answer: b
Explanation: The YACC takes C code as input and produces shift reduce parsers in C,also known as
Bottom up parsers which execute C snippets with the associated rule.
Answer: a
Explanation: LALR parser generator is software tool that reads a BNF grammar and creates a LALR
parser which is capable of parsing files written in programming language identified by BNF grammar.
Answer: c
Explanation: Stephen Johnson wrote this parser generator in B programming language which was
further modified and written in C, JAVA, Python, etc.
Answer: d
Explanation: B was programming language designed by Dennis Ritchie and Ken Thompson for
recursive, non numeric, system and language softwares. It was a typeless language, everything is a
word.
Answer: b
Explanation: The normal form used in Data base normalization is BCNF i.e. Boyce Codd normal form
and NOT Backus Naur Form.
Answer: a
Explanation: BNF is a metasyntax used to express context free grammar, moreover a formal way to
express the language.
Answer: d
Explanation: W grammar or van Wijngaarden form is used to define potentially infinite context free
grammars in a finite number of rules. It is an example of larger class of affix grammars. This
technique was used to define the P/L Algol 68.
10. Which of the following version of Unix came up with YACC first?
a) V3
b) V5
c) CB UNIX
d) Unix-RT
View Answer
Answer: a
Explanation: Yacc appeared in version 3 of unix, though full description was published by 1975
1. A CFG is ambiguous if
a) It has more than one rightmost derivations
b) It has more than one leftmost derivations
c) No parse tree can be generated for the CFG
d) None of the mentioned
View Answer
Answer: b
Explanation: A context free grammar is ambiguous if it has more than one parse tree generated or
more than one leftmost derivations. An unambiguous grammar is a context free grammar for which
every valid string has a unique leftmost derivation.
Answer: a
Explanation: Deterministic CFGs are always unambiguous , and are an important subclass of
unambiguous CFGs; there are non-deterministic unambiguous CFGs, however.
Answer: d
Explanation: The closure property of a context free grammar does not include iteration or kleene or
star operation.
Answer: a
Explanation: Dangling else problem: In many languages,the else in an if-then-else statement is
optional, which results into nested conditionals being ambiguous, at least in terms of the CFG.
Answer: a
Explanation: A context free language for which no unambiguous grammar exists, is called Inherent
ambiguous language.
Answer: b
Explanation: This set is context-free, since the union of two context-free languages is always context
free.
Answer: a
Explanation: The production can be either itself or an empty string. Thus the empty string has more
than one leftmost derivations, depending on how many times R->R is being used.
9. In context to ambiguity, the number of times the following programming statement can be
interpreted as:
Statement: if R then if T then P else V
a) 2
b) 3
c) 4
d) 1
View Answer
Answer: a
Explanation: Dangling else problem
if R then (if T then P else V) and if R then (if T then P) else V are the two ways in which the given if
else statement can be parsed.
Answer: CYK algorithm parses the CFG in polynomial time while LR parsers do the same in linear
time. DCFGs are accepted by DPDAs and parsed using LR parsers or CYK algorithm.
Answer: d
Explanation: A push down automata uses a stack to carry out its operations. They are more capable
than the finite automatons but less than the turing model.
Answer: a
Explanation: The term pushdown refers to the fact that the elements are pushed down in the stack
and as per the LIFO principle, the operation is always performed on the top element of the stack.
3. Which of the following allows stacked values to be sub-stacks rather than just finite symbols?
a) Push Down Automaton
b) Turing Machine
c) Nested Stack Automaton
d) None of the mentioned
View Answer
Answer: c
Explanation: In computational theory, a nested stack automaton is a finite automaton which makes
use of stack containing data which can be additional stacks.
4. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n.
a) 5
b) 8
c) 4
d) 10
View Answer
Answer: d
Explanation: The 10-tuple can be stated as: NSA= ‹Q,Σ,Γ,δ,q0,Z0,F,[,],]›.
Answer: b
Explanation: Push down automata is for Context free languages and they are termed as Type 2
languages according to Chomsky hierarchy.
6. The class of languages not accepted by non deterministic, nonerasing stack automata is _______
a) NSPACE(n2)
b) NL
c) CSL
d) All of the mentioned
View Answer
Answer: d
Explanation: NSPACE or non deterministic space is the computational resource describing the
memory space for a non deterministic turing machine.
7. A push down automaton with only symbol allowed on the stack along with fixed symbol.
a) Embedded PDA
b) Nested Stack automata
c) DPDA
d) Counter Automaton
View Answer
Answer: d
Explanation: This class of automata can recognize a set of context free languages like {anbn|n
belongs to N}
Answer: a, d
Explanation: Push and pop are the operations we perform to operate a stack. A stack follows the
LIFO principle, which states its rule as: Last In First Out.
Answer: c
Explanation: When we reach the acceptance state and find the stack to be empty, we say, the string
has been accepted by the push down automata.
10. The following move of a PDA is on the basis of:
a) Present state
b) Input Symbol
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: c
Explanation: The next operation is performed by PDA considering three factors: present
state,symbol on the top of the stack and the input symbol.
1. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called
a) Complement
b) Union
c) Disjoint
d) Connected
View Answer
Answer: c
Explanation: Two sets are called disjoint if they have no elements in common i.e. RÇT=Æ.
2. Which among the following is not a part of the Context free grammar tuple?
a) End symbol
b) Start symbol
c) Variable
d) Production
View Answer
Answer: a
Explanation: The tuple definition of context free grammar is: (V, T, P, S) where V=set of variables,
T=set of terminals, P=production, S= Starting Variable.
Answer: c
Explanation: Context free grammar is the set which belongs to the set of context free grammar.
Similarly, Regular grammar is a set which belongs to the the set of Context free grammar.
Answer: b
Explanation: Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing
machines use Queue for the same.
Answer: c
Explanation: Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing
machines use Queue for the same.
Answer: c
Explanation: A linearly bounded automata is a restricted non deterministic turing machine which is
capable of accepting ant context free grammar.
Answer: a
Explanation: Null production is always taken as a string in computational theory.
9. The context free grammar which generates a Regular Language is termed as:
a) Context Regular Grammar
b) Regular Grammar
c) Context Sensitive Grammar
d) None of the mentioned
View Answer
Answer: b
Explanation: Regular grammar is a subset of Context free grammar. The CFGs which produces a
language for which a finite automaton can be created is called Regular grammar.
Answer: a
Explanation: NPDA stands for non-deterministic push down automata whereas DPDA stands for
deterministic push down automata.
1. The production of the form A->B , where A and B are non terminals is called
a) Null production
b) Unit production
c) Greibach Normal Form
d) Chomsky Normal Form
View Answer
Answer: b
Explanation: A->ε is termed as Null production while A->B is termed as Unit production.
Answer: a
Explanation: Halting states are the new tuple members introduced in turing machine and is of two
types: Accept Halting State and Reject Halting State.
Answer: d
Explanation: z0 is the initial stack symbol, is an element of G. Other symbols like d represents the
transition function of the machine.
5. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
a) Moves
b) transition function
c) or/not symbol
d) none of the mentioned
View Answer
Answer: a
Explanation: Using this notation, we can define moves and further acceptance of a string by the
machine.
Answer: a
Explanation: If M is a DPDA accepting L by an empty stsck, R and T are distinct strings in L, and R is a
prefix of T, then the sequence of moves M must make in order to accept R leaves the stack empty,
since R∈L. But then T cannot be accepted, since M cant move with an empty stack.
Answer: d
Explanation: Theorem: The language pal of palindromes over the alphabet {0,1} cannot be accepted
by any finite automaton , and it is therefore not regular.
8. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form
of __________
a) A
b) AnZ0, n>=0
c) Z0An, n>=0
d) None of the mentioned
View Answer
Answer: b
Explanation:The possible change in the stack contents is a change in the number of A’s on the stack.
Answer: a
Explanation: The PDA works as follows. Instead of saving excess 0’s or 1’s on the stack, we save *’s
and use two different states to indicate which symbol there is currently a surplus of. The state q0 is
the initial state and the only accepting state.
Answer: d
Explanation: A string is said to be balanced if it consist of equal number of 0’s and 1’s.
Answer: d
Explanation: The instantaneous description of a PDA is represented by 3 tuple:
(q,w,s)
where q is the state, w is the unconsumed input and s is the stack content.
Answer: a
Explanation: A turnstile notation is used for connecting pairs od ID’s taht represents one or many
moves of a PDA.
a) {0n1n|n>=0}
b) {0n12n|n>=0}
c) {02n1n|n>=0}
d) None of the mentioned
View Answer
Answer: a
a) {wwr|w=(a+b)*}
b) ε is called the initial stack symbol
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: Initially we put a special symbol ‘#’ into the empty stack. At state q1, the w is being
read. In state q2, each 0 or 1 is popped when it matches the input. If any other input is given, the
PDA will go to a dead state. When we reach that special symbol ‘#’, we go to the accepting state q3.
Answer: d
Explanation:
All the assertions mentioned are theorems or corollary.
Answer: d
Explanation: Yes, a PDA can be represented using a transition diagram, transition table and an
instantaneous description.
Answer: a
Explanation: Push down automata is the automaton machine for all the context free grammar or
Type 2 languages.
Answer: c
Explanation: Geraud proved the equivalence problem decidable for Deterministic PDA .
9. Which of the following are the actions that operates on stack top?
a) Pushing
b) Popping
c) Replacing
d) All of the mentioned
View Answer
Answer: d
Explanation: Push, pop and replace are all the basic and only operations that takes place on stack
top.
10. A push down automata is said to be _________ if it has atmost one transition around all
configurations.
a) Finite
b) Non regular
c) Non-deterministic
d) Deterministic
View Answer
Answer: d
Explanation: DPDA or Deterministic Push down automata has atmost one transition applicable to
each configuration.
1. The transition a Push down automaton makes is additionally dependent upon the:
a) stack
b) input tape
c) terminals
d) none of the mentioned
View Answer
Answer: a
Explanation: A PDA is a finite machine which has an additional stack storage. Its transitions are based
not only on input and the correct state but also on the stack.
Answer: a
Explanation: A machine configuration is an element of K×Σ*×Γ*.
(p,w,γ) = (current state, unprocessed input, stack content).
Answer: b
Explanation: A string w is accepted by a PDA if and only if (s,w, e) |-* (f, e, e)
4. With reference of a DPDA, which among the following do we perform from the start state with an
empty stack?
a) process the whole string
b) end in final state
c) end with an empty stack
d) all of the mentioned
View Answer
Answer: d
Explanation: The empty stack in the end is our requirement relative to finite state automatons.
Answer: a
Explanation: A Deterministic Push Down Automata is a Push Down Automata in which no state p has
two or more transitions.
Answer: a
Explanation: There exists two lemma’s such that:
a) Given a grammar G, construct the PDA and show the equivalence
b) Given a PDA, construct a grammar and show the equivalence
7. If the PDA does not stop on an accepting state and the stack is not empty, the string is:
a) rejected
b) goes into loop forever
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: a
Explanation: To accept a string, PDA needs to halt at an accepting state and with a stack empty, else
it is called rejected. Given a PDA M, we can construct a PDA M’ that accepts the same language as M,
by both acceptance criteria.
8. A language accepted by Deterministic Push down automata is closed under which of the
following?
a) Complement
b) Union
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: Deterministic Context free languages(one accepted by PDA by final state), are
drastically different from the context free languages. For example they are closed under
complementation and not union.
Answer: a
Explanation: JFLAP is a software for experimenting with formal topics including NFA, NPDA, multi-
tape turing machines and L-systems.
Answer: a
Explanation: The linear encodings of languages accepted by finite nested word automata gives the
class of ‘visibly pushdown automata’.
Theory of Computation -MCQs
1. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
a) reflexive
b) transitive
c) symmetric
d) reflexive and transitive
Answer: d
Explanation: A partially ordered relation refers to one which is Reflexive, Transitive and
Antisymmetric.
2. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} |
where string s contains even number of 0 and 1
a) 01,0011,010101
b) 0011,11001100
c) ε,0011,11001100
d) ε,0011,11001100
Answer: b
Explanation: The Kleene star of A, denoted by A*, is the set of all strings obtained by
concatenating zero or more strings from A.
3. A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages
using the operation
a) Union
b) Concatenation
c) Kleene*
d) All of the mentioned
Answer: d
Explanation: Union, Intersection, Concatenation, Kleene*, Reverse are all the closure
properties of Regular Language.
4. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be its
states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
a) Statement 1 is false but Statement 2 and 3 are correct
b) Statement 1 and 2 are correct while 3 is wrong
c) None of the mentioned statements are correct
d) All of the mentioned
Answer: d
Explanation: It is possible to represent a finite automaton graphically, with nodes for states,
and arcs for transitions.
5. The minimum number of states required to recognize an octal number divisible by 3 are/is
a) 1
b) 3
c) 5
d) 7
Answer: b
Explanation: According to the question, minimum of 3 states are required to recognize an
octal number divisible by 3.
7. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the
infinite input tape is ______________
a) Compiler
b) Interpreter
c) Loader and Linkers
d) None of the mentioned
Answer: a
Explanation: A Compiler is used to give a finite solution to an infinite phenomenon. Example
of an infinite phenomenon is Language C, etc.
8. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and
∑={0,1} is_________
a) 7
b) 6
c) 8
d) 5
Answer: a
Explanation: ∑r= {1,0} and a Kleene* operation would lead to the following
set=COUNT{ε,0,1,00,11,01,10} =7.
9. For the following change of state in FA, which of the following codes is an incorrect option?
a) δ (m, 1) =n
b) δ (0, n) =m
c) δ (m,0) =ε
d) s: accept = false; cin >> char;
if char = “0” goto n;
Answer: b
Explanation: δ(QX∑) = Q1 is the correct representation of change of state. Here, δ is called
the Transition function.
10. Given: ∑= {a, b}
L= {xϵ∑*|x is a string combination}
∑4 represents which among the following?
Answer: b
Explanation: ∑* represents any combination of the given set while ∑x represents the set of
combinations with length x where x ϵ I.
11. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are _____________
a) reflexive
b) transitive
c) symmetric
d) reflexive and transitive
Answer: d
Explanation: A partially ordered relation refers to one which is Reflexive, Transitive and
Antisymmetric.
12. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} |
where string s contains even number of 0 and 1
a) 01,0011,010101
b) 0011,11001100
c) ε,0011,11001100
d) ε,0011,11001100
Answer: b
Explanation: The Kleene star of A, denoted by A*, is the set of all strings obtained by
concatenating zero or more strings from A.
13. A regular language over an alphabet ∑ is one that cannot be obtained from the basic languages
using the operation
a) Union
b) Concatenation
c) Kleene*
d) All of the mentioned
Answer: d
Explanation: Union, Intersection, Concatenation, Kleene*, Reverse are all the closure
properties of Regular Language.
14. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be
its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
a) Statement 1 is false but Statement 2 and 3 are correct
b) Statement 1 and 2 are correct while 3 is wrong
c) None of the mentioned statements are correct
d) All of the mentioned
Answer: d
Explanation: It is possible to represent a finite automaton graphically, with nodes for states,
and arcs for transitions.
15. The minimum number of states required to recognize an octal number divisible by 3 are/is
a) 1
b) 3
c) 5
d) 7
Answer: b
Explanation: According to the question, minimum of 3 states are required to recognize an
octal number divisible by 3.
17. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to the
infinite input tape is ______________
a) Compiler
b) Interpreter
c) Loader and Linkers
d) None of the mentioned
Answer: a
Explanation: A Compiler is used to give a finite solution to an infinite phenomenon. Example
of an infinite phenomenon is Language C, etc.
18. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and
∑={0,1} is_________
a) 7
b) 6
c) 8
d) 5
Answer: a
Explanation: ∑r= {1,0} and a Kleene* operation would lead to the following
set=COUNT{ε,0,1,00,11,01,10} =7.
9. For the following change of state in FA, which of the following codes is an incorrect option?
a) δ (m, 1) =n
b) δ (0, n) =m
c) δ (m,0) =ε
d) s: accept = false; cin >> char; if char = “0” goto n;
Answer: b
Explanation: δ(QX∑) = Q1 is the correct representation of change of state. Here, δ is called
the Transition function.
“Moore Machine”.
21. Moore Machine is an application of:
a) Finite automata without input
b) Finite automata with output
c) Non- Finite automata with output
d) None of the mentioned
Answer: b
Explanation: Finite automaton with an output is categorize din two parts: Moore M/C and
Mealy M/C.
23. For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
a) |Input|+1
b) |Input|
c) |Input-1|
d) Cannot be predicted
Answer: a
Explanation: Initial state, from which the operations begin is also initialized with a value.
25. The total number of states and transitions required to form a moore machine that will produce
residue mod 3.
a) 3 and 6
b) 3 and 5
c) 2 and 4
d) 2 and 5
Answer: a
Explanation:
26. Complete the given table according to the given Moore machine.
Present State
Next State
Output
0
1
Q0
Q1
Q2
1
Q1
Q2
1
Q2
Q0
a) Q0, Q2, 0
b) Q0, Q2, 1
c) Q1, Q2, 1
d) Q1, Q0, 0
Answer: a
Explanation: The table can be filled accordingly seeing the graph.
29. The O/P of Moore machine can be represented in the following format:
a) Op(t)=δ(Op(t))
b) Op(t)=δ(Op(t)i(t))
c) Op(t): ∑
d) None of the mentioned
Answer: a
Explanation: Op(t)=δ(Op(t)) is the defined definition of how the output is received on giving
a specific input to Moore machine.
Answer: b
Explanation: Bounded information refers to one whose output is limited and it cannot be
said what were the recorded outputs previously until memorized.
Answer: b
Explanation: A language for which there is no existence of a deterministic finite automata is
always Non Regular and methods like Pumping Lemma can be used to prove the same.
Answer: d
Explanation: A DFA can be represented in the following formats: Transition Graph,
Transition Table, Transition tree/forest/Any programming Language.
4. What the following DFA accepts?
Answer: a
Explanation: Strings such as {1101,101,10101} are being accepted while {1001,11001} are
not. Thus, this conclusion leads to option a.
Answer: c
Explanation: Two states are said to be equivalent if and only if they have same number of
states as well as transitions.
Answer: c
Explanation: The figure represents the initial as well as the final state with an iteration of x.
a) ababaabaa
b) abbbaa
c) abbbaabb
d) abbaabbaa
Answer: a
Explanation: All the Strings are getting accepted except ‘ababaabaa’ as it is directed to
dumping state. Dumping state also refers to the reject state of the automata.
8. Which of the following will the given DFA won’t accept?
a) ε
b) 11010
c) 10001010
d) String of letter count 11
Answer: a
Explanation: As the initial state is not made an acceptance state, thus ε will not be accepted
by the given DFA. For the automata to accept ε as an entity, one should make the initial state
as also the final state.
Answer: b
Explanation: Language to accept a palindrome number or string will be non-regular and
thus, its DFA cannot be obtained. Though, PDA is possible.
10. Which of the following is not an example of finite state machine system?
a) Control Mechanism of an elevator
b) Combinational Locks
c) Traffic Lights
d) Digital Watches
Answer: d
Explanation: Proper and sequential combination of events leads the machines to work in
hand which includes The elevator, Combinational Locks, Traffic Lights, vending machine, etc.
Other applications of Finite machine state system are Communication Protocol Design,
Artificial Intelligence Research, A Turnstile, etc.
Answer: a
Explanation: For a string of n characters with no repetitive substrings, the number of states
required to pass the string is n+1.
Answer: b
Explanation: The Language can be anonymously checked and thus the answer can be
predicted. The language needs to be accepted by the automata (acceptance state) in order to
prove its regularity.
3. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A) can be
represented as:
a) {Hello, World, Input, Output, ε}
b) {Hello, World, ε}
c) {Input, Output, ε}
d) {}
Answer: d
Explanation: Union operation creates the universal set by combining all the elements of first
and second set while intersection operation creates a set of common elements of the first
and the second state.
4. Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization
of DFA?
a) 3
b) 2
c) 1
d) 4
Answer: b
Explanation: Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA.
5. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states
in DFA would be required?
a) 3
b) 2
c) 22
d) 27
Answer: a
Explanation:
Answer: d
Explanation: The string a state receives is the combination of all input alphabets which lie
across the path covered.
7. Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.
Which of the following property satisfy the regularity of the given language?
a) Regularity is dependent upon the length of the string
b) Regularity is not dependent upon the length of the string
c) Can’t be said for a particular string of a language
d) It may depend on the length of the string
Answer: b
Explanation: DFA can be made for infinite language with an infinite length. Thus,
dependency over length is unfruitful.
8. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?
a) Yes
b) No
Answer: b
Explanation: It is not possible to have a count of equal number of 0 and 1 at any instant in
DFA. Thus, It is not possible to build a DFA for the given Language.
9. δ(A,1) = B, δ(A,0) =A
Δ (B, (0,1)) =C
δ(C,0) = A (Initial state =A)
String=”011001” is transit at which of the states?
a) A
b) C
c) B
d) Invalid String
Answer: a
Explanation: It is east and simple to create the table and then the corresponding transition
graph in order to get the result, at which state the given string would be accepted.
Answer: a
Explanation: The conversion of a non-deterministic automata into a deterministic one is a
process we call subset construction or power set construction.
2. Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}
How many state are required to execute L3 using NFA?
a) 16
b) 15
c) 8
d) 7
Answer: b
Explanation: The finite automaton for the given language is made and thus, the answer can
be obtained.
Answer: c
Explanation: The given diagram can be analysed and thus the option can be seeked.
4. The number of transitions required to convert the following into equivalents DFA:
a) 2
b) 3
c) 1
d) 0
Answer: a
Explanation:
Answer: a
Explanation: If L is a regular Language, Lc and Lr both are regular even.
Answer: b
Explanation: REJECT state will be like a halting state which rejects a particular invalid input.
Answer: a
Explanation: We can represent one language in more one FSMs, example for a same language
we have a DFA and an equivalent NFA.
Answer: b
Explanation: The production of form non-terminal ->ε is call null production.
Answer: d
Explanation: DFSM’s for the first three option is not possible; hence they aren’t regular.
10. Which of the following recognizes the same formal language as of DFA and NFA?
a) Power set Construction
b) Subset Construction
c) Robin-Scott Construction
d) All of the mentioned
Answer: d
Explanation: All the three option refers to same technique if distinguishing similar
constructions for different type of automata.
Answer: d
Explanation: The set of states which can be reached from q using ε-transitions, is called the
ε-closure over state q.
Answer: a
Explanation: It is possible to construct an NFA with ε-transitions, presence of no input
symbols, and that is called NFA with ε-moves.
Explanation: ε does not appears on Input tape, ε transition means a transition without
scanning a symbol i.e. without moving the read head.
Answer: c
Explanation: The transition with ε leads to a jump but without any shift in read head.
Further, the method can be called one to introduce hidden non-determinism.
Answer: c
Explanation: ε-closure is defined as the set of states being reached through ε-transitions
from a starting state.
6. Predict the total number of final states after removing the ε-moves from the given NFA?
a) 1
b) 2
c) 3
d) 0
Answer: c
Explanation: The NFA which would result after eliminating ε-moves can be shown
diagramatically.
Answer: a
Explanation: Due to the presence of ε symbol, or rather an epsilon-move, the input alphabets
unites with it to form a set including ε.
Answer: d
Explanation: All the mentioned are the closure properties of ε and encircles all the elements
if it satisfies the following options:
a) Every element of S ϵ Q
b) For any q ϵ ε(S), every element of δ (q, ε) is in ε(S)
c) No other element is in ε(S)
9. The automaton which allows transformation to a new state without consuming any input
symbols:
a) NFA
b) DFA
c) NFA-l
d) All of the mentioned
Answer: c
Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are
usually called NFA with epsilon moves or lambda transitions.
11. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from any
state in P following e-transitions.
a) e-closure
b) e-pack
c) Q in the tuple
d) None of the mentioned
Answer: a
Explanation: The e-closure of a set of states, P, of an NFA is defined as the set of states
reachable from any state in P following e-transitions.
Answer: d
Explanation: The languages which are recognized by an epsilon Non deterministic automata
are closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Negation
e) Star
f) Kleene closure
Regular Expression-Introduction
1. L is a regular Language if and only If the set of __________ classes of IL is finite.
a) Equivalence
b) Reflexive
c) Myhill
d) Nerode
Answer: a
Explanation: According to Myhill Nerode theorem, the corollary proves the given statement
correct for equivalence classes.
2. A language can be generated from simple primitive language in a simple way if and only if
a) It is recognized by a device of infinite states
b) It takes no auxiliary memory
c) Both are correct
d) Both are wrong
Answer: b
Explanation: A language is regular if and only if it can be accepted by a finite automaton.
Secondly, It supports no concept of auxiliary memory as it loses the data as soon as the
device is shut down.
Answer: d
Explanation: The given option represents {0, 01} in different forms using set operations and
Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid
regular expressions when used.
4. According to the given language, which among the following expressions does it corresponds to?
Language L={xϵ{0,1}|x is of length 4 or less}
a) (0+1+0+1+0+1+0+1)4
b) (0+1)4
c) (01)4
d) (0+1+ε)4
Answer: d
Explanation: The extended notation would be (0+1)4 but however, we may allow some or all
the factors to be ε. Thus ε needs to be included in the given regular expression.
Answer: a
Explanation: The given regular expression corresponds to a language of binary strings which
is of even length including a length of 0.
6. If R represents a regular language, which of the following represents the Venn-diagram most
correctly?
a) An Irregular Set
b) R*
c) R complement
d) R reverse
Answer: b
Explanation: The given diagram represents the Kleene operation over the Regular Language
R in which the final states become the initial and the initial state becomes final.
Answer: a
Explanation: The transition states shown are the result of breaking down the given regular
expression in fragments. For dot operation, we change a state, for union (plus) operation, we
diverge into two transitions and for Kleene Operation, we apply a loop.
Answer: b
Explanation: By distributive property (Regular expression identities), we can prove the
given identity to be Ф.
Answer: a
Explanation: RR*=R+ as R+ means the occurrence to be at least once.
Answer: a
Explanation: ε represents a single string in the set namely, the empty string while Statement
2 is also correct.
Answer: c
Explanation: When we wish to distinguish between a regular expression R and the language
it represents; we write L(R) to be the language of R.
Answer: b
Explanation: This regular expression can be used to eliminate the answers and get the
result. The length can be even and as well more than 3 when R= (∑∑∑) (∑∑∑) (particular
case).
Answer: a
Explanation: The star operation brings together any number of strings from the language to
get a string in the result. If the language is empty, the star operation can put together 0
strings, resulting only the empty string.
Answer: a
Explanation: The Regular expression (ab U a) * is converted to NFA in a sequence of stages as
it can be clearly seen in the diagram. This NFA consist of 8 stated while its minimized form
only contains 2 states.
7. Which of the following represents a language which has no pair of consecutive 1’s if ∑= {0,1}?
a) (0+10)*(1+ε)
b) (0+10)*(1+ε)*
c) (0+101)*(0+ε)
d) (1+010)*(1+ε)
Answer: a
Explanation: All the options except ‘a’ accept those strings which comprises minimum one
pair of 1’s together.
Answer: c
Explanation: A finite automaton accepts the languages which are regular and for which a
DFA can be constructed.
Answer: d
Explanation: Following the rules of precedence, Kleene or star operation would be done
first, then concatenation and finally union or plus operation.
10. Which of the following regular expressions represents the set of strings which do not contain a
substring ‘rt’ if ∑= {r, t}
a) (rt)*
b) (tr)*
c) (r*t*)
d) (t*r*)
Answer: d
Explanation: As Kleene operation is not on the whole of the substring, it will not repeat and
maintain the order of t, r.
11. According to the precedence rules, x-y-z is equivalent to which of the following?
a) (x-y)-z
b) x-(y-z)
c) Both (x-y)-z and x-(y-z)
d) None of the mentioned
Answer: a
Explanation: In arithmetic, we group two of the same operators from the left, hence x-y-z is
equivalent to (x-y)-z and not x-(y—z).
Answer: a
Explanation: Dot operation or concatenation operation means that the two expressions are
juxtaposed i.e. there are no intervening operators in between. In fact, UNIX regular
expressions use the dot for an entirely different purpose: representing any ASCII character.
Answer: d
Explanation: It does not matter in which order we group the expression with the operators
as they are associative. If one gets a chance to group the expression, one should group them
from left for convenience. For instance, 012 is grouped as (01)2.
Answer: c
Explanation: Using the rules of precedence on the give expression, c is the appropriate
choice with the order of: Bracket>Kleene>Dot>Union
Answer: b
Explanation: Pumping lemma defines an essential property for every regular language in
automata theory. It has certain rules which decide whether a language is regular or not.
2. While applying Pumping lemma over a language, we consider a string w that belong to L and
fragment it into _________ parts.
a) 2
b) 5
c) 3
d) 6
Answer: c
Explanation: We select a string w such that w=xyz and |y|>0 and other conditions. However,
there exists an integer n such that |w|>=n for any wÎL.
3. If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be an
empty string?
a) x
b) y
c) z
d) all of the mentioned
Answer: b
Explanation: The lemma says, the portion y in xyz cannot be zero or empty i.e. |y|>0, this
condition needs to be fulfilled to check the conclusion condition.
4. Let w= xyz and y refers to the middle portion and |y|>0.What do we call the process of repeating
y 0 or more times before checking that they still belong to the language L or not?
a) Generating
b) Pumping
c) Producing
d) None of the mentioned
Answer: b
Explanation: The process of repeatation is called pumping and so, pumping is the process we
perform before we check whether the pumped string belongs to L or not.
5. There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for some
constant integer n.What can be the maximum length of the substring xy i.e. |xy|<=?
a) n
b) |y|
c) |x|
d) none of the mentioned
Answer: a
Explanation: It is the first conditional statement of the lemma that states that |xy|<=n, i.e. the
maximum length of the substring xy in w can be n only.
Answer: b
Explanation: Finite languages trivially satisfy the pumping lemma by having n equal to the
maximum string length in l plus 1.
Answer: d
Explanation: Suppose L is a regular language . Then there is an integer n so that for any x∈L
and |x|>=n, there are strings u,v,w so that
x= uvw
|uv|<=n
|v|>0
for any m>=0, uvmw ∈L.
8. If d is a final state, which of the following is correct according to the given diagram?
Answer: a
Explanation: The FSA accepts the string pqrs. In terms of pumping lemma, the string pqrs is
broken into an x portion an a, a y portion qr and a z portion s.
9. Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What does
these variables represent?
a) string count
b) string
c) both (a) and (b)
d) none of the mentioned
Answer: a
Explanation: Given: w =xyz. Here, xyz individually represents strings or rather substrings
which we compute over conditions to check the regularity of the language.
10. Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must contain
more than one item.
a) Pumping lemma
b) Pigeon Hole principle
c) Count principle
d) None of the mentioned
Answer: b
Explanation: Pigeon hole principle states the following example: If there exists n=10 pigeons
in m=9 holes, then since 10>9, the pigeonhole principle says that at least one hole has more
than one pigeon.
Answer: c
Explanation: The entity which accepts a language is termed as Automata while the one which
generates it is called Grammar. Tokens are the smallest individual unit of a program.
2. Production Rule: aAb->agb belongs to which of the following category?
a) Regular Language
b) Context free Language
c) Context Sensitive Language
d) Recursively Ennumerable Language
Answer: c
Explanation: Context Sensitive Language or Type 1 or Linearly Bounded Non deterministic
Language has the production rule where the production is context dependent i.e. aAb->agb.
Answer: d
Explanation: Every regular language can be produced by context free grammar and context
free language can be produced by context sensitive grammar and so on.
Answer: b
Explanation: G=(V, ∑, p, S), here V=Finite set of variables, ∑= set of terminals, p= finite
productions, S= Starting Variable.
Answer: c
Explanation: According to the definition, the starting variable can produce another variable
or any terminal or a variable which leads to terminal.
7. For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?
a) Non regular language
b) 0n1n | n>=0
c) 0n1n | n>=1
d) None of the mentioned
Answer: d
Explanation: L={e, 01, 0011, 000111, ……0n1n }. As epsilon is a part of the set, thus all the
options are correct implying none of them to be wrong.
Answer: c
Explanation: The grammar which produces a palindrome set can be written as:
S-> aSa | bSb | e | a | b
L={e, a, b, aba, abbbaabbba…..}
Answer: a
Explanation: Regular grammar is a subset of context free grammar and thus all regular
grammars are context free.
10. Are ambiguous grammar context free?
a) Yes
b) No
Answer: a
Explanation: A context free grammar G is ambiguous if there is atleast one string in L(G)
which has two or more distinct leftmost derivations.
Answer: d
Explanation: The following are the notions to express Context free grammars:
a) Recursive Inferences
b) Derivations
c) Sentential form
d) Parse trees
Answer: a
Explanation: We apply the productions of CFG to infer that certain strings are in the language
of a certain variable.
Answer: c
Explanation: Two inference approaches:
1. Recursive inference, using productions from body to head
2. Derivations, using productions from head to body
4. 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 mentioned
Answer: d
Explanation: Parse trees are an alternative representation to derivations and recursive
inferences. There can be several parse trees for the same string.
Answer: a
Explanation: Yes, they are equivalent. Both the terminologies represent the two approaches
of recursive inferencing.
6. A->aA| a| b
The number of steps to form aab:
a) 2
b) 3
c) 4
d) 5
Answer: b
Explanation: A->aA=>aaA=>aab
7. An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such
that a change in those could make the expression correct.
L(G)={w in T*|S→*w}
a) 0 Errors
b) 1 Error
c) 2 Error
d) Invalid Expression
Answer: a
Explanation: For the given expression, L(G)={w in T*|S→*w}, If G(V, T, P, S) is a CFG, the
language of G, denoted by L(G), is the set of terminal strings that have derivations from the
start symbol.
Answer: b
Explanation: Push down automata accepts context free language.
9. Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00
a) {0a1b|a=2,b=3}
b) {0a1b|a=1,b=5}
c) {0a1b|a=b}
d) More than one of the mentioned is correct
Answer: a
Explanation: Using the recursive approach, we can conclude that option a is the correct
answer, and its not possible for a grammar to have more than one language.
Answer: d
Explanation: The given language is neither accepted by a finite automata or a push down
automata. Thus, it is neither a context free language nor a regular language.
a) true
b) partially true
c) false
d) none of the mentioned
Answer: a
Explanation: We apply the productions of a CFG to infer that certain strings are in a language
of certain variable.
Answer: b
Explanation: Both the statements are false. Recursive Inference, using productions from
body to head. Derivations, using productions from head to body.
13. Which of the following statements are correct for a concept called inherent ambiguity in CFL?
a) Every CFG for L is ambiguous
b) Every CFG for L is unambiguous
c) Every CFG is also regular
d) None of the mentioned
Answer: a
Explanation: A CFL L is said to be inherently ambiguous if every CFG for L is ambiguous.
Answer: a
Explanation: Rohit Parikh in 1961 proved in his MIT research paper that some context free
language can only have ambiguous grammars.
Answer: b
Explanation: A->ε is termed as Null production while A->B is termed as Unit production.
Answer: a
Explanation:
Answer: d
Explanation: z0 is the initial stack symbol, is an element of G. Other symbols like d
represents the transition function of the machine.
5. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
a) Moves
b) transition function
c) or/not symbol
d) none of the mentioned
Answer: a
Explanation: Using this notation, we can define moves and further acceptance of a string by
the machine.
Answer: d
Explanation: Theorem: The language pal of palindromes over the alphabet {0,1} cannot be
accepted by any finite automaton , and it is therefore not regular.
8. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the form
of __________
a) A
b) AnZ0, n>=0
c) Z0An, n>=0
d) None of the mentioned
Answer: b
Explanation:The possible change in the stack contents is a change in the number of A’s on the
stack.
Answer: a
Explanation: The PDA works as follows. Instead of saving excess 0’s or 1’s on the stack, we
save *’s and use two different states to indicate which symbol there is currently a surplus of.
The state q0 is the initial state and the only accepting state.
Answer: d
Explanation: A string is said to be balanced if it consist of equal number of 0’s and 1’s.
Deterministic PDA
1. The transition a Push down automaton makes is additionally dependent upon the:
a) stack
b) input tape
c) terminals
d) none of the mentioned
Answer: a
Explanation: A PDA is a finite machine which has an additional stack storage. Its transitions
are based not only on input and the correct state but also on the stack.
Answer: a
Explanation: A machine configuration is an element of K×Σ*×Γ*.
(p,w,γ) = (current state, unprocessed input, stack content).
Answer: b
Explanation: A string w is accepted by a PDA if and only if (s,w, e) |-* (f, e, e)
4. With reference of a DPDA, which among the following do we perform from the start state with an
empty stack?
a) process the whole string
b) end in final state
c) end with an empty stack
d) all of the mentioned
Answer: d
Explanation: The empty stack in the end is our requirement relative to finite state
automatons.
5. A DPDA is a PDA in which:
a) No state p has two outgoing transitions
b) More than one state can have two or more outgoing transitions
c) Atleast one state has more than one transitions
d) None of the mentioned
Answer: a
Explanation: A Deterministic Push Down Automata is a Push Down Automata in which no
state p has two or more transitions.
Answer: a
Explanation: There exists two lemma’s such that:
a) Given a grammar G, construct the PDA and show the equivalence
b) Given a PDA, construct a grammar and show the equivalence
7. If the PDA does not stop on an accepting state and the stack is not empty, the string is:
a) rejected
b) goes into loop forever
c) both (a) and (b)
d) none of the mentioned
Answer: a
Explanation: To accept a string, PDA needs to halt at an accepting state and with a stack
empty, else it is called rejected. Given a PDA M, we can construct a PDA M’ that accepts the
same language as M, by both acceptance criteria.
8. A language accepted by Deterministic Push down automata is closed under which of the
following?
a) Complement
b) Union
c) Both (a) and (b)
d) None of the mentioned
Answer: a
Explanation: Deterministic Context free languages(one accepted by PDA by final state), are
drastically different from the context free languages. For example they are closed under
complementation and not union.
Answer: a
Explanation: JFLAP is a software for experimenting with formal topics including NFA, NPDA,
multi-tape turing machines and L-systems.
Answer: a
Explanation: The linear encodings of languages accepted by finite nested word automata
gives the class of ‘visibly pushdown automata’.
1:
Number of states of the FSM required to simulate behaviour of a computer with a memory
capable of storing "m" words, each of length 'n'
A. m x 2n
B. 2mn
C. 2m+n
D. all of these
Explanation :
For every data here length is ‘n’ and memory's states are defined in terms of power of 2,
Here the total memory capability for all the words = mn
Hence number of states are 2mn
2:
An FSM with
Explanation :
3:
If two finite states machine M and N are isomorphic, then
Explanation :
4:
Power of
Explanation :
5:
Which of the folowing pairs of regular expressions are equivalent ?
C. x+ and x+x*+
D. All of these
6:
A finite state machine with the following state table has a single input x and a single
output z. If initial state is unknown, then shortest input sequence to reach the inal state C
is
Present
Next state, z
state
X=1 X =0
A D, 0 B, 0
B B, 1 C, 1
C B, 0 D, 1
D B, 1 C, 0
A. 01
B. 10
C. 110
D. 110
Explanation :
7:
An FSM can be used to add how many given integers ?
A. 1
B. 3
C. 4
D. 2
Explanation :
Finite Automata (FA) or Finite State Machine to add two integers can be constructed using
two states:
q0: Start state to represent carry bit is 0
q1: State to represent carry bit is 1
8:
If two finite state machines are equivalent, they should have the same number of
A. states
B. edges
C. states and edges
D. none of these
Answer Report Discuss
Option: D
Explanation :
9:
For which of the following applications regular expressions can be used ?
A. Designing compilers
D. All of these
Explanation :
10:
L = {aP | p ; } is prime is
A. regular
B. not regular
C. accepted by DFA
D. accepted by PDA
Answer Report Discuss
Option: B
Explanation :
11:
In an incompletely specified automata
Explanation :
12:
If f : {a, b}* —> (a, b}* be given by f (n) = ax for every value of n ∈ (a, b}, then f is
Explanation :
Click on Discuss to view users comments.
13:
The word 'formal' in formal languages means
Explanation :
14:
Running time of NFA to DFA conversion including the case where NFA has e-transition is
A. 0 (n3)
B. 0 (n332)
C. 0 (n32n)
D. 0 (n22n)
Explanation :
15:
Which of the following statements is/are false ?
A. The task of lexical analyzer is to translate the input source language text into tokens
and determine the groups of tokens are inter-related.
B. Two basic approaches to translation are generation and interpretation.
C. A load-and-go compiler is capable o translating the source language text on a host
machine A that can be later run on any target machine B.
D. None of these
Explanation :
16:
Which of the following are not regular ?
Explanation :
Strings of odd number of zeroes can be generated by the regular expression (00) *0.Pumping
lemma can be used to prove the non-regularity of the other options.
17:
The main difference between a DFSA and an NDFSA is
C. in DFSA, from any given state, there can't be any alphabet leading to two
diferent states
D. in NDFSA, from any given state, there can't be any alphabet leading to two
diferent states
Explanation :
18:
If w ∈ (a, b)* satisfy abw = wab, then (w) is
A. even
B. odd
C. null
D. none of these
Explanation :
19:
A PDM behaves like an FSM wnen the number of auxiliary memory it has, is
A. 0
B. 1
C. 2
D. None of these
Answer Report Discuss
Option: A
Explanation :
20:
Finite state machine can recognize
A. any grammar
B. only context-free grammar
C. Both (a) and (b)
D. only regular grammar
Answer Report Discuss
Option: D
Explanation :
21:
The major difference between a moore and mealy machine is that
A. output of the former depends on the present state and present input
D. all of these
Explanation :
22:
Any given transition graph has an equivalent
A. regular expression
B. DFSM
C. NDFSM
D. all of these
Explanation :
23:
For which of the following application, regular expressions cannot be used ?
A. Designing computers
B. Designing compilers
D. Developing computers
Explanation :
24:
If S be an infinite set and be sets such that S1 ∪ S2 ∪ .....∪ SN = S, then
Explanation :
25:
Vienna Definition Language is an example of language definition facility based on
A. Mathematical semantics
B. Interpretative semantics
C. Translational semantics
D. Axiomatic semantics
Explanation :
26:
Which of the following regular expressions denotes a language comprising all possible
strings over the alphabet {a, b } ?
A. a* b*
B. (a | b)*
C. (ab)+
D. (a | b*)
Explanation :
27:
An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite
tape length
Explanation :
28:
Palindromes can't be recognized by any FSM because
A. FSM can't remember arbitrarily large of information
D. all of these
Explanation :
29:
If ∑ = {a, b, c, d, e, f } then number of strings in ∑ of length 4 such that no symbol is used
more than once in a string is
A. 35
B. 360
C. 49
D. 720
Explanation :
Here string length is 4 so we can create string of length 4 by 6 values. Suppose at first place
we can arrange any value by 6 methods.so 6. then Remaining total numbers are 5 so we can
arrange them by 5 methods at second place. then remaining total numbers are 4 so we can
arrange them by 4 methods. now remaining total numbers are 3 and we can arrange them by
3 methods. so according to permutation technique. We multiply them i.e. 6*5*4*3=360. So, 'B'
30:
A language L is accepted by a finite automaton if and only if it is
A. context - free
B. context-sensitive
C. recursive
D. Right-linear
31:
Can a DFA simulate NFA?
A. NO
B. YES
C. SOMETIMES
D. Depends on NFA
Explanation :
32:
Which of the following statements is wrong ?
C. For a regular expression r, there does not exist NFA with L(r) any transit that
accept
D. None of these
Explanation :
33:
Regular expression a / b denotes the set
A. {a}
B. { ∈ , a, b }
C. {a, b}
D. { ab }
Answer Report Discuss
Option: C
Explanation :
34:
Regular expression (a | b ) (a | b) denotes the set
A. { a, b, ab, aa }
B. { a, b, ba, bb }
C. { a, b }
Explanation :
35:
Which of the following regular expressions denotes zero or more instances of an a or b ?
A. a| b
B. (ab)*
C. (a | b)*
D. a* I b
Explanation :
36:
Which of the following regular expressions denotes a language comprising all possible
strings of even length over the alphabet ( 0 , 1 ) ?
A. (0 | 1) *
B. (0 | 1) (0 | 1)*
C. (00 01 10 11 )*
D. (0 | 1 ) (0 | 1)(0 | 1 ) *
Answer Report Discuss
Option: C
Explanation :
37:
The regular expression (a | b)* denotes the set of all strings
Explanation :
38:
The string (a) | ((b) * (c)) is equivalent to
C. b* c l a
Explanation :
39:
An automation is a __________ device and a grammar is a __________ device.
A. generative, cognitive
B. generative, acceptor
C. acceptor, cognitive
D. cognitive, generative
Explanation :
40:
In the figure given below, a deterministic finite automation M has start state A and
accepting state D. Which of the following regular expression denoted the set of all words
accepted by
M?
A. 001
B. 10 * 1 * 0
C. ( 0 | 1) * 011
D. 1* 0 * 001
Explanation :
41:
The regular sets are closed under
A. union
B. concatenation
C. Kleene's closure
D. all of these
Explanation :
42:
Dynamic errors can be detected at
A. compile time
B. Run time
D. none of these
Explanation :
43:
If a and b be the regular expressions, then ( a* ∪ b* ) * is equivalent to
A. (a ∪ b) *
B. (b* ∪ a*)*
C. (b ∪ a)*
D. All of above
Explanation :
44:
Finite state machines _________ recognize palindromes
A. can
B. can't
C. may
D. may not
Explanation :
45:
If S and T be language over Σ = {a, b } represented by regular expression (a + b * ) * and
(a + b) * , respectively, then
A. S⊂T
B. T⊂ S
C. S=T
D. S ∩ T= φ
Explanation :
46:
Consider regular expression (0 + 1) (0 + 1) ....... n times. Minimum state finite automaton
that recognizes the language represented by this regular expression contains
A. n states
B. n + 1 states
C. n + 2 states
D. none of these
Explanation :
47:
If regular set A is represented by A = (01 + 1)* and the regular set 'B' is represented by B =
((01)*1*)*, then
A. A ⊂B
B. B⊂A
C. A and B are uncomparable
D. A=B
Explanation :
48:
Which of the following can be recognized by a Deterministic Finite-state Automaton ?
B.
Explanation :
49:
Which of the following are not regular ?
D. All of these
Explanation :
50:
An FSM with
D. none of these
Explanation :
51:
If w ∈ (a, b)* satisfy abw = wab, then (w) is
A. even
B. odd
C. null
D. none of these
Explanation :
52:
A PDM behaves like an FSM wnen the number of auxiliary memory it has, is
A. 0
B. 1
C. 2
D. none of these
Explanation :
53:
A finite state machine with the following state table has a single input x and a single
output z
Present
Next state, z
state
If the initial state is unknown, then shortest
x= x = input sequence to reach the final state C is
1 0
A. 01
A D, 0 B, 0 B. 10
C. 10
B B,1 C,1
D. 110
C B, 0 D, 1 Answer Report Discuss
Option: B
D B, 1 C, 0 Explanation :
54:
FSM shown in the
figure
A. all strings
B. no string
C. ε- alone
D. none of these
Explanation :
55:
If f : {a, b}* ---> {a , b } * be given by f(n) = ax for every value of n ∈ {a, b}, then f is
Explanation :
56:
If two finite states machine M and N are isomorphic, then
D. none of these
Explanation :
57:
Regular expression corresponding to the state diagram given in the figure is
B. (1 + 0 (0 + 10) 00)*
C. (0 + 1 (1 + 10) 00)*
Explanation :
58:
Two finite state machines are said to be equivalent if they
Explanation :
1:
Correct hierarchical relationship among context- free, right-linear, and context-sensitive
language is
Explanation :
2:
In the following grammar :
x::=x ⊕y| 4
y::=z*yI2
z : : = id
D. None of these
Explanation :
3:
Which of the following CFG's can't be simulated by an FSM ?
A. S --> Sa | b
B. S --> aSb | ab
D. None of these
Explanation :
Option (b) generates the set {an bn ,n=1,2,3 ....}which is not regular ,Option (a) is left linear
where as option (C) is right linear .
4:
ADG is said to be in Chomsky Form (CNF), if all the productions are of the form A --> BC
or
A --> a. Let G be a CFG in CNF. To derive a string of terminals of length x , the number of
productions to be used is
A. 2x - 1
B. 2x
C. 2x + I
D. None of these
Answer Report Discuss
Option: A
Explanation :
5:
Which of the following statements is correct?
B. Set B of all strings of equal number of a's and b's deines a regular language
D. None of these
6:
P, Q, R are three languages, if P and R are regular and if PQ = R, then
A. Q has to be regular
B. Q cannot be regular
C. Q need not be regular
D. Q cannot be a CFL
Answer Report Discuss
Option: C
Explanation :
7:
A class of language that is closed under
Explanation :
8:
The productions
E—>E+E
E—>E—E
E-->E*E
E —> E / E
E —> id
C. are unambiguous
D. can generate all possible fixed length valid computation for carrying out addition,
subtraction, multipication and division, which can be expressed in one expression
Answer Report Discuss
Option: B
Explanation :
9:
Which of the folowing definitions below generates the same language as L, where
L = {xn yn such that n > = 1} ?
I. E —> xEy | xy
III .x+y+
A. I only
B. I and II
C. II and III
D. II only
Answer Report Discuss
Option: A
Explanation :
II generates strings like xxyyy, which are not supposed to be.
III generates strings like xyy, which are not supposed to be.
I can be verified to generate all the strings in L and only those.
10:
Following context free grammar
S —> aB | bA
A —>b | aS | bAA
B —> b | bS | aBB
generates strings of terminals that have
11:
Define for the context free language
L< {0;1} init (L) = { u | u v ε L for some v in {0, 1}}
If L { w | w is nonempty and has an equal number of 0's and 1's}, then init (L) is set of all
binary strings
A. with unequal numbers of 0's and 1's.
D. None of these
Explanation :
12:
Which of the following CFG's can't be simulated by an FSM ?
A. s ---> sa | a
B. s ---> abX , X --> cY, Y --> a | axY
C. s ---> a sb | ab
D. none of these
Answer Report Discuss
Option: C
Explanation :
13:
Basic limitation of FSM is that it
Explanation :
14:
Which of the following is not possible algorithmically ?
Explanation :
Click on Discuss to view users comments.
15:
The set {anbn | n = 1, 2, 3 ...} can be generated by the CFG
A. S �>ab | aSb
B. S �>aaSbb + abS
C. S�> ab | aSb | E
D. S �>aaSbb | ab | aabb
Answer Report Discuss
Option: D
16:
The CFG
s---> as | bs | a | b
A. (a + b)
B. (a + b) (a + b)*
C. (a + b) (a + b)
D. None of these
Answer Report Discuss
Option: B
Explanation :
17:
Consider the grammar :
A. abc
B. aab
C. abcc
D. abbb
Answer Report Discuss
Option: A
Explanation :
18:
Pumping lemma is generally used for proving that
Explanation :
19:
The language of all words with at least 2 a's can be described by the regular expression
Explanation :
20:
Any string of terminals that can be generated by the following CFG is
S-> XY
X--> aX | bX | a
Y-> Ya | Yb | a
21:
L = (an bn an | n = 1,2,3) is an example of a language that is
A. context free
B. not context free
C. not context free but whose complement is CF
D. both (b) and (c)
Answer Report Discuss
Option: D
Explanation :
22:
If Σ = (0, 1), L = Σ* and R = (0n 1nsuch that n > 0 )
D. None of these
Explanation :
23:
FSM can recognize
A. any grammar
B. only CG
C. Both (a) and ( b )
D. only regular grammar
Answer Report Discuss
Option: D
Explanation :
24:
Set of regular languages over a given alphabet set is closed under
A. union
B. complementation
C. intersection
D. All of these
Explanation :
25:
Which of the following statement is correct?
26:
Given A = (0,1) and L = A*. If R = (0n 1n, n > 0) , then language L ∪ R and R are
respectively
A. regular, regular
Explanation :
27:
Define for a context free language
Let L {w/w is noempty and has an equal number of 0’s and 1’s)
A. set of all binary strings with unequal number of 0’s and 1’s
C. set of all binary strings with exactly one more 0’s than the number of 1’s or 1
more than the number of 0’s
D. none of these
Explanation :
28:
If L1 and L2 are context free language and R a regular set, then which one of the
languages below is not necessarily a context free language?
A. L1 L2
B. L1 ∩ L2
C. L1 ∩ R
D. L1 ∪ L2
Explanation :
29:
Consider a grammar with the following productions
A. Context free
B. regular
C. context sensitive
D. LR ( k )
Explanation :
30:
What can be said about a regular language L over {a} whose minimal finite state
automation has two states?
A. L must be { an | n is odd}
B. L must be { an | n is even}
36:
Let L be a language recognizable by a finite automaton. The language
A. regular language
B. context-free language
C. context-sensitive language
Explanation :
37:
The grammars G = ( { s }, { 0, 1 }, p , s)
where p = (s —> 0S1, S —> OS, S —> S1, S —>0} is a
B. regular language
C. context-sensitive language
D. context-free language
38:
The logic of pumping lemma is a good example of
A. pigeon-hole principle
B. divide-and-conquer technique
C. recursion
D. iteration
Explanation :
The pigeon hole principle is nothing more than the obvious remark: if you have fewer pigeon
holes than pigeons and you put every pigeon in a pigeon hole, then there must result at least
one pigeon hole with more than one pigeon. It is surprising how useful this can be as a proof
strategy.
In the theory of formal languages in computability theory, a pumping lemma or pumping
argument states that, for a particular language to be a member of a language class, any
sufficiently long string in the language contains a section, or sections, that can be removed, or
repeated any number of times, with the resulting string remaining in that language. The proofs
of these lemmas typically require counting arguments such as the pigeonhole principle. So the
answer is 'A'
Click on Discuss to view users comments.
39:
The intersection of CFL and regular language
A. is always regular
Explanation :
40:
For two regular languages
L1 = (a + b)* a and L2 = b (a + b ) *
,
the intersection of L1 and L2 is given by
A. (a + b ) * ab
B. ab (a + b ) *
C. a(a+b)*b
D. b (a + b ) * a
31:
In a context-sensitive grammar, number of grammar symbols on the left hand side of a
production can't be greater than the number of
D. all of these
32:
In a context-free grammar
B. terminal symbols can't be present in the left hand side of any production
C. number of grammar symbols in the left hand side is not greater than the
number of grammar symbols in the right hand side
D. all of these
Explanation :
33:
CFG can be recognized by a
A. push-down automata
D. none of these
Explanation :
34:
Which of the following statements are true?
I. The set of all odd integers is a monoid under multiplication.
II. The set of all complex number is a group under multiplication
III. The set of all integers under the operation * given by a * b = a+b-ab is a monoid
IV. Zs under symmetric difference defined by
A B = (A-B) ∪ (B-A) is an abelian group
A. I and II
B. I, III and IV
C. I, II and III
D. I, II and IV
Explanation :
35:
A given grammar is called ambiguous if
A. two or more productions have the same non-terminal on the left hand side
41:
Context free grammar is not closed under
A. product
B. union
C. complementation
D. kleen star
Explanation :
42:
If L be a language recognizable by a finite automaton, then language front
A. regular language
B. context-free language
C. context-sensitive language
Explanation :
43:
For which of the following application, regular expressions can not be used ?
A. Designing computers
B. Designing compilers
D. Developing computers
Explanation :
44:
Consider the following grammar
S --> Ax / By
A --> By/Cw
B --> x / Bw
C--> y
Which of the regular expressions describe the same set of strings as the grammar ?
A. xw * y + xw * yx + ywx
B. xwy + xw * xy + ywx
C. xw * y + xw x yx + ywx
D. xw xy + xww * y + ywx
Explanation :
45:
Which of the following statements is (are) correct ?
D. All of these
46:
Which of the following statement is wrong ?
Explanation :
47:
Consider a grammar :
G = ( { x , y ) , { s , x , y } , p , s)
S--> x y
S -->y x
x--> x z
x--> x
y--> y
z--> z
A. Chomsky type 0
B. Chomsky type 1
C. Chomsky type 2
D. Chomsky type 3
48:
Consider a grammar :
G={{S},{0,1},p,s}
S --> ss
S--> 0S1
S--> 1S0
S--> empty
A. regular language
B. context-free language
C. context-sensitive language
Explanation :
49:
A grammar that produces more than one parse tree for some sentence is called
A. ambiguos
B. unambigous
C. regular
D. none of these
Explanation :
50:
Given a grammar G a production of G with a dot at some position of the right side is
called
A. LR (0) item of G
B. LR (1) item of G
D. none of these
56:
Context-free grammar can be recognized by
Explanation :
57:
The language L = (0n 1n 2n where n > 0) is a
B. context-sensitive language
C. regular language
Explanation :
58:
Context free language are closed under
A. union, intersection
C. intersection, complement
Explanation :
59:
If G = ({S}, {a}, {S -> SS), S),
A. L (G) = φ
B. L(G) = an
C. L (G) = a*
D. L (G) = anban
Explanation :
60:
Grammar
S —> a,
S —> A3A4 ,
A3 —> A1, A3, A2 ,
A3 —> A1 A2, A1
A2—> aA2A1 ,
A1a —> a A1,
A2a —> aA2,
A1A4 —> A4a,
A2A4 —> A5a,
A2A5 —> A5a,
A5 —> a
generates
A. an^2
B. n2a
C. 2an
D. none of these
61:
If L1 = {x | x is a palindrome in (0 + 1)*}
L2 = {letter (letter + digit)* };
L3 = (0n 1n 2n | n > 1}
L4 = {ambnam+n | m, n > 1}
Explanation :
62:
A grammar to generate
{ (ab)n I n ≥ 1 } ∪ { (ba)n I n ≥ 1 }
is constructed as
A. S ---> S1, S1 ---> abS1, S1 ---> ab, S ---> S2, S2 —> baS2, S2 —> ba
B. S ---> S1 , Sl ---> aS1, S1 ---> ab, S ---> S2, S2 ---> bS2, S2 —> bc
D. none of these
Explanation :
63:
Consider the grammar
S ---> PQ | SQ | PS
P ---> x
Q--> y
To get a string of n terminals, the number of productions to be used is
A. n2
B. n+1
C. 2n
D. 2n - 1
Explanation :
64:
What is the highest type number which can be applied to the following grammar ?
S —> Aa, A —> Ba, B —> abc
A. Type 0
B. Type 1
C. Type 2
D. Type 3
Explanation :
65:
Following syntax-directed translation scheme is used with a shift reduction (bottom up)
parser that perform the action in braces immediately after a reduction by
the corresponding production
A. 0202021
B. 1202020
C. 1020202
D. none of these
1:
Which of the following is complement of a?
D. None of these
Explanation :
2:
If nL can be recognized by a multitape TM with time complexity f, then L can be
recognized by a one-tape machine with time complexity DSD
A. O( f 2)
B. o( f 2)
C. o(h)
D. O(h2)
Explanation :
3:
If T is a TM recognizing L, and T reads every symbol in the input string, τT(n) ≥ 2n +
2, then any language that can be accepted by a TM T with τT(n) = 2n + 2 is
A. regular
B. not regular
C. uncertain
D. none of these
Explanation :
4:
Consider an alternate Turing machine model, in which there is an input tape on which the
tape head can move in both directions but cannot write, and one or more work tapes, one
of which serves as an output tape. For a function f, denoted by DSpace ( f ) , the set of
languages that can be recognized by a Turning machine of this type which uses no more
than f(n) squares on any work tape for any input string of length n. The only restriction we
need to make on f is that f(n) > 0 for every n. The language of balanced strings of
parentheses are in
A. DSpace (1+ ⌈log2 (n + 1 ⌉). (⌈ x ⌉) means the smallest integer greater than or
equal to x.
D. none of these
Explanation :
5:
Which of the following problems is solvable ?
6:
Which of the following is not primitive recursive but partially recursive ?
A. Carnot's function
B. Ricmann function
C. Bounded function
D. Ackermann's function
Explanation :
7:
Turing machine (TM) is more powerful than FMS (Finite State Machine) because
A. tape movement is confined to one direction
D. none of these
Explanation :
8:
If f : N--> N. If L can be recoognized by a TM T, so that τT(n) ≤ f (n) for all but finitely many
n, then ( Time (f) means Time ( max ( f, 2n +2))).
A. L ∈Time (f)
B. L ∈ Time(cf)
C. L ∈ Time (h)
D. none of these
Explanation :
9:
Let s is a step-counting function satisfying s(n) ≥ n, and L be a language accepted by a
(multitape) TM T. If tape heads of T do not move past square s(n) on any of the tapes for
an input string of length n, then T ∈
A. Space(s)
B. F(n)
C. Time(f)
D. Time(h)
Explanation :
10:
Which of the following statements is false ?
A. Halting problem of Turing machines is undecidable
11:
Bounded minimalization is a technique for
Explanation :
12:
If there exists a language L, for which there exists a TM, T, that accepts every word in L
and either rejects or loops for every word that is not in L, is called
A. recursive
B. recursively enumerable
C. NP-HARD
D. none of these
Explanation :
13:
Which of the following statement(s) is/are correct?
D. All of these
Explanation :
14:
Universal TM influenced the concept of
C. computability
D. all of these
Explanation :
15:
Number of external states of a UTM should be atleast
A. 1
B. 2
C. 3
D. 4
16:
The statement, “A TM can’t solve halting problem” is
A. true
B. false
D. all of these
Answer Report Discuss
Option: A
Explanation :
17:
If there exists a TM which when applied to any problem in the class, terminates, if correct
answer is yes and may or may not terminate otherwise is called
A. stable
B. unsolvable
C. partially solvable
D. unstable
Explanation :
18:
Given a Turing machine T and a step-counting function f, is the language accepted by T in
Time(f) ? This decision problem is
A. solvable
B. unsolvable
C. uncertain
D. none of these
Explanation :
19:
A total recursive function is a
D. none of these
Answer Report Discuss
Option: D
Explanation :
20:
The running time T (n), where 'n' is input size of a recursive algorithm, is given as
T (n) = c + T (n - 1), if n > 1
= d, if n ≤ 1
The order of the algorithm is
A. n2
B. n
C. n3
D. nn
21:
Next move function δ of a Turing machine M = (Q, Σ , Γ, δ, q0, B, F) is a mapping
A. δ : Q x Σ --> Q x Γ
B. δ : Q x Γ ---> Q x Σ x {L, R}
C. δ : Q x Σ ---> Q x Γ x {L, R}
D. δ : Q x Γ ---> Q x Γ x {L, R}
Explanation :
22:
If L can be recognized by a TM T with a doubly infinite tape, and τ t = f, then L can be recognized by an ordinary
TM with time complexity
A. O(f)
B. o(f)
C. O(h)
D. o(h)
Answer Report Discuss
Option: A
1. Given the following expressions of a grammar
E --> E * F / F + E / F
F --> F - F / id
3. Let L be a set accepted by a non deterministic finite automaton. The number of states in non-deterministic f
of states in equivalent finite automaton that accepts L is
a. |Q|
b. 2|Q|
c. 2^|Q| – 1
d. 2^|Q|
Answer: (d).2^|Q|
4. The grammar ‘G1’
a. G1 is ambiguous, G2 is unambiguous
b. G1 is unambiguous, G2 is ambiguous
a. (r + s)* = r* s*
b. (r + s)* = r* + s*
c. (r + s)* = (r*s*)*
d. r* s* = r* + s*
6. The minimum number of states of the non-deterministic finite automation which accepts the language
{a b a bn| n ≥ 0} ∪ {a b an|n ≥ 0} is
a. 3
b. 4
c. 5
d. 6
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).5
a. S ∈ asb|bsa|∈
b. S ∈ asa|bsb|∈
c. S ∈ asb|bsa|asa|bsb|∈
d. S ∈ asb|bsa|asa|bsb
8. If the parse tree of a word w generated by a Chomsky normal form grammar has no path of length greater t
d. no greater than i
S1: SLR uses follow information to guide reductions.In case of LR and LALR parsers, the look-aheads are a
of the left context available to the parser.
S2: LR grammar is a larger sub-class of context free grammar as compared to that SLR and LALR gramma
a. S → aaa; A → aAb | B, B → Bb | λ
b. S → aaaA | λ ; A → aAb | B; B → Bb | λ ;
S1: The grammars S → asb | bsa |ss I a and s→ asb | bsa| a are not equivalent.
S2: The grammars S→. ss| sss | asb | bsa| λ and S → ss |asb |bsa| λ are equivalent.
Which of the following is true?
a. ≤m, ≤1
b. ≤m,≥1
c. ≥m,≤1
d. ≥m, ≥1
Answer: (b).≤m,≥1
14. The Greibach normal form grammar for the language L = {an bn+1 | n ≥ 0 } is
a. S → aSB, B →bB I λ
b. S → aSB, B →bB I b
c. S → aSB I b, B→b
d. S → aSB I b
a. Shift step that advances in the input stream by K(K > 1) symbols and Reduce step that applies a completed
joining them together as one tree with a new root symbol.
b. Shift step that advances in the input stream by one symbol and Reduce step that applies a completed gram
them together as one tree with a new root symbol.
c. Shift step that advances in the input stream by K(R = 2) symbols and Reduce step that applies a completed
d. Shift step that does not advance in the input stream and Reduce step that applies a completed grammar rul
Answer: (b).Shift step that advances in the input stream by one symbol and Reduce step that applies a completed
joining them together as one tree with a new root symbol.
S → aB | bA
A → a | as | bAA
B → b | bs | aBB
will generate
b. All LR(K) parsers with K > 1 can be transformed into LR( 1) parsers
c. Both a and b
19. The pushdown automation M = ( {q0, q1, q2}',{a, b}, {0, 1}, δ, q0,0, {q0}) with
δ (q0, a, 0) = {(q1,10)}
δ (q1,a, 1) = {(q1,11)}
b. L= {a^nb^n l n >=0}
d. L= {a^nb^n l n >0}
L2 = {an bm l n ≠ m}
b. a* bbbbb*
22. We can show that the clique problem is NP-hard by proving that
b. CLIQUE ≤ PVERTEX_COVER
c. CLIQUE ≤ P SUBSET_SUM
code:
a b c d
a. ii iv iii i
b. ii iv i iii
c. iv i ii iii
d. i iv iii ii
b. with I vxy I ≤ m and I vy I ≥ 1 such that uvi xyi z ∈ L for all i = 0,1,2,.....
c. with I vxy I ≥ m and I vy I ≤ 1 such that uvi xyi z ∈ L for all i = 0,1,2,.....
d. with I vxy I ≥ m and I vy I ≥ 1 such that uvi xyi z ∈ L for all i = 0,1,2,.....
Answer: (d).with I vxy I ≥ m and I vy I ≥ 1 such that uvi xyi z ∈ L for all i = 0,1,2,.....
S → Sα1 | Sα2 | β1 | β2
a. S → β1 | β2 , A → α1A | α2 A | λ
b. S → β1 | β2 | β1 A | β2 A , A → α1A | α2 A
c. S → β1 | β2 , A → α1A | α2 A
27. If all the production rules have single non - terminal symbol on the left side, the grammar defined is :
c. unrestricted grammar
d. phrase grammar
28. Minimal deterministic finite automaton for the language L = {0n | n ≥ 0 , n ≠ 4} will have
29. The regular expression corresponding to the language L where L = { x ∈{0, 1}* | x ends with 1 and does not
b. (1 + 01)* 01
c. (1 + 01)* (1 + 01)
d. (10 + 01)* 01
a. S→0|0S|1SS
b. S→0S|1S|0SS|1SS|0|1
c. S → 0 | 0 S | 1 S S | S 1 S |S S 1
d. S→0S|1S|0|1
Answer: (c).
S1: If L1 and L2 are recursively enumerable languages over Σ, then L1 ⋃ L2 and L1 ⌒ L2 are also recursiv
G1: S → AB|aaB
A → aA | ∈
B → bB | ∈
G2: S → A | B
A → a A b | ab
B→abB|∈
33. Let L be any language. Define even (W) as the strings obtained by extracting from W the letters in the eve
(W) | W ԑ L}. We define another language Chop (L) by removing the two leftmost symbols of every string in
2}.
G1 : S → AB | aaB
A → a | Aa
B→b
G2: S→ aSbS|bSaS|λ
List-I List-II
A→ SA|b
B→ b
Codes:
a b c d
a. iv iii i ii
b. iv iii ii i
c. iii iv i ii
d. iii iv ii i
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).iii iv i ii
a. 0(n^2)
b. O(n/gn)
c. O(n)
d. O(lgn)
Answer: (c).O(n)
38. The number of strings of length 4 that are generated by the regular expression (0|?) 1+2* (3|?), where | is a
characters, and ? is the null string, is:
a. 8
b. 10
c. 11
d. 12
Answer: (d).12
a. The grammar S ? aSb|bSa|SS|?, where S is the only non-terminal symbol and ? is the null string, is ambigu
40. Consider the languages L1 = ϕ, and L2 = {1}. Which one of the following represents
L1* U L2* L1* ?
a. {ε}
b. {ε,1}
c. ϕ
d. 1*
Answer: (d).
42. Let G = (V,T,S,P) be a context-free grammar such that every one of its productions is of the form A→v, with
has a height h such that
a. 1
b. 2
c. 3
d. 4
Answer: (d).4
L1 = {a^nb^n|n≥0, n≠100}
L2 = {w ϵ {a,b,c}*| na(w) = nb(w) = nc(w)}
b. The set of all languages that are not recursively enumerable is countable
Answer: (b).The set of all languages that are not recursively enumerable is countable
47. Let C be a binary linear code with minimum distance 2t + 1 then it can correct upto ............bits of error.
a. t+1
b. t
c. t-2
d. t/2
Answer: (b).t
48. A t-error correcting q-nary linear code must satisfy the following, Where M is the number of code words and
a. q^n
b. q^t
c. q^-n
d. q^-t
Answer: (a).q^n
abbaabbaab
which one of the following is not a word in the dictionary created by LZ-coding (the initial words are a, b)?
a. ab
b. bb
c. ba
d. baab
Answer: (d).b a a b
50. The number of strings of length 4 that are generated by the regular expression (0+1+|2+3+)*, where | is an
quantification characters, is:
a. 08
b. 09
c. 10
d. 12
Answer: (c).
a. The grammar S→aS|aSbS|Î, where S is the only non-terminal symbol, and Î is the null string, is ambiguous.
b. An unambiguous grammar has same left most and right most derivation.
Answer: (b).An unambiguous grammar has same left most and right most derivation.
52. The regular grammar for the language L = {a^nb^m | n + m is even} is given by
(A) S → S1 | S2
S1 → a S1 | A1
A1 → b A1 | λ
S2 → aaS2 | A2
A2 → b A2 | λ
(B) S → S1 | S2
S1 → a S1 | a A1
S2 → aa S2 | A2
A1 → bA1 | λ
A2 → bA2 | λ
(C) S → S1 | S2
S1 → aaa S1 | aA1
S2 → aaS2 | A2
A1 → bA1 | λ
A2 → bA2 | λ
(D) S → S1 | S2
S1 → aa S1 | A1
S2 → aaS2 | aA2
A1 → bbA1 | λ
A2 → bbA2 | b
a. A
b. B
c. C
d. D
Answer: (d).D
53. Let Σ = {a, b} and language L = {aa, bb}. Then, the complement of L is
a. 0* 1*
b. 00*
c. 10*
d. 1*0*
Answer: (b).00*
57. Let G = (V, T, S, P) be a context-free grammar such that every one of its productions is of the form A → n, w
string W ϵ L (G) has a height such that
a. A
b. B
c. C
d. D
Answer: (d).D
The total maximum profit (z) for the above problem is:
a. 6
b. 8
c. 10
d. 12
Answer: (b).8
59. The regular expression for the complement of the language L = {anbm|n≥4, m≤3} is:
L1 = {0i1j | gcd(i,j)=1}
L2 is any subset of 0*.
Answer: (b).
61. Let L be the language generated by regular expression 0*10* and accepted by the deterministic finite autom
As all states are reachable from the start state, RM has ................ equivalence classes.
a. 2
b. 4
c. 5
d. 6
Answer: (d).6
a. L’ is context free and L^k is not context free for any k≥1
b. L’ is not context free and L^k is context free for any k≥1
d. Both L’ and L^k is for any k≥1 are not context free
Answer: (c).Both L’ and L^k is for any k≥1 are context free
δ(q0,a) = (q1,a,R)
δ(q1,b) = (q2,b,R)
δ(q2,a) = (q2,a,R)
δ(q2,b) = (q3,b,R)
a. aa*b
b. abab
c. aba*b
d. aba*
Answer: (c).aba*b
List - I List - II
(a) {a^n b^n|n > 0} is a deterministic (i) but not recursive language
context free language
(b) The complement of {a^n b^n a^n|n > 0} (ii) but not context free language
is a context free language
(c) {a^n b^n a^n} is context sensitive language (iii) but can not be accepted by a deterministic pushdown au
(d) L is a recursive language (iv) but not regular
Codes :
(a) (b) (c) (d)
65. The language of all non-null strings of a’s can be defined by a context free grammar as
follow :
S→a S|S a| a
a. Two
b. Three
c. Four
d. Five
Answer: (c).Four
S→XYX
X→aX|bX|λ
Y→bbb
a. (a+b)*bbb
b. abbb(a+b)*
c. (a+b)*(bbb)(a+b)*
d. (a+b)(bbb)(a+b)*
Answer: (c).(a+b)*(bbb)(a+b)*
67. There are exactly ................ different finite automata with three states x, y and z over the alphabet {a, b} wh
a. 64
b. 256
c. 1024
d. 5832
Answer: (d).5832
L1={a^n b a^n|n>0}
L2={a^n b a^n b^n+1|n>0}
Answer: (a).L1 is context free language and L2 is not context free language
69. Consider a language A defined over the alphabet ∑={0, 1} as A = {0^[n/2] 1^n: n >= 0} .
The expression [n/2] means the floor of n/2, or what you get by rounding n/2 down to the nearest integer.
a. 011
b. 0111
c. 0011
d. 001111
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).0011
70. A grammar G is LL(1) if and only if the following conditions hold for two distinct productions A → α | β
I. First (α) ∩ First (β) ≠ {a} where a is some terminal symbol of the grammar.
II. First (α) ∩ First (β) ≠ λ
III. First (α) ∩ Follow(A) = φ if λ є First (β)
a. I and II
b. I and III
c. II and III
d. I, II and III
Answer: (d).
72. The context free grammar for language L = {a^nb^mc^k | k = |n - m|, n≥0,m≥0,k≥0} is
a. 3
b. 4
c. 5
d. 6
Answer: (c).5
74. Regular expression for the language L = { w ∈ {0, 1}* | w has no pair of consecutive zeros} is
a. (1 + 010)*
b. (01 + 10)*
c. (1 + 010)* (0 + λ)
d. (1 + 01)* (0 + λ)
a. S → aSc | S1 ; S1 → bS1c | λ
d. S → aSc | λ ; S1 → bS1c| λ
S1: Given a context free grammar G, there exists an algorithm for determining whether L(G) is infinite.
S2: There exists an algorithm to determine whether two context free grammars generate the same languag
79. A regular grammar for the language L = {a^nb^m | n is even and m is even}is given by
S→ aA| aBB;
A→aaA |λ ;
B→ bB| bbC;
C→ B
a. The language corresponding to the given grammar is a set of even number of a’s.
b. The language corresponding to the given grammar is a set of odd number of a’s.
c. The language corresponding to the given grammar is a set of even number of a’s followed by odd number o
d. The language corresponding to the given grammar is a set of odd number of a’s followed by even number o
Answer: (b)
M= ({q0, q1, q2}, {a, b}, {a, b, z}, δ, q0, z, {q2}) with transitions
δ (q0 a, z) = { (q1 a), (q2 λ)};
δ (q1, b, a) = { (q1, b)}
δ (q1, b, b) ={ (q1 b)}, δ (q1, a, b) = { (q2, λ)}
is
a. L(abb*a)
b. {a} U L(abb*a)
c. L(ab*a)
d. {a} U L(ab*a)
S1 : L2-L1 is recursive enumerable where L1 and L2 are recursive and recursive enumerable respectively.
S2 : The set of all Turing machines is countable.
S→aSS | ab is
a. A
b. B
c. C
d. D
Answer: (b).B
a. a*b
b. a*baa*
c. a*ba*
Answer: (c).a*ba*
86. Given the production rules of a grammar G1 as
S1→AB | aaB
A→a | Aa
B→b
S2→aS2bS2 | bS2aS2 | λ
87. Given a grammar : S1→Sc, S→SA|A, A→aSb|ab, there is a rightmost derivation S1=>Sc =>SAC=>SaSbc.
handle is
a. SaS
b. be
c. Sbe
d. aSb
Answer: (d).aSb
S→Sα1|Sα2|β1|β2 is
89. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively
The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
a. 5
b. 4
c. 3
d. 2
Answer: (c).3
90. The grammar with production rules S → aSb |SS|λ generates language L given by:
a. L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
b. L = {w∈{a, b}* | na(w) = nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
c. L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≥ nb(v) where v is any prefix of w}
d. L = {w∈{a, b}* | na(w) ≠ nb(w) and na(v) ≤ nb(v) where v is any prefix of w}
Answer: (a).
91. A pushdown automation M = (Q, Σ, Γ, δ, q0, z, F) is set to be deterministic subject to which of the following
∈Γ
(s1) δ(q, a, b) contains at most one element
(s2) if δ(q, λ, b) is not empty then δ(q, c, b) must be empty for every c ∈ Σ
a. only s1
b. only s2
c. both s1 and s2
d. neither s1 nor s2
View Answer Report Discuss Too Difficult! Search Google
92. For every context free grammar (G) there exists an algorithm that passes any w ∈ L(G) in number of steps p
a. ln|w|
b. |w|
c. |w|^2
d. |w|^3
Answer: (d).|w|^3
Codes:
a b c d
a. ii i iv iii
b. iii iv i ii
c. iii i iv ii
d. ii iv i iii
Answer: (c).iii i iv ii
s1: Context sensitive languages are closed under intersection, concatenation, substitution and inverse hom
s2: Context free languages are closed under complementation, substitution and homomorphism.
Which of the following is correct statement?
a. I only
b. I and II
c. I and III
d. II and III
(i) The power of deterministic finite state machine and nondeterministic finite state machine are same.
(ii) The power of deterministic pushdown automaton and nondeterministic pushdown automaton are same.
b. Only (i)
c. Only (ii)
97. Let Q(x, y) denote “x + y = 0” and let there be two quantifications given as follows, where x & y are real num
99. Which one of the following is not a Greibach Normal form grammar?
(i) S ->a|bA|aA|bB
A->a
B->b
(ii) S->a|aA|AB
A->a
B->b
(iii) S->a|A|aA
A->a
a. S→aA,A→BB,B→aBb
b. S→a∣aA,A→BB,B→aBb∣ab
c. S→a∣aA,A→BB∣B,B→aBb
d. S→a∣aA,A→BB∣B,B→aBb∣ab
Answer: (d).
101. Consider the regular expression (a + b) (a + b) … (a + b) (n-times). The minimum number of states in finite
represented by this regular expression contains
a. n states
b. n + 1 states
c. n + 2 states
d. 2^n states
a. ab*(b + aa*b)*
b. a*b(b + aa*b)*
c. a*b(b* + aa*b)
d. a*b(b * + aa*b)*
c. A->A+A, A->a
d. Both a and b
a. type 0
b. type 1
c. type 2
d. type 3
Answer: (c).type 2
109. Let e: B˄m→B˄n is a group code. The minimum distance of ‘e’ is equal to:
c. m
d. n
110. Consider a Moore Machine M whose digraph is given below. Then L(M), the language accepted by the ma
Answer: (a).
a. y=>x
b. ~y=>x
c. ~y=>~x
d. y=>~x
Answer: (b).~y=>x
r=(1+01)*(0+λ)
a. Set of all string not containing ‘11’
a. L={a^nb^n|n≥1}
b. L={a^nb^mc^nd^m|n,m≥1}
c. L={a^nb^m|n,m≥1}
d. L={anbmcn|n,m≥1}
Answer: (c).L={a^nb^m|n,m≥1}
S → AB / AS, A → a / aA, B → b
a. aa*b+
b. aa*b
c. (ab)*
d. a(ab)*
Answer: (b).aa*b
116. Which of the following strings is in the language defined by grammar S→0A, A→1A/0A/1
a. 01100
b. 00101
c. 10011
d. 11111
Answer: (b).00101
b. recursion
d. iteration
a. injective
b. surjective
a. bccddd
b. aabccd
c. ababccd
d. abbbd
Answer: (a).bccddd
a. {a}
b. {ϵ, a, b}
c. {a, b}
d. None of these
Answer: (c)
Answer: (b).Power of deterministic pushdown automata is equivalent to power of non-deterministic pushdown aut
a. L = {ωωR|ωϵ{0,1}*}
b. L = {a^nb^n|n≥0}
c. L = {ωω|ωϵ{0,1}*}
d. L = {a^nb^mc^md^n | n, m≥0 }
c. Generic grammar
d. All of these
a. Type0
b. Type1
c. Type2
d. Type3
Answer: (c).Type2
126. In parallel algorithm design, the process of grouping tasks into larger tasks in order to improve performance
a. Agglomeration
b. Domain Decomposition
c. Mapping
d. None of these
Answer: (a).Agglomeration
a. LL parsers
b. LR parsers
c. LALR parsers
d. SLR parsers
a. {0,1}*
b. {}
c. {0}*
d. {1}*
Answer: (a).{0,1}*
129. Let r = a(a + b)*, s = aa*b and t = a*b be three regular expressions.
Consider the following:
(i) L(s) ⊆ L(r) and L(s) ⊆ L(t)
(ii) L(r) ⊆ L(s) and L(s) ⊆ L(t)
The minimum number of states of finite automaton which accepts the language L is
a. n
b. n+1
c. n(n+1)/2
d. 2^n
Answer: (b).
131. The number of substrings that can be formed from string given by
adefbghnmp
is
a. 10
b. 45
c. 55
d. 56
Answer: (d).56
132. Consider the following two languages:
134. Consider R to be any regular language and L1, L2 be any two context-free languages. Which of the followin
c. L1 ∩ L2 is context free
d. L1 – R is context free
136. Which of the following problems is decidable for recursive languages (L)?
a. Is L = ϕ?
b. Is w ∈ L, where w is a string?
c. Is L = Σ*?
S→A∣B
A→a∣c
B→b∣c
where {S, A, B} is the set of non-terminals, {a, b, c,} is the set of terminals.
a. Only S1
b. Only S2
c. Both S1 and S2
d. Neither S1 nor S2
138. The grammar S → (S) ∣ SS ∣ ϵ is not suitable for predictive parsing because the grammar is
a. Right recursive
b. Left recursive
c. Ambiguous
d. An operator grammar
Answer: (c).Ambiguous
Answer: (d).
141. A pushdown automata behaves like a Turing machine when the number of auxiliary memory is:
a. 0
b. 1
c. 1 or more
d. 2 or more
143. To obtain a string of n Terminals from a given Chomsky normal form grammar, the number of productions t
a. 2n−1
b. 2n
c. n+1
d. n^2
Answer: (a).2n−1
G1 : S → SbS | a
G2 : S → aB | ab, A→GAB | a, B→ABb | b
a. Only G1 is ambiguous
b. Only G2 is ambiguous
146. The set A={ 0^n 1^n 2^n | n=1, 2, 3, ......... } is an example of a grammar that is:
a. Context sensitive
b. Context free
c. Regular
c. Left-most derivation
d. Right-most derivation
S1 : There exists no algorithm for deciding if any two Turing machines M1 and M2 accept the same langua
S2 : The problem of determining whether a Turing machine halts on any input is undecidable.
c. Only S1 is correct
d. Only S2 is correct
149. Which of the following regular expressions, each describing a language of binary numbers (MSB to LSB) th
does not include even values? (Where {+, *} are quantification characters.)
a. 0*1+0*1*
b. 0*1*0+1*
c. 0*1*0*1+
d. 0+1*0*1*
Answer: (c).0*1*0*1+
Answer: (d).
151. Pumping lemma for regular language is generally used for proving:
154. The language L = {a^i b c^i | i ≥ 0} over the alphabet {a, b, c} is:
a. a regular language.
d. not recursive.
View Answer Report Discuss Too Difficult! Search Google
a. Concatenation
b. Complementation
c. Kleene Star
d. Union
Answer: (b).Complementation
L1 = {a^m b^n | m ≠ n}
L2 = {a^m b^n | m = 2n+1}
L3 = {a^m b^n | m ≠ 2n}
158. Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively
number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is
a. 5
b. 4
c. 3
d. 2
Answer: (c).
(1) From the options given below, the pair having different expressive power is
(A) Deterministic Push Down Automata (DPDA) and Non-deterministic Push Down
Automata (NPDA)
(B) Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata(NFA)
(C) Single tape turning machine and multi tape turning machine.
(D) Deterministic single tape turning machine and Non-Deterministic single tape
turning machine
(3) The language which is generated by the grammar S-> aSa I bSb I a I b over
the alphabet {a, b} is the set of
(A) Strings that begin and end with the same symbol
(B) All odd and even length palindromes
(C) All odd length palindromes
(D) All even length palindromes
(4) Two persons X and Y have been asked to show that a certain problem p is
NP-complete. X shows a polynomial time reduction from the 3-SAT problem to
p and Y shows a polynomial time reduction from p to 3-SAT. From these
reduction it can be inferred that
(A) π is NP-complete
(B) π is NP-hard but not NP-complete
(C) π is in NP but not NP-complete
(D) π is neither NP-hard nor in NP
ANSWER: π is NP-complete
(A) Q is NP-complete
(B) R is NP-complete
(C) Q is NP-hard
(D) R is NP-hard
ANSWER: R is NP-complete
(6) From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that is
recursively enumerable but not recursive is
(7) For the language {ap I P is a prime}, the statement which hold true is
ANSWER: It is neither regular nor context free, but accepted by a turing machine
(12) Let n be the positive integer constant and L be the language with alphabet
{a}. To recognize L the minimum number of states required in a DFA will be
(A) 2k + 1
(B) k + 1
(C) 2n + 1
(D) n + 1
ANSWER: n + 1
(A) Regular
(B) Deterministic context free
(C) Context free
(D) Recursive
ANSWER: Regular
(14) Which one of the following statement is true if L denotes the language
generated by the grammar S->0S0/00?
(15) Consider the regular expression 0 * (10 *) which is similar to the same set
as
(A) 0 + (0 + 10) *
(B) (0 +1) * 10 (0 + 1) *
(C) (1 * 0) * 1*
(D) None of the above
(16) W is any string whose length is n in {0, 1}* and L is the set of all sub-
strings of W. The minimum number of states in a non-deterministic finite
automaton that accepts L is
(A) n
(B) 2n
(C) n + 1
(D) n - 1
ANSWER: n + 1
(17) The DFA shown below accepts the set of all strings over {0, 1} that
(19) Consider a string s over (0+1)*. The number of 0’s in s is denoted by no(s)
and the number of 1’s in s is denoted by n1(s). The language that is not regular
is
(A) In Chomsky Normal Form the derivative trees of strings generated by a context-
free grammar are always binary trees
(B) If W is the string of a terminals and Y is a non-terminal, the language generated
by a context free grammar, all of whose productions are of the form x->W or X->WY
is always regular
(C) By using suitable transformation all ε-productions can be removed from any
context-free grammar.
(D) Every left recursive grammar can be converted to a right recursive grammar and
vice-versa
always regular
(21) State table of an FSM is given below. There are two states A And B, one
input and one output.
Let the initial state be A = 0 and B = 0. To take the machine to the state A = 0 and B
= 1 with output = 1 the minimum length of input string required will be
(A) 2
(B) 7
(C) 4
(D) 3
ANSWER: 3
(A) b*ab*ab*ab*
(B) b*a(a+b)*
(C) b*ab*ab*
(D) (a+b)*
ANSWER: b*a(a+b)*
(23) For the above FSA the equivalent minimum state automaton has the
following number of states
(A) 1
(B) 2
(C) 3
(D) 4
ANSWER: 2
(24) Out of the three decision problems P1, P2 and P3, P1 is decidable and P2
is undecidable. The statement that holds true is
a. G is ambiguous
b. G produces all strings with equal number of a’s and b’s.
c. Deterministic PDA accepts G
(26) The minimum number of states in any DFA accepting the regular language
L = (111+11111)* is
(A) 5
(B) 7
(C) 9
(D) 11
ANSWER: 9
(27) Consider the language L = {W I W ∈ {0, 1}*, where 0’s and 1’s in W are
divisible by 3 and 5 respectively. The minimum state deterministic finite
automaton accepting the language L has
(A) 20 states
(B) 5 states
(C) 10 states
(D) 15 states
ANSWER: 15 states
(28) We have an undirected graph G(V, E) with two problems given below:
α – Does G have an independent set of size IVI – 4?
β – Does G have an independent set of size 5?
The statement that holds true is
(29) Figure shows deterministic finite state automaton M. Let the set of seven
bit binary strings whose 1st, 4th and the last bits are 1 is denoted by S. How
many strings in S is accepted by M?
(A) 1
(B) 9
(C) 3
(D) 5
ANSWER: 5
(30) Which one of the following statement is true for a regular language L over
{a} whose minimal finite state automation has two states?
(32) Which one of the following is true for the language {am bn c m+n I m, n≥1}?
ANSWER: It is regular
We have a turing machine M over the input alphabet ∑, any state q of M and a word
W ∈ ∑*, does the computation of M on W visit the state q? The statement, which
holds true
about X, is
(35) The state diagram describes the finite state machine. A is the starting
state and an arc label is x/y where x stands for 1 bit input and y stands for 2 bit
output
ANSWER: It outputs the sum of the present and the previous bits of the input
(36) Which one of the following statement is true for the C language?
(A) It is a regular language
(B) It is context-sensitive language
(C) It is context-free language
(D) It is parsable fully only by a turing machine
(37) How many states are present in the smallest finite automaton which
accepts the language {x I length of x is divisible by 3}?
(A) 5
(B) 4
(C) 3
(D) 2
ANSWER: 4
(38) The last two symbols of L which is the set of all binary strings are same. In
the minimum state deterministic finite state automaton, which is accepting L
_____, states are present
(A) 4
(B) 6
(C) 3
(D) 5
ANSWER: 5
(40) Let n be the length of a character string. How many substrings (of all
lengths inclusive) can be formed from n?
(A) n(n-1)/2
(B) n²
(C) (n (n+1)/2) + 1
(D) n
ANSWER: (n (n+1)/2) + 1
(42) How many states are present in the minimum state finite automaton that
recognizes the language represented by the regular expression (0+1)(0+1)…..N
times?
(A) n+1
(B) n+2
(C) n
(D) 2n
ANSWER: n+2
(43) Consider the state table of a finite state machine that has input x and a
single output z. The shortest input sequence to reach the final state C if the
initial state is unknown is
(A) 10
(B) 01
(C) 101
(D) 110
ANSWER: 10
(44) The set that can be recognized by a deterministic finite state automaton is
a. (00)*( ε+0)
b. (00)*
c. 0*
d. 0(00)*
(A) b and c
(B) c and d
(C) a and b
(D) a and c
(46) L1 = Φ and L2 = {a} are the two languages. Out of the following four
options the one that represents L1L2* U L1* is
(A) Φ
(B) a*
(C) {ε}
(D) {ε, a}
ANSWER: {ε}
(47) We have the language L = {ab, aa, baa} and the four strings given below:
I) abaabaaabaa
II) aaaabaaaa
III) baaaaabaaaab
IV) baaaaabaa
(A) I, II and IV
(B) I, II and III
(C) II, III and IV
(D) I, III and IV
ANSWER: I, II and IV
(50) Which one of the following is applicable for context free languages?
(51) S -> a α b I b a c I ab
S -> α S I b
S -> α bb I ab
S -> bdb I b
(A) There exists an equivalent deterministic turing machine for every non-
deterministic turing machine
(B) Turing decidable languages are closed under intersection and complementation
(C) Turing recognizable languages are closed under union and intersection
(D) Turing recognizable languages are closed under union and complementation
(A) NP-hard = NP
(B) NP-complete ∩ P = Φ
(C) P=NP-complete
(D) NP-complete=NP
ANSWER: NP-complete ∩ P = Φ
FOR ALL SANFOUNDRY MCQ (1000+ MCQ)
JOIN telegram group >> https://t.me/edcsppu
Theory of Computation Questions and Answers –
Finite Automata-Introduction
Next »
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Finite
Automata-Introduction”.
1. Assume the R is a relation on a set A, aRb is partially ordered such that a and b are
_____________
a) reflexive
b) transitive
c) symmetric
d) reflexive and transitive
View Answer
Answer: d
Explanation: A partially ordered relation refers to one which is Reflexive, Transitive and
Antisymmetric.
advertisement
2. The non- Kleene Star operation accepts the following string of finite length over set A =
{0,1} | where string s contains even number of 0 and 1
a) 01,0011,010101
b) 0011,11001100
c) ε,0011,11001100
d) ε,0011,11001100
View Answer
Answer: b
Explanation: The Kleene star of A, denoted by A*, is the set of all strings obtained by
concatenating zero or more strings from A.
3. A regular language over an alphabet ∑ is one that cannot be obtained from the basic
languages using the operation
a) Union
b) Concatenation
c) Kleene*
d) All of the mentioned
View Answer
Answer: d
Explanation: Union, Intersection, Concatenation, Kleene*, Reverse are all the closure properties
of Regular Language.
4. Statement 1: A Finite automata can be represented graphically; Statement 2: The nodes can be
its states; Statement 3: The edges or arcs can be used for transitions
Hint: Nodes and Edges are for trees and forests too.
Which of the following make the correct combination?
a) Statement 1 is false but Statement 2 and 3 are correct
b) Statement 1 and 2 are correct while 3 is wrong
c) None of the mentioned statements are correct
d) All of the mentioned
View Answer
Answer: d
Explanation: It is possible to represent a finite automaton graphically, with nodes for states, and
arcs for transitions.
5. The minimum number of states required to recognize an octal number divisible by 3 are/is
a) 1
b) 3
c) 5
d) 7
View Answer
Answer: b
Explanation: According to the question, minimum of 3 states are required to recognize an octal
number divisible by 3.
advertisement
Answer: d
Explanation: A FA can be represented as FA= (Q, ∑, δ, q0, F) where Q=Finite Set of States,
∑=Finite Input Alphabet, δ=Transition Function, q0=Initial State, F=Final/Acceptance State).
7. If an Infinite language is passed to Machine M, the subsidiary which gives a finite solution to
the infinite input tape is ______________
a) Compiler
b) Interpreter
c) Loader and Linkers
d) None of the mentioned
View Answer
Answer: a
Explanation: A Compiler is used to give a finite solution to an infinite phenomenon. Example of
an infinite phenomenon is Language C, etc.
8. The number of elements in the set for the Language L={xϵ(∑r) *|length if x is at most 2} and
∑={0,1} is_________
a) 7
b) 6
c) 8
d) 5
View Answer
Answer: a
Explanation: ∑r= {1,0} and a Kleene* operation would lead to the following
set=COUNT{ε,0,1,00,11,01,10} =7.
9. For the following change of state in FA, which of the following codes is an incorrect option?
a) δ (m, 1) =n
b) δ (0, n) =m
c) δ (m,0) =ε
d) s: accept = false; cin >> char;
if char = “0” goto n;
View Answer
Answer: b
Explanation: δ(QX∑) = Q1 is the correct representation of change of state. Here, δ is called the
Transition function.
advertisement
Answer: b
Explanation: ∑* represents any combination of the given set while ∑x represents the set of
combinations with length x where x ϵ I.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Moore Machine”.
Answer: b
Explanation: Finite automaton with an output is categorize din two parts: Moore M/C and Mealy
M/C.
advertisement
Answer: b
Explanation: Moore machine produces an output over the change of transition states while
mealy machine does it so for transitions itself.
3. For a give Moore Machine, Given Input=’101010’, thus the output would be of length:
a) |Input|+1
b) |Input|
c) |Input-1|
d) Cannot be predicted
View Answer
Answer: a
Explanation: Initial state, from which the operations begin is also initialized with a value.
Answer: a
Explanation: Even ε, when passed as an input to Moore machine produces an output.
advertisement
5. The total number of states and transitions required to form a moore machine that will produce
residue mod 3.
a) 3 and 6
b) 3 and 5
c) 2 and 4
d) 2 and 5
View Answer
Answer: a
Explanation:
Present State
Next State
Output
0
1
Q0
Q1
Q2
1
Q1
Q2
advertisement
1
Q2
Q0
a) Q0, Q2, 0
b) Q0, Q2, 1
c) Q1, Q2, 1
d) Q1, Q0, 0
View Answer
Answer: a
Explanation: The table can be filled accordingly seeing the graph.
7. What is the output for the given language?
Language: A set of strings over ∑= {a, b} is taken as input and it prints 1 as an output “for every
occurrence of a, b as its substring. (INPUT: abaaab)
a) 0010001
b) 0101010
c) 0111010
d) 0010000
View Answer
Answer: a
Explanation: The outputs are as per the input, produced.
Answer: b
Explanation: Source-The tuple definition of Moore and mealy machine comprises one new
member i.e. output alphabet as these are finite machines with output.
advertisement
Answer: a
Explanation: Op(t)=δ(Op(t)) is the defined definition of how the output is received on giving a
specific input to Moore machine.
Answer: a
Explanation: Statement a and b is correct while c is false. Finite machines with output have no
accepting states and can be converted within each other.
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Mealy
Machine”.
Answer: c
Explanation: Definition of Mealy Machine.
advertisement
Answer: c
Explanation: Finite Automaton with Output has a common definition for both the categories.
a) 9’s Complement
b) 2’s Complement
c) 1’s Complement
d) 10’s Complement
View Answer
Answer: b
Explanation: The input can be taken in form of a binary string and can be verified.
Answer: b
Explanation: The output of mealy machine depends on the present state as well as the input to
that state.
advertisement
5.The ratio of number of input to the number of output in a mealy machine can be given as:
a) 1
b) n: n+1
c) n+1: n
d) None of the mentioned
View Answer
Answer: a
Explanation: The number of output here follows the transitions in place of states as in Moore
machine.
Answer: b
Explanation: They are collectively known as Transducers.
Answer: a
Explanation: Mealy and Moore machine vary over how the outputs depends on prior one
(transitions) and on the latter one(states).
advertisement
Answer: a
Explanation: Being an input dependent and output capable FSM, Mealy machine reacts faster to
inputs.
9. Which of the following does the given Mealy machine represents?
a) 9’s Complement
b) 2’s Complement
c) 1’s Complement
d) 10’s Complement
View Answer
Answer: c
Explanation: Inputs can be taken and can be verified.
Answer: d
Explanation: It does not produce a language or a grammar or can be converted to a NFA.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Mealy
Machine-II”.
1. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e
d) none of the mentioned
View Answer
Answer: c
Explanation: The automaton may be allowed to change its state without reading the input
symbol using epsilon but this does not mean that epsilon has become an input symbol. On the
contrary, one assumes that the symbol epsilon does not belong to any alphabet.
advertisement
Answer: b
Explanation:
Answer: b
Explanation: An e-NFA consist of 5 tuples: A=(Q, S, d, q0. F)
Note: e is never a member of S.
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend
the class of languages that can be represented.
advertisement
Answer: c
Explanation: It is more convenient to simulate a machine using e-NFA else the method of Power
Construction is used from the union-closure of DFA’s.
Answer: b
Explanation: The epsilon closure of the set q is the set that contains q, together with all the states
which can be reached starting at q by following only epsilon transitions.
a) 0
b) 1
c) 2
d) 3
View Answer
Answer: c
Explanation: The epsilon closure set of f2 consist of the elements:{f2, f3}. Thus the count of the
element in the closure set is 2.
advertisement
8. Which of the steps are non useful while eliminating the e-transitions for the given diagram?
Answer: d
Explanation: The given are the steps followed while eliminating epsilon transitions from a NFA
or converting an e-NFA to just NFA.
9. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no
View Answer
Answer: a
Explanation: Yes, the language is preserved during the dteps of construction:
L(N)=L(N1)=L(N2)=L(3).
10. Remove all the epsilon transitions in the given diagram and compute the number of a-
transitions in the result?
a) 5
b) 7
c) 9
d) 6
View Answer
Answer: b
Explanation:
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Interview Questions and Answers focuses on “Deterministic Finite
Automata-Introduction and Definition”.
Answer: b
Explanation: Bounded information refers to one whose output is limited and it cannot be said
what were the recorded outputs previously until memorized.
advertisement
Answer: b
Explanation: A language for which there is no existence of a deterministic finite automata is
always Non Regular and methods like Pumping Lemma can be used to prove the same.
Answer: d
Explanation: A DFA can be represented in the following formats: Transition Graph, Transition
Table, Transition tree/forest/Any programming Language.
Answer: a
Explanation: Strings such as {1101,101,10101} are being accepted while {1001,11001} are not.
Thus, this conclusion leads to option a.
advertisement
Answer: c
Explanation: Two states are said to be equivalent if and only if they have same number of states
as well as transitions.
Answer: c
Explanation: The figure represents the initial as well as the final state with an iteration of x.
Answer: a
Explanation: All the Strings are getting accepted except ‘ababaabaa’ as it is directed to dumping
state. Dumping state also refers to the reject state of the automata.
advertisement
a) ε
b) 11010
c) 10001010
d) String of letter count 11
View Answer
Answer: a
Explanation: As the initial state is not made an acceptance state, thus ε will not be accepted by
the given DFA. For the automata to accept ε as an entity, one should make the initial state as
also the final state.
Answer: b
Explanation: Language to accept a palindrome number or string will be non-regular and thus, its
DFA cannot be obtained. Though, PDA is possible.
10. Which of the following is not an example of finite state machine system?
a) Control Mechanism of an elevator
b) Combinational Locks
c) Traffic Lights
d) Digital Watches
View Answer
Answer: d
Explanation: Proper and sequential combination of events leads the machines to work in hand
which includes The elevator, Combinational Locks, Traffic Lights, vending machine, etc. Other
applications of Finite machine state system are Communication Protocol Design, Artificial
Intelligence Research, A Turnstile, etc.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “DFA
Processing Strings”.
1. The password to the admins account=”administrator”. The total number of states required to
make a password-pass system using DFA would be __________
a) 14 states
b) 13 states
c) 12 states
d) A password pass system cannot be created using DFA
View Answer
Answer: a
Explanation: For a string of n characters with no repetitive substrings, the number of states
required to pass the string is n+1.
advertisement
Answer: b
Explanation: The Language can be anonymously checked and thus the answer can be predicted.
The language needs to be accepted by the automata (acceptance state) in order to prove its
regularity.
3. Let ∑= {a, b, …. z} and A = {Hello, World}, B= {Input, Output}, then (A*∩B) U (B*∩A)
can be represented as:
a) {Hello, World, Input, Output, ε}
b) {Hello, World, ε}
c) {Input, Output, ε}
d) {}
View Answer
Answer: d
Explanation: Union operation creates the universal set by combining all the elements of first and
second set while intersection operation creates a set of common elements of the first and the
second state.
4. Let the given DFA consist of x states. Find x-y such that y is the number of states on
minimization of DFA?
a) 3
b) 2
c) 1
d) 4
View Answer
Answer: b
Explanation: Use the equivalence theorem or Myphill Nerode theorem to minimize the DFA.
advertisement
5. For a machine to surpass all the letters of alphabet excluding vowels, how many number of
states in DFA would be required?
a) 3
b) 2
c) 22
d) 27
View Answer
Answer: a
Explanation:
Answer: d
Explanation: The string a state receives is the combination of all input alphabets which lie across
the path covered.
Answer: b
Explanation: DFA can be made for infinite language with an infinite length. Thus, dependency
over length is unfruitful.
advertisement
8. Given:
L= {xϵ∑= {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?
a) Yes
b) No
View Answer
Answer: b
Explanation: It is not possible to have a count of equal number of 0 and 1 at any instant in DFA.
Thus, It is not possible to build a DFA for the given Language.
9. δ(A,1) = B, δ(A,0) =A
Δ (B, (0,1)) =C
δ(C,0) = A (Initial state =A)
String=”011001” is transit at which of the states?
a) A
b) C
c) B
d) Invalid String
View Answer
Answer: a
Explanation: It is east and simple to create the table and then the corresponding transition graph
in order to get the result, at which state the given string would be accepted.
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Simpler Notations”.
1.Given Language: L= {xϵ∑= {a, b} |x has a substring ‘aa’ in the production}. Which of the
corresponding representation notate the same?
a)
advertisement
b)
c)
d)
View Answer
Answer: a
Explanation: The states transited has been written corresponding to the transitions as per the row
and column. The row represents the transitions made and the ultimate.
2.Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information
what is the identity element for the string?
a) u-1
b) v-1
c) u-1v-1
d) ε
View Answer
Answer: d
Explanation: Identity relation: εw = wε = w, thus the one satisfying the given relation will be the
identity element.
advertisement
Answer: c
Explanation: The given DFA notation accepts the string of even length and prefix ‘01’.
4.Predict the following step in the given bunch of steps which accepts a strings which is of even
length and has a prefix=’01’
δ (q0, ε) =q0 < δ(q0,0) =δ (δ (q0, ε),0) =δ(q0,0) =q1 < _______________
a) δ (q0, 011) =δ (δ (q0,1), 1) =δ (q2, 1) =q3
b) δ (q0, 01) =δ (δ (q0, 0), 1) = δ (q1, 1) =q2
c) δ (q0, 011) =δ (δ (q01, 1), 1) =δ (q2, 0) =q3
d) δ (q0, 0111) =δ (δ (q0, 011), 0) = δ (q3, 1) =q2
View Answer
Answer: b
Explanation: Here, δ refers to transition function and results into new state or function when an
transition is performed over its state.
a) Q0
b) Q1
c) Q2
d) No Transition
View Answer
Answer: Q1
Explanation: The tabular representation of DFA is quite readable and can be used to some ore
complex problems. Here, we need to form the transition graph and fill up the given blank.
advertisement
6.Which among the following is the missing transition in the given DFA?
L= {xϵ∑= {a, b} | x starts with a and ends with b}
a) δ (q0, a) =q0
b) δ (F, a) =q1
c) δ (F, a) =D
d) δ (q1, a) =D
View Answer
Answer: b
Explanation: For the given Language, the transition missing is δ (F, a) =q1.
7.The complement of a language will only be defined when and only when the __________ over
the language is defined.
a) String
b) Word
c) Alphabet
d) Grammar
View Answer
Answer: c
Explanation: It is not possible to define the complement of a language without defining the input
alphabets. Example: A language which does not consist of substring ‘ab’ while the complement
would be the language which does contain a substring ‘ab’.
Answer: Factorial
Explanation: Factorial, here is the most appropriate non-infinite domain. Otherwise, palindrome
and reverse have infinite domains.
9.Which among the following states would be notated as the final state/acceptance state?
L= {xϵ∑= {a, b} | length of x is 2}
a) q1
b) q2
c) q1, q2
d) q3
View Answer
Answer: b
Explanation: According to the given language, q2 Is to become the final/acceptance state in
order to satisfy.
advertisement
10.Which of the following are the final states in the given DFA according to the Language
given.?
L= {xϵ∑= {a, b} |length of x is at most 2}
a) q0, q1
b) q0, q2
c) q1, q2
d) q0, q1, q2
View Answer
Answer: d
Explanation: According to the given language, the length is at most 2, thus the answer is found
accordingly.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The
Language of DFA”
Answer: d
Explanation: A language over an alphabet R is a set of strings over A which is uncountable and
infinite.
advertisement
Answer: b
Explanation: Q is the Finite set of states, whose elements i.e. the states constitute the finite
automata.
Answer: a
Explanation: δ or the Transition function describes the best, how a DFA behaves on a string
where to transit next, which direction to take.
Answer: b
Explanation: As the question has dot operation, ε will not be a part of the concatenated set. Had
it been a union operation, ε would be a part of the operated set.
advertisement
5. For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all
the possible remainders?
a) 0
b) 0,2
c) 0,2,4
d) 0,1,2,3
View Answer
Answer: d
Explanation: All the decimal numbers on division would lead to only 4 remainders i.e. 0,1,2,3
(Property of Decimal division).
6. Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?
a) divisible by 3
b) divisible by 2
c) divisible by 2 and 3
d) divisible by 3 and 2
View Answer
Answer: d
Explanation: The given DFA accepts all the binary strings such that they are divisible by 3 and
2.Thus, it can be said that it also accepts all the strings which is divisible by 6.
7. Given:
L1= {xϵ ∑*|x contains even no’s of 0’s}
L2= {xϵ ∑*|x contains odd no’s of 1’s}
No of final states in Language L1 U L2?
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation:
advertisement
8. The maximum number of transition which can be performed over a state in a DFA?
∑= {a, b, c}
a) 1
b) 2
c) 3
d) 4
View Answer
Answer: c
Explanation: The maximum number of transitions which a DFA allows for a language is the
number of elements the transitions constitute.
9. The maximum sum of in degree and out degree over a state in a DFA can be determined as:
∑= {a, b, c, d}
a) 4+4
b) 4+16
c) 4+0
d) depends on the Language
View Answer
Answer: d
Explanation: The out degree for a DFA I fixed while the in degree depends on the number of
states in the DFA and that cannot be determined without the dependence over the Language.
10. The sum of minimum and maximum number of final states for a DFA n states is equal to:
a) n+1
b) n
c) n-1
d) n+2
View Answer
Answer: a
Explanation: The maximum number of final states for a DFA can be total number of states itself
and minimum would always be 1, as no DFA exits without a final state. Therefore, the solution
is n+1.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Regular Language & Expression”.
Answer:b
Explanation: States, input symbols,initial state,accepting state and transition function.
advertisement
Answer:d
Explanation: Inputs are state and input string output is states.
Answer:a
Explanation: This is minimal finite automata.
Answer:a
Explanation: This takes single state and string of input to produce a state.
5. δ*(q,ya) is equivalent to .
a) δ((q,y),a)
b) δ(δ*(q,y),a)
c) δ(q,ya)
d) independent from δ notation
View Answer
Answer:b
Explanation: First it parse y string after that it parse a.
advertisement
Answer:c
Explanation: If automata starts with starting state and after finite moves if reaches to final step
then it called accepted.
7. Languages of a automata is
a) If it is accepted by automata
b) If it halts
c) If automata touch final state in its life time
d) All language are language of automata
View Answer
Answer:a
Explanation: If a string accepted by automata it is called language of automata.
Answer:d
Explanation: According to Chomsky classification.
Answer:b
Explanation: Finite automata doesn’t require any stack operation .
advertisement
Answer:d
Explanation: No final state requires.
11. Regular expression for all strings starts with ab and ends with bba is.
a) aba*b*bba
b) ab(ab)*bba
c) ab(a+b)*bba
d) All of the mentioned
View Answer
Answer:c
Explanation: Starts with ab then any number of a or b and ends with bba.
12. How many DFA’s exits with two states over input alphabet {0,1} ?
a) 16
b) 26
c) 32
d) 64
View Answer
Answer:d
Explanation: Number of DFA’s = 2n * n(2*n).
Answer:a
Explanation:Because there is no memory associated with automata.
advertisement
14. Number of states require to simulate a computer with memory capable of storing ‘3’ words
each of length ‘8’.
a) 3 * 28
b) 2(3*8)
c) 2(3+8)
d) None of the mentioned
View Answer
Answer:b
Explanation: 2(m*n) states requires .
15. FSM with output capability can be used to add two given integer in binary representation.
This is
a) True
b) False
c) May be true
d) None of the mentioned
View Answer
Answer:a
Explanation: Use them as a flip flop output .
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non
Deterministic Finite Automata – Introduction”
Answer: a
Explanation: Statement 1 and 2 always true for a given Language.
advertisement
Answer: a
Explanation: Construct the DFA and NFA individually, and the attain the difference of states.
3. An automaton that presents output based on previous state or current input:
a) Acceptor
b) Classifier
c) Transducer
d) None of the mentioned.
View Answer
Answer: c
Explanation: A transducer is an automaton that produces an output on the basis of what input
has been given currently or previous state.
4. If NFA of 6 states excluding the initial state is converted into DFA, maximum possible
number of states for the DFA is ?
a) 64
b) 32
c) 128
d) 127
View Answer
Answer: c
Explanation: The maximum number of sets for DFA converted from NFA would be not greater
than 2n.
Answer: b
Explanation: Non deterministic or deterministic depends upon the definite path defined for the
transition from one state to another or undefined(multiple paths).
advertisement
Answer: b
Explanation: DFA is a specific case of NFA.
Answer: a
Explanation: The individual Transition graphs can be made and the difference of transitions can
be determined.
8. The construction time for DFA from an equivalent NFA (m number of node)is:
a) O(m2)
b) O(2m)
c) O(m)
d) O(log m)
View Answer
Answer: b
Explanation: From the coded NFA-DFA conversion.
advertisement
9. If n is the length of Input string and m is the number of nodes, the running time of DFA is x
that of NFA.Find x?
a) 1/m2
b) 2m
c) 1/m
d) log m
View Answer
Answer: a
Explanation: Running time of DFA: O(n) and Running time of NFA =O(m2n).
Answer: c
Explanation: NFA, while computing strings, take parallel paths, make different copies of input
and goes along different paths in order to search for the result. This creates the difference in
processing speed of DFA and NFA.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Automata Theory Questions and Answers – Finite Automata
» Next - Automata Theory Questions and Answers – Extended Transition Function
Categories Automata Theory MCQsPost navigation
Geotechnical Engineering Questions and Answers – Terzaghi’s Analysis
Automata Theory Questions and Answers – Extended Transition Function
advertisement
advertisement
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Extended Transition Function”.
a) Correct
b) Incorrect, Incomplete DFA
c) Wrong proposition
d) May be correct
View Answer
Answer: c
Explanation: The given figure is an NFA. The statement contradicts itself.
Answer: c
Explanation: q3 does not belong to Q where Q= set of finite states.
4. If δ is the transition function for a given NFA, then we define the δ’ for the DFA accepting
the same language would be:
Note: S is a subset of Q and a is a symbol.
a) δ’ (S, a) =Upϵs δ (p, a)
b) δ’ (S, a) =Up≠s δ (p, a)
c) δ’ (S, a) =Upϵs δ(p)
d) δ’ (S) =Up≠s δ(p)
View Answer
Answer: a
Explanation: According to subset construction, equation 1 holds true.
5. What is the relation between DFA and NFA on the basis of computational power?
a) DFA > NFA
b) NFA > DFA
c) Equal
d) Can’t be said
View Answer
Answer: c
Explanation: DFA is said to be a specific case of NFA and for every NFA that exists for a given
language, an equivalent DFA also exists.
advertisement
6. If a string S is accepted by a finite state automaton, S=s1s2s3……sn where siϵ∑ and there
exists a sequence of states r0, r1, r2…… rn such that δ(r(i), si+1) =ri+1 for each 0, 1, …n-1, then
r(n) is:
a) initial state
b) transition symbol
c) accepting state
d) intermediate state
View Answer
Answer: c
Explanation: r(n) is the final state and accepts the string S after the string being traversed
through r(i) other states where I ϵ 01,2…(n-2).
7. According to the given table, compute the number of transitions with 1 as its symbol but not
0:
a) 4
b) 3
c) 2
d) 1
View Answer
Answer: d
Explanation: The transition graph is made and thus the answer can be found.
a) {q0}
b) {q1} U {q0, q1, q2}
c) {q2, q1}
d) {q3, q1, q2, q0}
View Answer
Answer: b
Explanation: δ*(q0,011) = Urϵδ*(q0,01) δ (r, 1) = {q0, q1, q2}.
9. Number of times the state q3 or q2 is being a part of extended 6 transition state is
a) 6
b) 5
c) 4
d) 7
View Answer
Answer: a
Explanation: According to the question, presence of q2 or q1 would count so it does and the
answer according to the diagram is 6.
advertisement
1.Δ(Q0, ε) ={Q0},
2.Δ(Q0, 01) = {Q0, Q1}
3.δ(Q0, 010) =?
Answer: c
Explanation: According to given table and extended transition state implementation, we can find
the state at which it rests.
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: a
Explanation: The conversion of a non-deterministic automata into a deterministic one is a
process we call subset construction or power set construction.
advertisement
2. Given Language:
Ln= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}
How many state are required to execute L3 using NFA?
a) 16
b) 15
c) 8
d) 7
View Answer
Answer: b
Explanation: The finite automaton for the given language is made and thus, the answer can be
obtained.
4. The number of transitions required to convert the following into equivalents DFA:
a) 2
b) 3
c) 1
d) 0
View Answer
Answer: a
Explanation:
advertisement
Answer: a
Explanation: If L is a regular Language, Lc and Lr both are regular even.
Answer: b
Explanation: REJECT state will be like a halting state which rejects a particular invalid input.
Answer: a
Explanation: We can represent one language in more one FSMs, example for a same language
we have a DFA and an equivalent NFA.
advertisement
Answer: b
Explanation: The production of form non-terminal ->ε is call null production.
Answer: d
Explanation: DFSM’s for the first three option is not possible; hence they aren’t regular.
10. Which of the following recognizes the same formal language as of DFA and NFA?
a) Power set Construction
b) Subset Construction
c) Robin-Scott Construction
d) All of the mentioned
View Answer
Answer: d
Explanation: All the three option refers to same technique if distinguishing similar constructions
for different type of automata.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Equivalence of NFA and DFA”.
2. It is less complex to prove the closure properties over regular languages using
a) NFA
b) DFA
c) PDA
d) Can’t be said
View Answer
Answer: a
Explanation: We use the construction method to prove the validity of closure properties of
regular languages. Thus, it can be observe, how tedious and complex is the construction of a
DFA as compared to an NFA with respect to space.
Answer: d
Explanation: There are many applications of finite automata, mainly in the field of Compiler
Design and Parsers and Search Engines.
4. John is asked to make an automaton which accepts a given string for all the occurrence of
‘1001’ in it. How many number of transitions would John use such that, the string processing
application works?
a) 9
b) 11
c) 12
d) 15
View Answer
Answer: a
Explanation:
advertisement
Answer: c
Explanation: Thompson Construction method is used to turn a regular expression in an NFA by
fragmenting the given regular expression through the operations performed on the input
alphabets.
6. Which among the following can be an example of application of finite state machine(FSM)?
a) Communication Link
b) Adder
c) Stack
d) None of the mentioned
View Answer
Answer: a
Explanation: Idle is the state when data in form of packets is send and returns if NAK is
received else waits for the NAK to be received.
Answer: d
Explanation: Finite state automation is used in Lexical Analyser, Computer BOT (used in
games), State charts, etc.
advertisement
9. Predict the number of transitions required to automate the following language using only 3
states:
L= {w | w ends with 00}
a) 3
b) 2
c) 4
d) Cannot be said
View Answer
Answer: a
Explanation:
10. The total number of states to build the given language using DFA:
L= {w | w has exactly 2 a’s and at least 2 b’s}
a) 10
b) 11
c) 12
d) 13
View Answer
Answer: a
Explanation: We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus,
using this condition a finite automata can be created using 1 states.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: c
Explanation: The DFA for the given language can be constructed as follows:
advertisement
Answer: a
Explanation: If the string is divisible by four, it surely ends with the substring ‘100’ while a
binary string divisible by 2 would surely end with the substring ‘10’.
3. Let L be a language whose FA consist of 5 acceptance states and 11 non final states. It further
consists of a dumping state. Predict the number of acceptance states in Lc.
a) 16
b) 11
c) 5
d) 6
View Answer
Answer: a
Explanation: If L leads to FA1, then for Lc, the FA can be obtained by exchanging the final and
non-final states.
Answer: a
Explanation: When set operation ‘-‘ is performed between two sets, it points to those values of
prior set which belongs to it but not to the latter set analogous to basic subtraction operation.
6. Which among the following NFA’s is correct corresponding to the given Language?
L= {xϵ {0, 1} | 3rd bit from right is 0}
a)
b)
c)
d) None of the mentioned
View Answer
Answer: a
Explanation: The NFA accepts all binary strings such that the third bit from right end is 1 and if
not, is send to Dumping state. Note: It is assumed that the input is given from the right end bit
by bit.
Answer: c
Explanation: While the machine runs on some input string, if it has the choice to split, it goes in
all possible way and each one is different copy of the machine. The machine takes subsequent
choice to split further giving rise to more copies of the machine getting each copy run parallel. If
any one copy of the machine accepts the strings, then NFA accepts, otherwise it rejects.
advertisement
Answer: a
Explanation: If K is the number of states in NFA, the DFA simulating the same language would
have states equal to or less than 2k.
9. Let N (Q, ∑, δ, q0, A) be the NFA recognizing a language L. Then for a DFA (Q’, ∑, δ’, q0’,
A’), which among the following is true?
a) Q’ = P(Q)
b) Δ’ = δ’ (R, a) = {q ϵ Q | q ϵ δ (r, a), for some r ϵ R}
c) Q’={q0}
d) All of the mentioned
View Answer
Answer: d
Explanation: All the optioned mentioned are the instruction formats of how to convert a NFA to
a DFA.
10. There exists an initial state, 17 transition states, 7 final states and one dumping state, Predict
the maximum number of states in its equivalent DFA?
a) 226
b) 224
c) 225
d) 223
View Answer
Answer: a
Explanation: The maximum number of states an equivalent DFA can comprise for its respective
NFA with k states will be 2k.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory test focuses on “Finite Automata with Epsilon Transition”.
1. According to the given transitions, which among the following are the epsilon closures of q1
for the given NFA?
Δ (q1, ε) = {q2, q3, q4}
Δ (q4, 1) =q1
Δ (q1, ε) =q1
a) q4
b) q2
c) q1
d) q1, q2, q3, q4
View Answer
Answer: d
Explanation: The set of states which can be reached from q using ε-transitions, is called the ε-
closure over state q.
advertisement
Answer: a
Explanation: It is possible to construct an NFA with ε-transitions, presence of no input symbols,
and that is called NFA with ε-moves.
3. State true or false?
Statement: ε (Input) does not appears on Input tape.
a) True
b) False
Answer: a
View Answer
Explanation: ε does not appears on Input tape, ε transition means a transition without scanning a
symbol i.e. without moving the read head.
Answer: c
Explanation: The transition with ε leads to a jump but without any shift in read head. Further,
the method can be called one to introduce hidden non-determinism.
Answer: c
Explanation: ε-closure is defined as the set of states being reached through ε-transitions from a
starting state.
advertisement
6. Predict the total number of final states after removing the ε-moves from the given NFA?
a) 1
b) 2
c) 3
d) 0
View Answer
Answer: c
Explanation: The NFA which would result after eliminating ε-moves can be shown
diagramatically.
Answer: a
Explanation: Due to the presence of ε symbol, or rather an epsilon-move, the input alphabets
unites with it to form a set including ε.
Answer: d
Explanation: All the mentioned are the closure properties of ε and encircles all the elements if it
satisfies the following options:
a) Every element of S ϵ Q
b) For any q ϵ ε(S), every element of δ (q, ε) is in ε(S)
c) No other element is in ε(S)
9. The automaton which allows transformation to a new state without consuming any input
symbols:
a) NFA
b) DFA
c) NFA-l
d) All of the mentioned
View Answer
Answer: c
Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are
usually called NFA with epsilon moves or lambda transitions.
advertisement
Answer: b
Explanation: An epsilon move is a transition from one state to another that doesnt require any
specific condition.
11. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from
any state in P following e-transitions.
a) e-closure
b) e-pack
c) Q in the tuple
d) None of the mentioned
View Answer
Answer: a
Explanation: The e-closure of a set of states, P, of an NFA is defined as the set of states
reachable from any state in P following e-transitions.
Answer: d
Explanation: The languages which are recognized by an epsilon Non deterministic automata are
closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Negation
e) Star
f) Kleene closure
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Uses
of Epsilon-Transitions”.
1. The automaton which allows transformation to a new state without consuming any input
symbols:
a) NFA
b) DFA
c) NFA-l
d) All of the mentioned
View Answer
Answer: c
Explanation: NFA-l or e-NFA is an extension of Non deterministic Finite Automata which are
usually called NFA with epsilon moves or lambda transitions.
advertisement
2. e-transitions are
a) conditional
b) unconditional
c) input dependent
d) none of the mentioned
View Answer
Answer: b
Explanation: An epsilon move is a transition from one state to another that doesn’t require any
specific condition.
3. The __________ of a set of states, P, of an NFA is defined as the set of states reachable from
any state in P following e-transitions.
a) e-closure
b) e-pack
c) Q in the tuple
d) None of the mentioned
View Answer
Answer: a
Explanation: The e-closure of a set of states, P, of an NFAis defined as the set of states
reachable from any state in P following e-transitions.
Answer: The languages which are recognized by an epsilon Non deterministic automata are
closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Negation
e) Star
f) Kleene closure
advertisement
5. Is the language preserved in all the steps while eliminating epsilon transitions from a NFA?
a) yes
b) no
View Answer
Answer: a
Explanation: Yes, the language is preserved during the dteps of construction:
L(N)=L(N1)=L(N2)=L(3).
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend
the class of languages that can be represented.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Epsilon Closures”.
1. Which of the following does not belong to input alphabet if S={a, b}* for any language?
a) a
b) b
c) e
d) none of the mentioned
View Answer
Answer: c
Explanation: The automaton may be allowed to change its state without reading the input
symbol using epsilon but this does not mean that epsilon has become an input symbol. On the
contrary, one assumes that the symbol epsilon does not belong to any alphabet.
advertisement
Answer: a
Explanation: e-NFA do come up with a convenient feature but nothing new.They do not extend
the class of languages that can be represented.
Answer: c
Explanation: It is more convenient to simulate a machine using e-NFA else the method of Power
Construction is used from the union-closure of DFA’s.
advertisement
5. Which of the following belongs to the epsilon closure set of a?
Answer: b
Explanation: The epsilon closure of the set q is the set that contains q, together with all the states
which can be reached starting at q by following only epsilon transitions.
a) 0
b) 1
c) 2
d) 3
View Answer
Answer: c
Explanation: The epsilon closure set of f2 consist of the elements:{f2, f3}. Thus the count of the
element in the closure set is 2.
7. Which of the steps are non useful while eliminating the e-transitions for the given diagram?
Answer: d
Explanation: The given are the steps followed while eliminating epsilon transitions from a NFA
or converting an e-NFA to just NFA.
advertisement
8. Remove all the epsilon transitions in the given diagram and compute the number of a-
transitions in the result?
a) 5
b) 7
c) 9
d) 6
View Answer
Answer: b
Explanation:
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Automata Theory Questions and Answers – Uses of Epsilon-Transitions
» Next - Automata Theory Questions and Answers – Union, Intersection & Complement
Categories Automata Theory MCQsPost navigation
Geotechnical Engineering Questions and Answers – Bearing Capacity – Permissible Total and
Differential Settlements
Automata Theory Questions and Answers – Union, Intersection & Complement
advertisement
advertisement
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Union, intersection and complement of Regular Language & Expression”.
Answer:a
Explanation: Regular sets are closed under these three operation.
advertisement
Answer:c
Explanation: String accepted in previous DFA will not be accepted and non accepting string will
be accepted .
Answer:a
Explanation: Regular sets are closed under complement operation.
Answer:a
Explanation: Regular expression are also colsed under intersection.
Answer:d
Explanation: Regular is closed under difference.
advertisement
6. Reverse of a DFA can be formed by
a) using PDA
b) making final state as non-final
c) making final as starting state and starting state as final state
d) None of the mentioned
View Answer
Answer:c
Explanation: By making final state as starting state string starting from end will be accepted.
Answer:c
Explanation: There is only one state which is start and final state of DFA so interchanging
starting start and final state doesn’t change DFA.
Answer:c
Explanation: This operation replace using a function .
Answer:c
Explanation: Regular set are closed under homomorphism.
advertisement
Answer:d
Explanation: Only d is regular language.
Answer:d
Explanation: It is a regular expression.
Answer:d
Explanation: It is a regular expression.
advertisement
Answer:d
Explanation: It is a regular expression.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: a
Explanation: According to Myhill Nerode theorem, the corollary proves the given statement
correct for equivalence classes.
advertisement
2. A language can be generated from simple primitive language in a simple way if and only if
a) It is recognized by a device of infinite states
b) It takes no auxiliary memory
c) Both are correct
d) Both are wrong
View Answer
Answer: b
Explanation: A language is regular if and only if it can be accepted by a finite automaton.
Secondly, It supports no concept of auxiliary memory as it loses the data as soon as the device is
shut down.
Answer: d
Explanation: The given option represents {0, 01} in different forms using set operations and
Regular Expressions. The operator like ^, v, etc. are logical operation and they form invalid
regular expressions when used.
4. According to the given language, which among the following expressions does it corresponds
to?
Language L={xϵ{0,1}|x is of length 4 or less}
a) (0+1+0+1+0+1+0+1)4
b) (0+1)4
c) (01)4
d) (0+1+ε)4
View Answer
Answer: d
Explanation: The extended notation would be (0+1)4 but however, we may allow some or all the
factors to be ε. Thus ε needs to be included in the given regular expression.
advertisement
Answer: a
Explanation: The given regular expression corresponds to a language of binary strings which is
of even length including a length of 0.
6. If R represents a regular language, which of the following represents the Venn-diagram most
correctly?
a) An Irregular Set
b) R*
c) R complement
d) R reverse
View Answer
Answer: b
Explanation: The given diagram represents the Kleene operation over the Regular Language R
in which the final states become the initial and the initial state becomes final.
Answer: a
Explanation: The transition states shown are the result of breaking down the given regular
expression in fragments. For dot operation, we change a state, for union (plus) operation, we
diverge into two transitions and for Kleene Operation, we apply a loop.
Answer: b
Explanation: Two operands are said to be performing Concatenation operation AB = A•B = {xy:
x ∈ A & y ∈ B}.
advertisement
Answer: b
Explanation: By distributive property (Regular expression identities), we can prove the given
identity to be Ф.
Answer: a
Explanation: RR*=R+ as R+ means the occurrence to be at least once.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Operators of Regular Expression”.
Answer: d
Explanation: There are few identities over Regular Expressions which include: RФ=ФR=Ф≠R
Answer: a
Explanation: ε+1*(011) *(1*(011) *) *
ε + RR*= ε + R*R= ε + R+= R*
a) Q*P
b) QP*
c) Q*P*
d) (P*O*) *
View Answer
Answer: b
Explanation: The given statement is the Arden’s Theorem and it tends to have a unique solution
as QP*.
Let P and Q be regular expressions,
R=Q+RP
R=Q+(Q+RP) P
R=Q+((Q+RP) +RP) +P=Q+QP+RPP+RPP=Q+QP+(Q+RP) PP+(Q+RP)
PP=Q+QP+QPP+RPPP+QPP+RPPP,
If we do this recursively, we get:
R= QP*
advertisement
Answer: c
Explanation: Arden’s theorem strictly assumes the following;
a) No null transitions in the transition diagrams
b) True for only single initial state
6. The difference between number of states with regular expression (a + b) and (a + b) * is:
a) 1
b) 2
c) 3
d) 0
View Answer
Answer: a
Explanation:
7. In order to represent a regular expression, the first step to create the transition diagram is:
a) Create the NFA using Null moves
b) Null moves are not acceptable, thus should not be used
c) Predict the number of states to be used in order to construct the Regular expression
d) None of the mentioned
View Answer
Answer: a
Explanation: Two steps are to be followed while converting a regular expression into a
transition diagram:
a) Construct the NFA using null moves.
b) Remove the null transitions and convert it into its equivalent DFA.
Answer: a
Explanation: The regular expression is fragmented and the set of the strings eligible is formed.
‘+’ represents union while ‘.’ Represents concatenation.
advertisement
9. The minimum number of states required to automate the following Regular Expression:
(1) *(01+10) (1) *
a) 4
b) 3
c) 2
d) 5
View Answer
Answer: a
Answer: a
Explanation: Regular Expression denote precisely the class of regular language. Given any
regular expression, L(R) is a regular language. Given any regular language L, there is a regular
expression R, such that L(R)=L.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: a
Explanation: ε represents a single string in the set namely, the empty string while Statement 2 is
also correct.
advertisement
Answer: c
Explanation: If a regular language expression is given, the appropriate order of precedence if the
parenthesis is ignored is: Star or Kleene, Dot or Concatenation, Union or Plus.
Answer: c
Explanation: When we wish to distinguish between a regular expression R and the language it
represents; we write L(R) to be the language of R.
Answer: b
Explanation: This regular expression can be used to eliminate the answers and get the result.
The length can be even and as well more than 3 when R= (∑∑∑) (∑∑∑) (particular case).
Answer: a
Explanation: The star operation brings together any number of strings from the language to get a
string in the result. If the language is empty, the star operation can put together 0 strings,
resulting only the empty string.
advertisement
Answer: a
Explanation: The Regular expression (ab U a) * is converted to NFA in a sequence of stages as
it can be clearly seen in the diagram. This NFA consist of 8 stated while its minimized form
only contains 2 states.
7. Which of the following represents a language which has no pair of consecutive 1’s if ∑=
{0,1}?
a) (0+10)*(1+ε)
b) (0+10)*(1+ε)*
c) (0+101)*(0+ε)
d) (1+010)*(1+ε)
View Answer
Answer: a
Explanation: All the options except ‘a’ accept those strings which comprises minimum one pair
of 1’s together.
Answer: c
Explanation: A finite automaton accepts the languages which are regular and for which a DFA
can be constructed.
Answer: d
Explanation: Following the rules of precedence, Kleene or star operation would be done first,
then concatenation and finally union or plus operation.
advertisement
10. Which of the following regular expressions represents the set of strings which do not contain
a substring ‘rt’ if ∑= {r, t}
a) (rt)*
b) (tr)*
c) (r*t*)
d) (t*r*)
View Answer
Answer: d
Explanation: As Kleene operation is not on the whole of the substring, it will not repeat and
maintain the order of t, r.
11. According to the precedence rules, x-y-z is equivalent to which of the following?
a) (x-y)-z
b) x-(y-z)
c) Both (x-y)-z and x-(y-z)
d) None of the mentioned
View Answer
Answer: a
Explanation: In arithmetic, we group two of the same operators from the left, hence x-y-z is
equivalent to (x-y)-z and not x-(y—z).
12. Dot operator in regular expression resembles which of the following?
a) Expressions are juxtaposed
b) Expressions are multiplied
c) Cross operation
d) None of the mentioned
View Answer
Answer: a
Explanation: Dot operation or concatenation operation means that the two expressions are
juxtaposed i.e. there are no intervening operators in between. In fact, UNIX regular expressions
use the dot for an entirely different purpose: representing any ASCII character.
Answer: d
Explanation: It does not matter in which order we group the expression with the operators as
they are associative. If one gets a chance to group the expression, one should group them from
left for convenience. For instance, 012 is grouped as (01)2.
advertisement
Answer: c
Explanation: Using the rules of precedence on the give expression, c is the appropriate choice
with the order of: Bracket>Kleene>Dot>Union
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “DFA
to Regular Expressions”.
a) (0+1)*001(0+1)*
b) 1*001(0+1)*
c) (01)*(0+0+1)(01)*
d) None of the mentioned
View Answer
Answer: a
Explanation: There needs to be 001 together in the string as an essential substring. Thus, the
other components can be anything, 0 or 1 or e.
advertisement
Answer: b
Explanation: Using NFA with e moves, we can represent all the regular expressions as an
automata. As regular expressions include e, we need to use e moves.
3. The total number of states required to automate the given regular expression
(00)*(11)*
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: c
Explanation:
4. Which of the given regular expressions correspond to the automata shown?
a) (110+1)*0
b) (11+110)*1
c) (110+11)*0
d) (1+110)*1
View Answer
Answer: c
Explanation: There is no state change for union operation, but has two different paths while for
concatenation or dot operation, we have a state change for every element of the string.
advertisement
Answer: a
Explanation: Passwords like abc123, 123XYZ, should not be accepted . If one also wants to
include special characters as one of the constraint, one can use the following regular expression:
^(?=.*[a-z])(?=.*[A-Z])(?=.*\d)(?=.*[^\da-za-Z]).{8,15}$
Answer: a
Explanation: As the input variables are under Kleene Operation, we need to include e,thus
option c is not correct,thereby option (a) is the right answer.
7. The minimum number of states required in a DFA (along with a dumping state) to check
whether the 3rd bit is 1 or not for |n|>=3
a) 3
b) 4
c) 5
d) 1
View Answer
Answer: c
Explanation:
advertisement
Answer: c
Explanation: Identifiers in C Programming Language follows the following identifiers rule:
a) The name of the identifier should not begin with a digit.
b) It can only begin with a letter or a underscore.
c) It can be of length 1 or more.
Answer: c
Explanation: (a) and (b) are the general cases where we restrict the acceptance of a string witrh
substring 00 but we ignore the case where the string needs to end with 1 which therby, does not
allows the acceptance of e.
10. The minimum number of transitions to pass to reach the final state as per the following
regular expression is:
{a,b}*{baaa}
a) 4
b) 5
c) 6
d) 3
View Answer
Answer: a
Explanation:
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: c
Explanation: We use this algorithm to simplify a finite automaton to regular expression or vice
versa. We eliminate states while converting a given finite automata to its corresponding regular
expression.
advertisement
2. If we have more than one accepting states or an accepting state with an outdegree, which of
the following actions will be taken?
a) addition of new state
b) removal of a state
c) make the newly added state as final
d) more than one option is correct
View Answer
Answer: d
Explanation: If there is more than one accepting state or if the single accepting state as an out
degree , add a new accepting state, make all other states non accepting, and hold an e-transitions
from each former accepting state to the new accepting state.
Answer: b
Explanation: While eliminating the states, we unify multiple transitions to one transition that
contains union of input and not the vice versa.
a) Yes
b) No
View Answer
Answer: a
Explanation: The state q2 can be eliminated with ease and the reduced state diagram can be
represented as:
advertisement
5. Which of the following methods is suitable for conversion of DFA to RE?
a) Brzozowski method
b) Arden’s method
c) Walter’s method
d) All of the mentioned
View Answer
Answer: a
Explanation: Brzozowski method takes a unique approach to generating regular expressions. We
create a system of regular expressions with one regular expression unknown for each state in M,
and then we solve the system for Rλ where Rλ is the regular expression associated with starting
state qλ.
Answer: a
Explanation: This method has the advantage over the transitive closure technique as it can easily
be visualized.
Answer: a
Explanation: For every NFA, there exists an equivalent DFA and vice versa.
advertisement
Answer: d
Explanation: For converting RE to DFA , first we convert RE to NFA (Thompson
Construction), and then NFA is converted into DFA(Subset Construction).
Answer: a
Explanation: For every state which is eliminated, a new regular expression is produced. The
newly generated regular expression act as an input for a state which is next to removed state.
10. Is it possible to obtain more than one regular expression from a given DFA using the state
elimination method?
a) Yes
b) No
View Answer
Answer: a
Explanation: Using different sequence of removal of state, we can have different possible
solution of regular expressions. For n-state deterministic finite automata excluding starting and
final states, n! Removal sequences are there. It is very tough to try all the possible removal
sequences for smaller expressions.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Regular Language & Expression”.
Answer: d
Explanation: None.
advertisement
Answer: d
Explanation: All are equivalent to union operation.
Answer: a
Explanation: None.
advertisement
5. a? is equivalent to
a) a
b) a+Φ
c) a+ϵ
d) wrong expression
View Answer
Answer: c
Explanation: Zero or one time repetition of previous character .
6. ϵL is equivalent to
a) ϵ
b) Φ
c) L
d) Lϵ
View Answer
Answer: c,d
Explanation: None.
7. (a+b)* is equivalent to
a) b*a*
b) (a*b*)*
c) a*b*
d) none of the mentioned
View Answer
Answer: b
Explanation: None.
advertisement
8. ΦL is equivalent to
a) LΦ
b) Φ
c) L
d) ϵ
View Answer
Answer: a,b
Explanation: None.
Answer: c
Explanation: (ab)*=(a*b*)*.
Answer: d
Explanation: All are equivalent to (a+b)*.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Regular Language & Expression”.
1. How many strings of length less than 4 contains the language described by the regular
expression (x+y)*y(a+ab)*?
a) 7
b) 10
c) 12
d) 11
View Answer
Answer: c
Explanation: string of length 0 = Not possible (because y is always present).
string of length 1 = 1 (y)
string of length 2 = 3 (xy,yy,ya)
string of length 3 = 8 (xxy,xyy,yxy,yyy,yaa,yab,xya,yya)
advertisement
Answer: d
Explanation: None.
Answer: a
Explanation: All of above machine can accept regular language but all string accepted by
machine is regular only for DFA.
4. Regular grammar is
a) context free grammar
b) non context free grammar
c) english grammar
d) none of the mentioned
View Answer
Answer: a
Explanation: Regular grammar is subset of context free grammar.
advertisement
5. Let the class of language accepted by finite state machine be L1 and the class of languages
represented by regular expressions be L2 then
a) L1<L2
b) L1>=L2
c) L1 U L2 = .*
d) L1=L2
View Answer
Answer: d
Explanation: Finite state machine and regular expression have same power to express a
language.
Answer: b
Explanation: Except b all are regular expression*.
7. Regular expression are
a) Type 0 language
b) Type 1 language
c) Type 2 language
d) Type 3 language
View Answer
Answer: a
Explanation: According to Chomsky hierarchy .
advertisement
Answer: b
Explanation: None.
Answer: d
Explanation:If L is recursive enumerable and its complement too if and only if L is recursive.
Answer: d
Explanation: According to definition of regular expression.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Converting Regular Expressions to Automata”.
Answer: d
Explanation: Regexp processors are found in several search engines, seach and replace
mechanisms, and text processing utilities.
Answer: a
Explanation: Many languages come with built in support of regexps like Perl, Javascript, Ruby
etc. While some provide support using standard libraries like .NET, Java, Python, C++, C and
POSIX.
Answer: c
Explanation: A regexp processor translates the syntax into internal representation which can be
executed and matched with a string and that internal representation can have several approaches
like the ones mentioned.
Answer: d
Explanation: A quantifier after a token specifies how often the preceding element is allowed to
occur. ?, *, +, {n}, {min, }, {min, max} are few quantifiers we use in regexps implementations.
7. Which of the following cannot be used to decide whether and how a given regexp matches a
string:
a) NFA to DFA
b) Lazy DFA algorithm
c) Backtracking
d) None of the mentioned
View Answer
Answer: d
Explanation: There are at least three algorithms which decides for us, whether and how a regexp
matches a string which included the transformation of Non deterministic automaton to
deterministic finite automaton, The lazy DFA algorithm where one simulates the NFA directly,
building each DFA on demand and then discarding it at the next step and the process of
backtracking whose running time is exponential.
Answer: c
Explanation: () groups a series of pattern element to a single element.
When we use pattern in parenthesis, we can use any of ‘$1’, ‘$2’ later to refer to the previously
matched pattern.
advertisement
Answer: c
Explanation: It matches the end of a string and not an internal line.The given segment of code
outputs:
Hello
World
is a string that ends with ‘d\n’
advertisement
Answer: a
Explanation: Thompson construction algorithm is an algorithm in automata theory used to
convert a given regular expression into NFA. Similarly, Kleene algorithm is used to convert a
finite automaton to a regular expression.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. VLSI Questions and Answers
2. Python Programming Examples on Stacks & Queues
3. Cryptography and Network Security Questions and Answers
4. Java Programming Examples on Numerical Problems & Algorithms
5. Java Programming Examples on Utility Classes
6. Neural Networks Questions and Answers
7. LISP Questions and Answers
8. C++ Algorithms, Problems & Programming Examples
9. Java Algorithms, Problems & Programming Examples
10. Theory of Machines Questions and Answers
11. C# Programming Examples on Functions
12. Network Theory Questions and Answers
13. Electromagnetic Theory Questions and Answers
14. Java Programming Examples on String Handling
15. Compilers Questions and Answers
16. C Programming Examples on Strings
17. C++ Programming Examples on Set & String Problems & Algorithms
18. C Programming Examples on Set & String Problems & Algorithms
19. Java Programming Examples on Set & String Problems & Algorithms
20. Automata Theory Questions and Answers
advertisement
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Regular Expression in UNIX”.
1. Which among the following is not a UNIX command for regular expressions?
a) ed
b) sed
c) vi
d) none of the mentioned
View Answer
Answer: d
Explanation: Regular expressions are used by different commands in Unix like ed, sed, grep,
awk, vi, etc. Sed stands for stream editor which is exclusively used for executing scripts.
advertisement
Answer: b
Explanation: Regular expression provides more flexibility while matching string patterns.
Special characters like ^, $, *, . are very useful.
Answer: d
Explanation: There are few expressions which provide the utility of matching metacharacters
including /^$/ for blank lines, / */ for matching one or more spaces, /^.*$/ for matching an entire
line whatever it is.
4. For the given syntax of sed, which among the following is not a correct option?
General syntax of sed: /pattern/action
a) / are used as delimiters
b) pattern refers to a regular expression
c) pattern refers to the string to be matched
d) action refers to the command
View Answer
Answer: c
Explanation: In the general syntax of sed, pattern is the regular expression and action refers to
the command given (p: prints the line, d: deletes the line, etc).
advertisement
Answer: b
Explanation: The grep is a standard UNIX utility program that searches through a set of files in
search of a text pattern,specified through a regular expression.
Answer: a
Explanation: Regular expressions are very much invaluable tools; they can be used to find a
particular segment of line in a file and instruct to take certain actions.
advertisement
Answer: c
Explanation: grep is a command which finds the pattern in a particular text segment.Here, it
scans each line in heroes.txt and looks for an m followed by a and then followed by n.
Answer: b
Explanation: There are many other common regular expression operators like $, ^, etc. Which
have their own respective purposes.
Answer: d
Explanation: There are many UNIX tools including vi, Emacs, sed, awk and modern
programming languages which support regular expressions.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: b
Explanation: A lexeme is a string of characters that form a syntactic unit. It is reasonable to say
that is the sequence of alphanumeric characters in a token.
advertisement
2. If the lexical analyser finds a lexeme with the same name as that of a reserved word,it
_________
a) overwrites the word
b) overwrites the functionality
c) generates an error
d) something else
View Answer
Answer: c
Explanation: Reserved words are known as keywords and they are specific and reserved with its
functionality to a language. Thus, getting an input with the same name by the analyzer will
generate an error.
3. The methodology to show an error when the analyzer faces a keyword over an user’s input is
based on:
a) rule priority
b) longest match rule
c) keyword-out rule
d) none of mentioned
View Answer
Answer: a
Explanation: The lexical analyzer follows the rule priority where its prioritizes keywords over
an input it gets with the same name as that of the keyword and thus generates an error.
Answer: b
Explanation: A lexical analyzer reads the source code letter by letter and when it encounters a
space or an operator or any special character, it decides that the word is completed.
5.Which among the following statement is correct?
Statement 1: When the analyzer scans ‘int’ and ‘intvalue’, it is not able to decide whether the int
leads to a keyword or an identifier.
Statement 2: Longest Match Rule
advertisement
Answer: b
Explanation: The Longest Match rule states that the lexeme scanned should be determined on
the basis of longest match among all the token available.
6. The output of the lexical and syntax analyzer can stated as:
a) parse stream, parse tree
b) token tree, parse tree
c) token stream, parse tree
d) all of the mentioned
View Answer
Answer: c
Explanation: The lexical analyzer outputs the stream of token which is taken up by syntax
analyzer one by one against the production rule and parse tree is generated.
7. Which among the following is not a tool to construct lexical analyzer from a regular
expression?
a) lex
b) flex
c) jflex
d) none of the mentioned
View Answer
Answer: d
Explanation: Lexical analysis is done using few tools such as lex, flex and jflex. Jflex is a
computer program that generates lexical analyzers (also known as lexers or scanners) and works
apparently like lex and flex. Lex is commonly used with yacc parser generator.
Answer: d
Explanation: Lexers and parsers are most commonly used in compilers, but it has more
application elsewhere like in prettyprinters or linters(application of stylistic formatting
conventions to textfiles, source code, etc.).
advertisement
Answer: a
Explanation: The first phase of compilation process is called lexical analysis. It fragments the
source code into token which is the smallest programming unit of a program.
11. Which of the following characters are ignored while lexical analysis?
a) .
b) =
c) #
d) WhiteSpace
View Answer
Answer: d
Explanation: The lexical analyzer ignores all the whitespaces and fragments the program into
tokens.
Answer: d
Explanation: oolex, flex, lex, jflex, all are lexical analyzer tools which perform the following
function.
13. The action of parsing the source code into proper syntactic classes is known as:
a) Parsing
b) Interpretation analysis
c) Lexicography
d) Lexical Analysis
View Answer
Answer: d
Explanation: Lexical analysis or scanning is the process of parsing the source code into proper
syntactic classes. It gets things ready for the parser with lexemes to built the parse tree.
Answer: a
Explanation: Lexical analysis involves the following task:
a) Building a uniform symbol table
b) Parsing the source code into tokens
c) Building a literal and identifier table
advertisement
Answer: a
Explanation: A scanner or a lexical analyzer takes a source code as input and outputs a stream of
token after fragmenting the code.
Answer: c
Explanation: Type checking is a process which is performed during Syntax directed translation.
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Finding Patterns in Text,Algebric Laws and Derivatives”.
1. The minimum length of a string {0,1}* not in the language corresponding to the given regular
expression:
(0*+1*)(0*+1*)(0*+1*)
a) 3
b) 4
c) 5
d) 6
View Answer
Answer: b
Explanation: 0101 or 1010 the strings with minimum length on {0,1}* which does not belong to
the language of the given regular expression.Other strings like 111, 000, 1101, etc are accepted
by the language .
advertisement
Answer: a
Explanation: What we observe from the question is that, it includes e and 11 and any number of
1’s then. Therefore, its simplifies when we write the same reg. Expression as (11+111)*.
3. The minimum number of 1’s to be used in a regular expression of the given language:
R(x): The language of all strings containing exactly 2 zeroes.
a) 2
b) 3
c) 0
d) 1
View Answer
Answer: b
Explanation: It is not required to automate the question if asked theoretically.The number of
zeroes fixed is 2. Therefore, we can represent the regular expression as 1*01*01*.
4. The given regular language corresponds to which of the given regular language
e+1+(1+0)*0+(0+1)*11
a) The language of all strings that end with 11 or 00
b) The language of all strings that end with 0 or 1
c) The language of all strings which does not end with 01
d) None of the mentioned
View Answer
Answer: c
Explanation: According to the given regular expression, e is accepted by its language and it does
not end with 00 or 11 or 0 or 1. Thus option a and b are eliminated. Further, the regular
expression is valid for the third option.
advertisement
5. Statement: If we take the union of two identical expression, we can replace them by one copy
of the expression.
Which of the following is a correct option for the given statement?
a) Absorption Law
b) Idempotent Law
c) Closure Law
d) Commutative Law
View Answer
Answer: b
Explanation: Idempotent Law states that if we take the union of two like expression, we can use
a copy of the expression instead i.e. L+L=L. The common arithmetic operators are not
idempotent.
Answer: a
Explanation: An annihilator for an operator is a value such that when the operator is applied to
the annihilator and some other value, the result is the annihilator.
7. Statement: A digit, when used in the CFG notation, will always be used as a terminal.
State true or false?
a) True
b) False
View Answer
Answer: a
Explanation: Lowercase letters near the beginning of an alphabet, a, b and so on are terminal
symbols. We shall also assume that digits and other characters such as + or parenthesis are
terminals.
advertisement
8. Choose the incorrect process to check whether the string belongs to the language of certain
variable or not?
a) recursive inference
b) derivations
c) head to body method
d) All of the mentioned
View Answer
Answer: d
Explanation: There are two approaches to infer that certain string are in the language of a certain
variable. The most conventional way is to use the rules from body to head, recursive inference.
The second approach is expanding the starting variable using one of its productions whose head
is tart symbol and derive a string consisting entirely of terminals(head to body or derivations).
9. Statement: Left most derivations are lengthy as compared to Right most derivations.
Choose the correct option:
a) correct statement
b) incorrect statement
c) may or may not be correct
d) depends on the language of the grammar
View Answer
Answer: c
Explanation: It completely depends on the person who develops the grammar of any language,
how to make use of the tools i.e. leftmost and rightmost derivations.
10. A->aAa|bAb|a|b|e
Which among the following is the correct option for the given production?
a) Left most derivation
b) Right most derivation
c) Recursive Inference
d) None of the mentioned
View Answer
Answer: a
Explanation: The given form represents leftmost derivations in which at each step we replace
the leftmost variable by one of its production bodies.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Automata Theory Questions and Answers – Lexical Analysis
» Next - Automata Theory Questions and Answers – Properties-Non Regular Languages
Categories Automata Theory MCQsPost navigation
Automata Theory Questions and Answers – Lexical Analysis
Geotechnical Engineering Questions and Answers – Group Action in Piles
advertisement
advertisement
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers focuses on “Properties-Non
Regular Languages”.
1. All the regular languages can have one or more of the following descriptions:
i) DFA ii) NFA iii) e-NFA iv) Regular Expressions
Which of the following are correct?
a) i, ii, iv
b) i, ii, iii
c) i, iv
d) i, ii, iii, iv
View Answer
Answer: d
Explanation: The class of languages known as the regular language has atleast four different
descriptions: i) DFA ii) NFA iii) e-NFA iv) Regular Expressions
advertisement
2. Which of the technique can be used to prove that a language is non regular?
a) Ardens theorem
b) Pumping Lemma
c) Ogden’s Lemma
d) None of the mentioned
View Answer
Answer: b
Explanation: We use the powerful technique called Pumping Lemma, for showing certain
languages not to be regular. We use Ardens theorem to find out a regular expression out of a
finite automaton.
Answer: b
Explanation: Here, i has limits i.e. the language is finite, contains few elements and can be
graphed using a deterministic finite automata. Thus, it is regular. Others can be proved non
regular using Pumping lemma.
Answer: d
Explanation: All of the given languages are regular and finite and thus, can be represented using
respective deterministic finite automata. We can also use mealy or moore machine to represent
remainders for option c.
advertisement
5. If L is DFA-regular, L’ is
a) Non regular
b) DFA-regular
c) Non-finite
d) None of the mentioned
View Answer
Answer: b
Explanation: This is a simple example of a closure property: a property saying that the set of
DFA-regular languages is closed under certain operations.
Answer: b
Explanation: Let L be a regular language. If ~L has k equivalent classes, then any DFA that
recognizes L must have atleast k states.
Answer: c
Explanation: In automata theory, the Myphill Nerode theorem provides a necessary and
sufficient condition for a language to be regular. The Myphill Nerode theorem can be used to
show a language L is regular by proving that the number of equivalence classes of RL(relation)
is finite.
advertisement
Answer: d
Explanation: The myphill nerode theorem can be generalized to trees and an application of tree
automata prove an algorithmic meta theorem about graphs.
9. Given languages:
i) {anbn|n>=0}
ii) <div>n</div>n
iii) {w∈{a,b}∗| #a(w)=#b(w)}, # represents occurrences
Which of the following is/are non regular?
a) i, iii
b) i
c) iii
d) i, ii, iii
View Answer
Answer: d
Explanation: There is no regular expression that can parse HTML documents. Other options are
also non-regular as they cannot be drawn into finite automaton.
10. Finite state machine are not able to recognize Palindromes because:
a) Finite automata cannot deterministically find the midpoint
b) Finite automata cannot remember arbitarily large amount of data
c) Even if the mid point is known, it cannot find whether the second half matches the first
d) All of the mentioned
View Answer
Answer: d
Explanation: It is the disadvantage or lack of property of a DFA that it cannot remember an
arbitrarily such large amount of data which makes it incapable of accepting such languages like
palindrome, reversal, etc.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Pumping Lemma for Regular Language”.
Answer: b
Explanation: Pumping lemma defines an essential property for every regular language in
automata theory. It has certain rules which decide whether a language is regular or not.
advertisement
2. While applying Pumping lemma over a language, we consider a string w that belong to L and
fragment it into _________ parts.
a) 2
b) 5
c) 3
d) 6
View Answer
Answer: c
Explanation: We select a string w such that w=xyz and |y|>0 and other conditions. However,
there exists an integer n such that |w|>=n for any wÎL.
3. If we select a string w such that w∈L, and w=xyz. Which of the following portions cannot be
an empty string?
a) x
b) y
c) z
d) all of the mentioned
View Answer
Answer: b
Explanation: The lemma says, the portion y in xyz cannot be zero or empty i.e. |y|>0, this
condition needs to be fulfilled to check the conclusion condition.
4. Let w= xyz and y refers to the middle portion and |y|>0.What do we call the process of
repeating y 0 or more times before checking that they still belong to the language L or not?
a) Generating
b) Pumping
c) Producing
d) None of the mentioned
View Answer
Answer: b
Explanation: The process of repeatation is called pumping and so, pumping is the process we
perform before we check whether the pumped string belongs to L or not.
advertisement
5. There exists a language L. We define a string w such that w∈L and w=xyz and |w| >=n for
some constant integer n.What can be the maximum length of the substring xy i.e. |xy|<=?
a) n
b) |y|
c) |x|
d) none of the mentioned
View Answer
Answer: a
Explanation: It is the first conditional statement of the lemma that states that |xy|<=n, i.e. the
maximum length of the substring xy in w can be n only.
Answer: b
Explanation: Finite languages trivially satisfy the pumping lemma by having n equal to the
maximum string length in l plus 1.
7. Answer in accordance to the third and last statement in pumping lemma:
For all _______ xyiz ∈L
a) i>0
b) i<0
c) i<=0
d) i>=0
View Answer
Answer: d
Explanation: Suppose L is a regular language . Then there is an integer n so that for any x∈L
and |x|>=n, there are strings u,v,w so that
x= uvw
|uv|<=n
|v|>0
for any m>=0, uvmw ∈L.
advertisement
8. If d is a final state, which of the following is correct according to the given diagram?
Answer: a
Explanation: The FSA accepts the string pqrs. In terms of pumping lemma, the string pqrs is
broken into an x portion an a, a y portion qr and a z portion s.
9. Let w be a string and fragmented by three variable x, y, and z as per pumping lemma. What
does these variables represent?
a) string count
b) string
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: a
Explanation: Given: w =xyz. Here, xyz individually represents strings or rather substrings which
we compute over conditions to check the regularity of the language.
10. Which of the following one can relate to the given statement:
Statement: If n items are put into m containers, with n>m, then atleast one container must
contain more than one item.
a) Pumping lemma
b) Pigeon Hole principle
c) Count principle
d) None of the mentioned
View Answer
Answer: b
Explanation: Pigeon hole principle states the following example: If there exists n=10 pigeons in
m=9 holes, then since 10>9, the pigeonhole principle says that at least one hole has more than
one pigeon.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Applications of Pumping Lemma/Pigeonhole principle”.
Answer: a
Explanation: We use the method of proof by contradiction in pumping lemma to prove that a
language is regular or not.
advertisement
Answer: b
Explanation: Given n, there is a string of balanced parentheses that begins with more than p left
parentheses, so that y will contain entirely of left parentheses. By repeating y, we can produce a
string that does not contain the same number of left and right parentheses, and so they cannot be
balanced.
Answer: a
Explanation: The converse of the lemma is not true. There may exists some language which
satisfy all the conditions of the lemma and still be non-regular.
Answer: d
Explanation: There are several applications of pigeonhole principle:
Example: The softball team: Suppose 7 people who want to play softball(n=7 items), with a
limitation of only 4 softball teams to choose from. The pigeonhole principle tells us that they
cannot all play for different teams; there must be atleast one team featuring atleast two of the
seven players.
advertisement
Answer: c
Explanation: Collisions are inevitable in a hash table because the number of possible keys
exceeds the number of indices in the array.
6. If n objects are distributed over m places, and n < m, then some of the places receive:
a) at least 2 objects
b) at most 2 objects
c) no object
d) none of the mentioned
View Answer
Answer: c
Explanation: This is one of the alternative formulations of the pigeon hole principle. As n < m,
there will exist some place which will not receive any of the object.
Answer: d
Explanation: None of the mentioned are regular language and are an application to the technique
Pumping Lemma. Each one of the mentioned can be proved non regular using the steps in
Pumping lemma.
Answer: c
Explanation: On the contrary, the typical way to prove that a language is to construct either a
finite state machine or a regular expression for the language.
Answer: d
Explanation: Pigeon hole principle or Dirichlet’s drawer principle or Dirichlet’s box principle is
an example of counting argument whose field is called Combinatorics.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory online test focuses on “Closure Properties under Boolean
Operations”.
1. If L1, L2 are regular and op(L1, L2) is also regular, then L1 and L2 are said to be
____________ under an operation op.
a) open
b) closed
c) decidable
d) none of the mentioned
View Answer
Answer: b
Explanation: If two regular languages are closed under an operation op, then the resultant of the
languages over an operation op will also be regular.
advertisement
2. Suppose a regular language L is closed under the operation halving, then the result would be:
a) 1/4 L will be regular
b) 1/2 L will be regular
c) 1/8 L will be regular
d) Al of the mentioned
View Answer
Answer: d
Explanation: At first stage 1/2 L will be regular and subsequently, all the options will be regular.
Answer: a
Explanation: Regular language is closed under complement operation. Thus, if L1′ and L2′ are
regular so are L1 and L2. And if L1 and L2 are regular so is L1.L2.
Answer: a
Explanation: If L1 is regular, so is L1′ and if L1′ and L2′ are regular so is L1′ U L2′. Further,
regular languages are also closed under intersection operation.
advertisement
6. Which among the following are the boolean operations that under which regular languages
are closed?
a) Union
b) Intersection
c) Complement
d) All of the mentioned
View Answer
Answer: d
Explanation: Regular languages are closed under the following operations:
a) Regular expression operations
b) Boolean operations
c) Homomorphism
d) Inverse Homomorphism
7. Suppose a language L1 has 2 states and L2 has 2 states. After using the cross product
construction method, we have a machine M that accepts L1 ∩ L2. The total number of states in
M:
a) 6
b) 4
c) 2
d) 8
View Answer
Answer: 4
Explanation: M is defined as: (Q, S, d, q0, F)
where Q=Q1*Q2 and F=F1*F2
advertisement
Answer: a
Explanation: (L’)’ is equivalent to L and L U L is subsequently equivalent to L.
10. Which among the following is the closure property of a regular language?
a) Emptiness
b) Universality
c) Membership
d) None of the mentioned
View Answer
Answer: d
Explanation: All the following mentioned are decidability properties of a regular language. The
closure properties of a regular language include union, concatenation, intersection, Kleene,
complement , reverse and many more operations.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Reversal-Homomorphism and Inverse Homomorphism”.
Answer: c
Explanation: Lr is defined as the reversal of a language. Lr is a set of strings whose reversal is in
L.
Example: L={0, 01, 100}
Lr={0, 10, 001}
advertisement
Answer: d
Explanation: Lr, L’, L* i.e. reversal, complementation and kleene all are the closure properties
of regular language.
3. If E=F+G;
Er=?
a) Fr+Gr
b) (F+G)r
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: If E is a symbol a, e, or f, then Er=E. Other inductive properties include union of
reversals, concatenation and Kleene.
4. If E= FG, Er=?
a) FrGr
b) GrFr
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: b
Explanation: If E= FG, Er=GrFr . Example: (01*)R=(1*)R(0)R
advertisement
Answer: a
Explanation: 01*+10*
ER=(01*)R+(10*)R=>(1*)R0R+(0*)R1R=>1*0+0*1
Answer: d
Explanation: Homomorphism on an aphabet is a function that gives a string for each symbol in
that alphabet. Example: h(0)=ab, etc.
Answer: b
Explanation: h-1(L) is the language with two 0’s and any number of 1’s=>(1*01*01*).
9. While proving Inverse Homomorphism, which of the following steps are needed?
a) Start with a DFA Ain L
b) Construct a DFA B for h-1(L)
c) The set of states, initial and final states should be same.
d) All of the mentioned
View Answer
Answer: d
Explanation: While constructing DFA B, we need to take care of the following:
a) The same set of states
b) The same start state
c) The same final state
d) Input alphabet = the symbols to which homomorphism h applies.
Answer: b
Explanation: Let h be a homomorphism and L a language whose alphabet is the output language
of h.
h-1(L) = {w | h(w) is in L}.
advertisement
Recommended Posts:
This set of Automata Theory online quiz focuses on “Conversions among Representations”.
1. Which of the following conversion is not feasible?
a) Regular expression to automaton conversion
b) Automaton to Regular Expression Conversion
c) NFA to DFA
d) None of the mentioned
View Answer
Answer: d
Explanation: Each of the four formats of representation of the regular language be it, DFA,
NFA, Regular Expression or e-NFA can be converted to the rest three forms.
advertisement
Answer: b
Explanation: We must search from each of the n states along all arcs labelled e. If there are n
states, there can be no more than n2 states.
3. For a _________ state DFA, the time taken for DFA-NFA conversion is O(n).
a) n
b) n1/2
c) n2
d) 2n
View Answer
Answer: a
Explanation: The conversion DFA to NFA is simple, and takes O(n) time on an n-state DFA.
4. With reference to Automaton to Regular Expression Conversion, for each of the n rounds,
where n is the number of states of DFA, we can _________ the size of the regular expression
constructed.
a) double
b) triple
c) quadruple
d) none of the mentioned
View Answer
Answer: c
Explanation: We can quadruple the size of the regular expression per round. Thus, we can
simply write n3 expressions can take time O(n34n), where n =number of states of the DFA.
advertisement
Answer: a
Explanation: It is possible to parse the expression efficiently, using a technique that takes only
O(n) time on a expression of length n3.
Answer: a
Explanation: We can eliminate e-transitions from an n state epsilon-NFA to build an ordinary
NFA in O(n3) time, without changing the number of states.Next, producing to DFA can take
exponential time.
Answer: d
Explanation: Each of the following can expressed in terms of ordinary NFA with different time
complexities.
advertisement
Answer: a
Explanation: Powerset or subset construction method is a standard method for converting a non
deterministic finite automata into DFA which recognizes the same formal language.
Answer: a
Explanation: Thompson’s Construction is used to find out a Finite Automaton from a Regular
Expression. We will reduce the regular expression into smallest regular expressions and convert
them to NFA and finally to DFA.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Testing Emptiness and Membership”.
Answer: c
Explanation: A decision property of a language class is an algorithm that takes a formal
description of a language(e.g., a DFA) and tells whether or not some property holds.
advertisement
Answer: d
Explanation: Emptiness, Infiniteness and Membership are the decision properties of any
language class. Example: Is the language L empty? Or Is w, a string belongs to the regular
language L?
3. Pick the odd one out of the given properties of a regular language:
a) Kleene
b) Reversal
c) Homomorphism
d) Membership
View Answer
Answer: d
Explanation: Membership is a decision property of language class while others mentioned like
Kleene, Reversal and Homomorphism are Closure properties of language class.
Answer: d
Explanation: For a given automata, all the formats of representation be it deterministic finite
automata or non deterministic finite automata or non deterministic finite automata with epsilon
transitions, all are equivalent variants.
advertisement
Answer: d
Explanation: It is possible to convert from one specification to another. We can express a
regular language in all the given four variants.
Answer: d
Explanation: To give a solution to the mentioned problems, we require decision properties and
for some, we need additional tools like minimized automaton and Pumping lemma.
Answer: c
Explanation: Using closure properties we can give a=solution to many problems like :
Is the regular languages L1 and L2 closed on concatenation operation?, etc.
advertisement
8. Suppose there is a string w=abbab, and there exists a DFA which accepts w. How many stepts
will be required to test its membership?
a) 2
b) 1
c) 4
d) None of the mentioned
View Answer
Answer: If a string belongs to a language, the number of steps required to test that member ship
is equal to the length of string i.e. 5.
9. If a DFA has n states and the language contains any string of length n or more, the language is
termed as:
a) Infinite
b) Empty
c) Non regular
d) None of the mentioned
View Answer
Answer: The language is surely finite if it is limited to string of length n or less. This is because
there are atleast n+1 states along the path while traversing w(string).
Answer: a
Explanation: This occurs because there are atleast n+1 states along the path while traversing the
string w.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Context Free Grammar-Derivations and Definitions”.
Answer: c
Explanation: The entity which accepts a language is termed as Automata while the one which
generates it is called Grammar. Tokens are the smallest individual unit of a program.
advertisement
Answer: c
Explanation: Context Sensitive Language or Type 1 or Linearly Bounded Non deterministic
Language has the production rule where the production is context dependent i.e. aAb->agb.
Answer: d
Explanation: Every regular language can be produced by context free grammar and context free
language can be produced by context sensitive grammar and so on.
Answer: b
Explanation: G=(V, ∑, p, S), here V=Finite set of variables, ∑= set of terminals, p= finite
productions, S= Starting Variable.
advertisement
Answer: c
Explanation: According to the definition, the starting variable can produce another variable or
any terminal or a variable which leads to terminal.
7. For S->0S1|e for ∑={0,1}*, which of the following is wrong for the language produced?
a) Non regular language
b) 0n1n | n>=0
c) 0n1n | n>=1
d) None of the mentioned
View Answer
Answer: d
Explanation: L={e, 01, 0011, 000111, ……0n1n }. As epsilon is a part of the set, thus all the
options are correct implying none of them to be wrong.
advertisement
Answer: c
Explanation: The grammar which produces a palindrome set can be written as:
S-> aSa | bSb | e | a | b
L={e, a, b, aba, abbbaabbba…..}
Answer: a
Explanation: A context free grammar G is ambiguous if there is atleast one string in L(G) which
has two or more distinct leftmost derivations.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Problems focuses on “The Language of a Grammar, Inferences and
Ambiguity”.
Answer: d
Explanation: The following are the notions to express Context free grammars:
a) Recursive Inferences
b) Derivations
c) Sentential form
d) Parse trees
advertisement
Answer: a
Explanation: We apply the productions of CFG to infer that certain strings are in the language of
a certain variable.
4. 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 mentioned
View Answer
Answer: d
Explanation: Parse trees are an alternative representation to derivations and recursive inferences.
There can be several parse trees for the same string.
Answer: a
Explanation: Yes, they are equivalent. Both the terminologies represent the two approaches of
recursive inferencing.
advertisement
6. A->aA| a| b
The number of steps to form aab:
a) 2
b) 3
c) 4
d) 5
View Answer
Answer: b
Explanation: A->aA=>aaA=>aab
Answer: a
Explanation: For the given expression, L(G)={w in T*|S→*w}, If G(V, T, P, S) is a CFG, the
language of G, denoted by L(G), is the set of terminal strings that have derivations from the start
symbol.
Answer: b
Explanation: Push down automata accepts context free language.
9. Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00
a) {0a1b|a=2,b=3}
b) {0a1b|a=1,b=5}
c) {0a1b|a=b}
d) More than one of the mentioned is correct
View Answer
Answer: a
Explanation: Using the recursive approach, we can conclude that option a is the correct answer,
and its not possible for a grammar to have more than one language.
advertisement
Answer: d
Explanation: The given language is neither accepted by a finite automata or a push down
automata. Thus, it is neither a context free language nor a regular language.
a) true
b) partially true
c) false
d) none of the mentioned
View Answer
Answer: a
Explanation: We apply the productions of a CFG to infer that certain strings are in a language of
certain variable.
Answer: b
Explanation: Both the statements are false. Recursive Inference, using productions from body to
head. Derivations, using productions from head to body.
advertisement
13. Which of the following statements are correct for a concept called inherent ambiguity in
CFL?
a) Every CFG for L is ambiguous
b) Every CFG for L is unambiguous
c) Every CFG is also regular
d) None of the mentioned
View Answer
Answer: a
Explanation: A CFL L is said to be inherently ambiguous if every CFG for L is ambiguous.
Answer: a
Explanation: Rohit Parikh in 1961 proved in his MIT research paper that some context free
language can only have ambiguous grammars.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Sentential Forms”.
Answer: c
Explanation: Using the derivation approach, we can conclude that the given grammar produces a
language with a set of string which have equal number of a’s and b’s.
3. If L1 and L2 are context free languages, which of the following is context free?
a) L1*
b) L2UL1
c) L1.L2
d) All of the mentioned
View Answer
Answer: d
Explanation: The following is a theorem which states the closure property of context free
languages which includes Kleene operation, Union operation and Dot operation.
4. For the given Regular expression, the minimum number of variables including starting
variable required to derive its grammar is:
(011+1)*(01)*
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: c
Explanation: The grammar can be written as:
S->BC
B->AB|ε
A->011|1
C->DC|ε
D->01
advertisement
5. For the given Regular expression, the minimum number of terminals required to derive its
grammar is:
(011+1)*(01)*
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: b
Explanation: The grammar can be written as:
S->BC
B->AB|ε
A->011|1
C->DC|ε
D->01
6. A grammar G=(V, T, P, S) is __________ if every production taken one of the two forms:
B->aC
B->a
a) Ambiguous
b) Regular
c) Non Regular
d) None of the mentioned
View Answer
Answer: b
Explanation: The following format of grammar is of Regular grammar and is a part of Context
free grammar i.e. like a specific form whose finite automata can be generated.
Answer: c
Explanation: We can build context free grammar through different approaches, recursively
defining the variables and terminals inorder to fulfil the conditions.
advertisement
8. Which of the following languages are most suitable for implement context free languages ?
a) C
b) Perl
c) Assembly Language
d) None of the mentioned
View Answer
Answer: a
Explanation: The advantage of using high level programming language like C and Pascal is that
they allow us to write statements that look more like English.
9. Which among the following is the correct grammar for the given language?
L={x∈{0,1}*|number of zeroes in x¹number of one’s in x}
a) S-> 0|SS|1SS|SS1|S1S
b) S-> 1|0S|0SS|SS0|S0S
c) S-> 0|0S|1SS|SS1|S1S
d) None of the mentioned
View Answer
Answer: c
Explanation: L={0, 1, 00, 11, 001, 010,…}
The grammar can be framed as: S-> 0|0S|1SS|SS1|S1S
Answer: a
Explanation: It is just required to put the value in the variables in the question and check if it
satisfies or not.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Construction and Yield of a Parse Tree”.
1. The most suitable data structure used to represent the derivations in compiler:
a) Queue
b) Linked List
c) Tree
d) Hash Tables
View Answer
Answer: c
Explanation: The tree, known as “Parse tree” when used in a compiler, is the data structure of
choice to represent the source program.
advertisement
Answer: a
Explanation: A node has atmost one parent, drawn above the node, and zero or more children
drawn below. Lines connect parents to children. There is one node, one root, that has no parent;
this node appears to be at the top of the tree. Nodes with no children are called leaves. Nodes
that are not leaves are called interior nodes.
Answer: a
Explanation: The children of a node are ordered from the left and drawn so. If N is to the left of
node M, then all the descendents of N are considered to be to the left of all the descendents of
M.
Answer: d
Explanation: The root is labelled by the start symbol. All the leaves are either labelled by a a
terminal or with e.
advertisement
5. For the expression E*(E) where * and brackets are the operation, number of nodes in the
respective parse tree are:
a) 6
b) 7
c) 5
d) 2
View Answer
Answer: b
Explanation:
6. The number of leaves in a parse tree with expression E*(E) where * and () are operators
a) 5
b) 2
c) 4
d) 3
View Answer
Answer: a
Explanation:
7. Which of the following does the given parse tree correspond to?
a) P->1100
b) P->0110
c) P->1100ε
d) P->0101
View Answer
Answer: b
Explanation: The following is a parse tree for the production 0110 over {0,1}*.
advertisement
Answer: b
Explanation: A context free grammar G is ambiguous if there is at least one string in L(G)
having two or more distinct derivation trees or equivalently, two or more distinct leftmost
derivations.
Answer: c
Explanation: In order to graphically represent a derivation of a grammar we need to use parse
trees.
Answer: Parser or syntax analyzer is the one responsible for checking the grammar and
reporting errors. In this phase, parse tree is generated and syntax is analyzed.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Question Bank focuses on “Inferences to Trees, Trees to
Derivations”.
Answer: a
Explanation: A symbol X is generating if there exists : X->*w for some w that belongs to T*.
Also, a symbol can never be context free.
advertisement
Answer: c
Explanation: For a symbol X to be useful, it has to be both reachable and generating i.e.
S->* aXb -> * w where w belongs to T*.
3. Which of the following is false for a grammar G in Chomsky Normal Form:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) None of the mentioned
View Answer
Answer: d
Explanation: G, a CFG is said to be in Chomsky normal form if all its productions are in one of
the following form:
A->BC or A->a
4. Given Checklist:
a) G has no useless symbols
b) G has no unit productions
c) G has no epsilon productions
d) Normal form for production is violated
Is it possible for the grammar G to be in CNF with the following checklisy ?
a) Yes
b) No
View Answer
Answer: b
Explanation: The grammar is not in CNF if it violates the normal form of the productions which
is strictly restricted.
advertisement
Answer: a
Explanation: It is the parse tree theorem which states:
Given: Suppose we have a parse tree for a string w, according to a CNF grammar, G=(V, T, P,
S). Let h be the height of the parse tree. Now, Implication: |w|<=2h-1.
Answer: b
Explanation: It is the basic implication of Parse tree theorem (assuming CNF). If the height of
the parse tree is h, then |w| <=2h-1.
7. If w belongs to L(G), for some CFG, then w has a parse tree, which tell us the ________
structure of w.
a) semantic
b) syntactic
c) lexical
d) all of the mentioned
View Answer
Answer: b
Explanation: A parse tree or concrete syntactic tree is an ordered, rooted tree that represents the
syntactic structure of a string according to some context free grammar.
advertisement
Answer: c
Explanation: Both of the mentioned are different from parse trees. Sentence diagrams are
pictorial representations of grammatical structure of a sentence.
Answer: a
Explanation: Ideally, there should be only one parse tree for each string, i.e. the language should
be unambiguous.
Answer: a
Explanation: It is also true that multiple leftmost or rightmost derivations do cause ambiguity.
Unfortunately, it is not possible to remove the ambiguity always.
advertisement
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice Automata Theory Question Bank, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Applications – Parsers”.
1. To derive a string using the production rules of a given grammar, we use:
a) Scanning
b) Parsing
c) Derivation
d) All of the mentioned
View Answer
Answer: b
Explanation: Parsing is required to check the acceptability of a string. Further, comes the
syntactical phase which is taken care by other phases of compiler.
advertisement
2. Which of the following parser reaches the root symbol of the tree at last?
a) Top down parser
b) Bottom up parser
c) TOP down and Bottom up parser
d) None of the mentioned
View Answer
Answer: b
Explanation: Bottom up parser starts from the bottom with the string and comes up to the start
symbolusing a parse tree or a derivation tree.
Answer: c
Explanation: It is a hybrid method which works bottom up along the left edges of each subtree,
and top down on the rest of the parse tree.
Answer: b
Explanation: Bottom up parsing is done by shift reduce parsers like LALR parsers, Operator
precedence parsers, simple precedence parsers, etc.
advertisement
Answer: d
Explanation: The mentioned are the correct and proper functions of a shift reduce parsers. The
parsing methods are most commonly used for parsing programming languages, etc.
Answer: b
Explanation: It is exactly the opposite case where LALR parsers uses mutually recursive
functions instead of tables. It is a simplified version of canonical left to right parser.
Answer:
Explanation: LALR stands for Look ahead left to right parsers. It has more language recognition
power than LR(0) parser.
advertisement
Answer: c
Explanation: YACC is a computer code for UNIX operating system which generates a LALR
parser. On the other hand GNU Bison or Bison can generate LALR and GLR parsers.
Answer: d
Explanation: All the following mentioned are top down parsers and begin their operation from
the starting symbol.
10. Which of the following is true for a predictive parser?
a) Recursive Descent parser
b) no backtracking
c) Recursive Descent parser and no backtracking
d) None of the mentioned
View Answer
Answer: c
Explanation: Predictive parsing is possible only for the class of LL-grammars, which are the
CFG for which there exists some positive integer k that allows a recursive descent parser to
decide which production to use by examining only the next k tokens of input.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“YACC Parser Generator”.
Answer: c
Explanation: YACC technique is a computer code for the Unix operating system. It is a LALR
parser generator, generating a parser, the part of a compiler that tries to make syntactic sense of
the source code.
advertisement
Answer: c
Explanation: YACC stands for ‘Yet another compiler compiler’ and it was developed by
Stephen Johnson in B programming language later translated to C.
Answer: b
Explanation: The YACC takes C code as input and produces shift reduce parsers in C,also
known as Bottom up parsers which execute C snippets with the associated rule.
4. The _______ table is created by YACC.
a) LALR parsing
b) LL parsing
c) GLR parsing
d) None of the mentioned
View Answer
Answer: a
Explanation: LALR parser generator is software tool that reads a BNF grammar and creates a
LALR parser which is capable of parsing files written in programming language identified by
BNF grammar.
advertisement
Answer: c
Explanation: Stephen Johnson wrote this parser generator in B programming language which
was further modified and written in C, JAVA, Python, etc.
Answer: d
Explanation: B was programming language designed by Dennis Ritchie and Ken Thompson for
recursive, non numeric, system and language softwares. It was a typeless language, everything is
a word.
Answer: b
Explanation: The normal form used in Data base normalization is BCNF i.e. Boyce Codd
normal form and NOT Backus Naur Form.
advertisement
Answer: a
Explanation: BNF is a metasyntax used to express context free grammar, moreover a formal
way to express the language.
Answer: d
Explanation: W grammar or van Wijngaarden form is used to define potentially infinite context
free grammars in a finite number of rules. It is an example of larger class of affix grammars.
This technique was used to define the P/L Algol 68.
10. Which of the following version of Unix came up with YACC first?
a) V3
b) V5
c) CB UNIX
d) Unix-RT
View Answer
Answer: a
Explanation: Yacc appeared in version 3 of unix, though full description was published by 1975.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Markup Languages”.
Answer: a
Explanation: Generally speaking, a meta language is a language used to describe a language.
XML is a metalanguage that is used to describe a markup language.
advertisement
3. Which among the following are true for an Extensible markup language?
a) Human Readable/ Machine Readable
b) Extended from SGML
c) Developed by www consortium
d) All of the mentioned
View Answer
Answer: d
Explanation: XML is an open format markup language with a filename extension of .xml.
Answer: d
Explanation: More that hundred of document formats using XML syntax have been developed,
including RSS, Atom, SOAP and XHTML.
advertisement
Answer: b
Explanation: A document type definition defines the legal building blocks of an XML document
.
Answer: d
Explanation: There are three categories of electronic markup: presentational, procedural, and
descriptive markup. Examples are XML, HTML, LaTeX, etc.
7. troff and nroff are _________ in Unix.
a) functions
b) typesetting tools
c) System sofwares
d) None of the mentioned
View Answer
Answer: b
Explanation: Early examples of computer markup languages can be found in typesetting tools
like troff and nroff in Unix.
advertisement
Answer: a
Explanation: SGML is an acronym for Standard Generalized Markup Language.
Answer: d
Explanation: Markup languages originated with text documents, but there is an increasing use of
mark up language in presentation of other types of information, including playlists, vector
graphics, user interfaces and web services.
Answer: d
Explanation: All the mentioned options are valid HTML5 arguments and executes properly.
advertisement
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Ambiguous Grammar”.
1. A CFG is ambiguous if
a) It has more than one rightmost derivations
b) It has more than one leftmost derivations
c) No parse tree can be generated for the CFG
d) None of the mentioned
View Answer
Answer: b
Explanation: A context free grammar is ambiguous if it has more than one parse tree generated
or more than one leftmost derivations. An unambiguous grammar is a context free grammar for
which every valid string has a unique leftmost derivation.
advertisement
Answer: a
Explanation: Deterministic CFGs are always unambiguous , and are an important subclass of
unambiguous CFGs; there are non-deterministic unambiguous CFGs, however.
Answer: d
Explanation: The closure property of a context free grammar does not include iteration or kleene
or star operation.
Answer: a
Explanation: Dangling else problem: In many languages,the else in an if-then-else statement is
optional, which results into nested conditionals being ambiguous, at least in terms of the CFG.
advertisement
Answer: c
Explanation: GLR parser: a type of parser for non deterministic and ambiguous grammar
Chart parser: aa type of parser for ambiguous grammar.
Answer: a
Explanation: A context free language for which no unambiguous grammar exists, is called
Inherent ambiguous language.
Answer: b
Explanation: This set is context-free, since the union of two context-free languages is always
context free.
advertisement
Answer: a
Explanation: The production can be either itself or an empty string. Thus the empty string has
more than one leftmost derivations, depending on how many times R->R is being used.
9. In context to ambiguity, the number of times the following programming statement can be
interpreted as:
Statement: if R then if T then P else V
a) 2
b) 3
c) 4
d) 1
View Answer
Answer: a
Explanation: Dangling else problem
if R then (if T then P else V) and if R then (if T then P) else V are the two ways in which the
given if else statement can be parsed.
Answer: CYK algorithm parses the CFG in polynomial time while LR parsers do the same in
linear time. DCFGs are accepted by DPDAs and parsed using LR parsers or CYK algorithm.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Questions and Answers for Entrance exams focuses on “PDA-
Acceptance by Final State”.
Answer: d
Explanation: A push down automata uses a stack to carry out its operations. They are more
capable than the finite automatons but less than the turing model.
advertisement
Answer: a
Explanation: The term pushdown refers to the fact that the elements are pushed down in the
stack and as per the LIFO principle, the operation is always performed on the top element of the
stack.
3. Which of the following allows stacked values to be sub-stacks rather than just finite symbols?
a) Push Down Automaton
b) Turing Machine
c) Nested Stack Automaton
d) None of the mentioned
View Answer
Answer: c
Explanation: In computational theory, a nested stack automaton is a finite automaton which
makes use of stack containing data which can be additional stacks.
4. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of
n.
a) 5
b) 8
c) 4
d) 10
View Answer
Answer: d
Explanation: The 10-tuple can be stated as: NSA= ‹Q,Σ,Γ,δ,q0,Z0,F,[,],]›.
advertisement
Answer: b
Explanation: Push down automata is for Context free languages and they are termed as Type 2
languages according to Chomsky hierarchy.
6. The class of languages not accepted by non deterministic, nonerasing stack automata is
_______
a) NSPACE(n2)
b) NL
c) CSL
d) All of the mentioned
View Answer
Answer: d
Explanation: NSPACE or non deterministic space is the computational resource describing the
memory space for a non deterministic turing machine.
7. A push down automaton with only symbol allowed on the stack along with fixed symbol.
a) Embedded PDA
b) Nested Stack automata
c) DPDA
d) Counter Automaton
View Answer
Answer: d
Explanation: This class of automata can recognize a set of context free languages like {anbn|n
belongs to N}
advertisement
Answer: a, d
Explanation: Push and pop are the operations we perform to operate a stack. A stack follows the
LIFO principle, which states its rule as: Last In First Out.
Answer: c
Explanation: When we reach the acceptance state and find the stack to be empty, we say, the
string has been accepted by the push down automata.
Answer: c
Explanation: The next operation is performed by PDA considering three factors: present
state,symbol on the top of the stack and the input symbol.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “PDA-
acceptance by Empty Stack”.
1. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called
a) Complement
b) Union
c) Disjoint
d) Connected
View Answer
Answer: c
Explanation: Two sets are called disjoint if they have no elements in common i.e. RÇT=Æ.
advertisement
2. Which among the following is not a part of the Context free grammar tuple?
a) End symbol
b) Start symbol
c) Variable
d) Production
View Answer
Answer: a
Explanation: The tuple definition of context free grammar is: (V, T, P, S) where V=set of
variables, T=set of terminals, P=production, S= Starting Variable.
Answer: c
Explanation: Context free grammar is the set which belongs to the set of context free grammar.
Similarly, Regular grammar is a set which belongs to the the set of Context free grammar.
Answer: d
Explanation: Context free grammars are closed under kleene operation, union and concatenation
too.
advertisement
Answer: b
Explanation: Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing
machines use Queue for the same.
Answer: c
Explanation: Pushdown Automaton uses stack as an auxiliary storage for its operations. Turing
machines use Queue for the same.
7. A context free grammar can be recognized by
a) Push down automata
b) 2 way linearly bounded automata
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: c
Explanation: A linearly bounded automata is a restricted non deterministic turing machine
which is capable of accepting ant context free grammar.
advertisement
Answer: a
Explanation: Null production is always taken as a string in computational theory.
9. The context free grammar which generates a Regular Language is termed as:
a) Context Regular Grammar
b) Regular Grammar
c) Context Sensitive Grammar
d) None of the mentioned
View Answer
Answer: b
Explanation: Regular grammar is a subset of Context free grammar. The CFGs which produces
a language for which a finite automaton can be created is called Regular grammar.
Answer: a
Explanation: NPDA stands for non-deterministic push down automata whereas DPDA stands for
deterministic push down automata.
advertisement
Recommended Posts:
This set of Basic Automata Theory Questions and Answers focuses on “From Grammars to
Push Down Automata”.
1. The production of the form A->B , where A and B are non terminals is called
a) Null production
b) Unit production
c) Greibach Normal Form
d) Chomsky Normal Form
View Answer
Answer: b
Explanation: A->ε is termed as Null production while A->B is termed as Unit production.
advertisement
Answer: a
Explanation: Halting states are the new tuple members introduced in turing machine and is of
two types: Accept Halting State and Reject Halting State.
Answer: a
Explanation:
Answer: d
Explanation: z0 is the initial stack symbol, is an element of G. Other symbols like d represents
the transition function of the machine.
advertisement
5. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
a) Moves
b) transition function
c) or/not symbol
d) none of the mentioned
View Answer
Answer: a
Explanation: Using this notation, we can define moves and further acceptance of a string by the
machine.
Answer: a
Explanation: If M is a DPDA accepting L by an empty stsck, R and T are distinct strings in L,
and R is a prefix of T, then the sequence of moves M must make in order to accept R leaves the
stack empty, since R∈L. But then T cannot be accepted, since M cant move with an empty stack.
Answer: d
Explanation: Theorem: The language pal of palindromes over the alphabet {0,1} cannot be
accepted by any finite automaton , and it is therefore not regular.
advertisement
8. For a counter automaton, with the symbols A and Z0, the string on the stack is always in the
form of __________
a) A
b) AnZ0, n>=0
c) Z0An, n>=0
d) None of the mentioned
View Answer
Answer: b
Explanation:The possible change in the stack contents is a change in the number of A’s on the
stack.
Answer: a
Explanation: The PDA works as follows. Instead of saving excess 0’s or 1’s on the stack, we
save *’s and use two different states to indicate which symbol there is currently a surplus of.
The state q0 is the initial state and the only accepting state.
Answer: d
Explanation: A string is said to be balanced if it consist of equal number of 0’s and 1’s.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “From
PDA to Grammars”.
Answer: d
Explanation: The instantaneous description of a PDA is represented by 3 tuple:
(q,w,s)
where q is the state, w is the unconsumed input and s is the stack content.
advertisement
Answer: a
Explanation: A turnstile notation is used for connecting pairs od ID’s taht represents one or
many moves of a PDA.
3. Which of the following option resembles the given PDA?
a) {0n1n|n>=0}
b) {0n12n|n>=0}
c) {02n1n|n>=0}
d) None of the mentioned
View Answer
Answer: a
a) {wwr|w=(a+b)*}
b) ε is called the initial stack symbol
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: Initially we put a special symbol ‘#’ into the empty stack. At state q1, the w is
being read. In state q2, each 0 or 1 is popped when it matches the input. If any other input is
given, the PDA will go to a dead state. When we reach that special symbol ‘#’, we go to the
accepting state q3.
advertisement
Answer: d
Explanation:
All the assertions mentioned are theorems or corollary.
Answer: d
Explanation: Yes, a PDA can be represented using a transition diagram, transition table and an
instantaneous description.
Answer: a
Explanation: Push down automata is the automaton machine for all the context free grammar or
Type 2 languages.
advertisement
Answer: c
Explanation: Geraud proved the equivalence problem decidable for Deterministic PDA .
9. Which of the following are the actions that operates on stack top?
a) Pushing
b) Popping
c) Replacing
d) All of the mentioned
View Answer
Answer: d
Explanation: Push, pop and replace are all the basic and only operations that takes place on stack
top.
10. A push down automata is said to be _________ if it has atmost one transition around all
configurations.
a) Finite
b) Non regular
c) Non-deterministic
d) Deterministic
View Answer
Answer: d
Explanation: DPDA or Deterministic Push down automata has atmost one transition applicable
to each configuration.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Deterministic PDA”
1. The transition a Push down automaton makes is additionally dependent upon the:
a) stack
b) input tape
c) terminals
d) none of the mentioned
View Answer
Answer: a
Explanation: A PDA is a finite machine which has an additional stack storage. Its transitions are
based not only on input and the correct state but also on the stack.
advertisement
Answer: a
Explanation: A machine configuration is an element of K×Σ*×Γ*.
(p,w,γ) = (current state, unprocessed input, stack content).
Answer: b
Explanation: A string w is accepted by a PDA if and only if (s,w, e) |-* (f, e, e)
4. With reference of a DPDA, which among the following do we perform from the start state
with an empty stack?
a) process the whole string
b) end in final state
c) end with an empty stack
d) all of the mentioned
View Answer
Answer: d
Explanation: The empty stack in the end is our requirement relative to finite state automatons.
advertisement
Answer: a
Explanation: A Deterministic Push Down Automata is a Push Down Automata in which no state
p has two or more transitions.
Answer: a
Explanation: There exists two lemma’s such that:
a) Given a grammar G, construct the PDA and show the equivalence
b) Given a PDA, construct a grammar and show the equivalence
7. If the PDA does not stop on an accepting state and the stack is not empty, the string is:
a) rejected
b) goes into loop forever
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: a
Explanation: To accept a string, PDA needs to halt at an accepting state and with a stack empty,
else it is called rejected. Given a PDA M, we can construct a PDA M’ that accepts the same
language as M, by both acceptance criteria.
advertisement
8. A language accepted by Deterministic Push down automata is closed under which of the
following?
a) Complement
b) Union
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: Deterministic Context free languages(one accepted by PDA by final state), are
drastically different from the context free languages. For example they are closed under
complementation and not union.
Answer: a
Explanation: JFLAP is a software for experimenting with formal topics including NFA, NPDA,
multi-tape turing machines and L-systems.
Answer: a
Explanation: The linear encodings of languages accepted by finite nested word automata gives
the class of ‘visibly pushdown automata’.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Terms of Service
2. C# Programming Examples on Threads
3. C Programming Examples on Data-Structures
4. Java Programming Examples on Exception Handling
5. VLSI Questions and Answers
6. CSS Questions and Answers
7. Information Science Questions and Answers
8. Computer Science Questions and Answers
9. Java Programming Examples on Set & String Problems & Algorithms
10. Solid State Chemistry Questions and Answers
11. Theory of Machines Questions and Answers
12. Python Programming Examples on Stacks & Queues
13. C Programming Examples on Stacks & Queues
14. Network Theory Questions and Answers
15. C++ Programming Examples on Set & String Problems & Algorithms
16. Electromagnetic Theory Questions and Answers
17. C Programming Examples on Set & String Problems & Algorithms
18. C# Programming Examples on Data Structures
19. Compilers Questions and Answers
20. Automata Theory Questions and Answers
advertisement
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Regular Languages and D-PDA”.
Answer: a
Explanation: All regular languages can be accepted by a non deterministic finite automata and
all context free languages can be accepted by a non deterministic push down automata.
advertisement
2. Let T={p, q, r, s, t}. The number of strings in S* of length 4 such that no symbols can be
repeated.
a) 120
b) 625
c) 360
d) 36
View Answer
Answer: b
Explanation: Using the permutation rule, we can calculate that there will be total of 625
permutations on 5 elements taking 4 as the length.
Answer: a
Explanation: The chomsky hierarchy lays down the following order:
Regular<CFL<CSL<Unrestricted
Answer: c
Explanation: All the regular languages are the subset to context free languages and thus can be
accepted using push down automata.
advertisement
Answer: b
Explanation: e is the identity for concatenation. Thus, eR=R.
6. Which of the following strings do not belong the given regular expression?
(a)*(a+cba)
a) aa
b) aaa
c) acba
d) acbacba
View Answer
Answer: d
Explanation: The string acbacba is unacceptable by the regular expression (a)*(a+cba).
7. Which of the following regular expression allows strings on {a,b}* with length n where n is a
multiple of 4.
a) (a+b+ab+ba+aa+bb+aba+bab+abab+baba)*
b) (bbbb+aaaa)*
c) ((a+b)(a+b)(a+b)(a+b))*
d) None of the mentioned
View Answer
Answer: c
Explanation: Other mentioned options do not many of the combinations while option c seems
most reliable.
advertisement
Answer: d
Explanation: All the given options are generated by the given grammar. Using the methods of
left and right derivations, it is simpler to look for string which a grammar can generate.
Answer: b
Explanation: Here, the first mentioned b is fixed while the other can be zero or can be repeated
any number of time.
Answer: b
Explanation: Ant formal grammar is represented using a 4-tuple definition where V= finite set
of variables, T= set of terminal characters, P=set of productions and S= Starting Variable with
certain conditions based on the type of formal grammar.
advertisement
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Home
2. C# Programming Examples on Functions
3. LISP Questions and Answers
4. C# Programming Examples on Data Structures
5. C Tutorials
6. Computer Science Questions and Answers
7. C++ Programming Examples on Set & String Problems & Algorithms
8. C Programming Examples on Set & String Problems & Algorithms
9. Java Programming Examples on Utility Classes
10. C Programming Examples on Strings
11. Information Science Questions and Answers
12. Java Programming Examples on Set & String Problems & Algorithms
13. Java Programming Examples on String Handling
14. Python Questions and Answers
15. Theory of Machines Questions and Answers
16. Network Theory Questions and Answers
17. PHP Questions and Answers
18. Electromagnetic Theory Questions and Answers
19. Compilers Questions and Answers
20. Automata Theory Questions and Answers
advertisement
Answer: c
Explanation: Chomsky hierarchy decide four type of language :Type 3- Regular Language, Type
2-Context free language, Type 1-Context Sensitive Language, Type 0- Unrestricted or
Recursively Ennumerable language.
advertisement
2. a→b
Restriction: Length of b must be atleast as much length of a.
Which of the following is correct for the given assertion?
a) Greibach Normal form
b) Context Sensitive Language
c) Chomsky Normal form
d) Recursively Ennumerable language
View Answer
Answer: b
Explanation: A context-sensitive grammar (CSG) is a formal grammar in which the left-hand
sides and right-hand sides of any production rules may be surrounded by a context of terminal
and non terminal symbols. Context-sensitive grammars are more general than context-free
grammars, in the sense that there are some languages that cannot be described by context-free
grammars, but can be described by CSG.
Answer: a
Explanation: V is the set of non terminal symbols while T is the st of terminal symbols, their
intersection would always be null.
Answer: b
Explanation: The grammar with right recursive production is known as Right recursive
grammar. Right recursive production is of the form X->aX where a is a terminal and X is a non
terminal.
advertisement
6. If the partial derivation tree contains the root as the starting variable, the form is known as:
a) Chomsky hierarchy
b) Sentential form
c) Root form
d) None of the mentioned
View Answer
Answer: b
Explanation: Example: For any grammar, productions be:
S->AB
A->aaA| ^
B->Bb| ^
The partial derivation tree can be drawn as:
7. Find a regular expression for a grammar which generates a language which states :
L contains a set of strings starting wth an a and ending with a b, with something in the middle.
a) a(a*Ub*)b
b) a*(aUb)b*
c) a(a*b*)b
d) None of the mentioned
View Answer
Answer: a
Explanation: The grammar for the same language can be stated as :
(1) S → aMb
(2) M → A
(3) M → B
(4) A → e
(5) A → aA
(6) B → e
(7) B → bB
8. Which of the following is the correct representation of grammar for the given regular
expression?
a(aUb)*b
a) (1) S → aMb
(2) M → e
(3) M → aM
(4) M → bM
b) (1) S → aMb
(2) M → Mab
(3) M → aM
(4) M → bM
advertisement
c) (1) S → aMb
(2) M → e
(3) M → aMb
(4) M → bMa
Answer: a
Explanation:
The basic idea of grammar formalisms is to capture the structure of string by
a) using special symbols to stand for substrings of a particular structure
b) using rules to specify how the substrings are combined to form new substrings.
Answer: d
Explanation: A CFG consists of:
a) a set of terminals, which are characters of alphabets that appear in the string generated by the
grammar.
b) a set of non terminals, which are placeholders for patterns of terminal symbols that can be
generated by the nonterminal symbols.
c) a set of productions, which are set of rules to transit from one state to other forming up the
string
d) a start symbol, a special non terminal symbol that appears in the initial string generated in the
grammar.
10. A CFG for a program describing strings of letters with the word “main” somewhere in the
string:
a) -> m a i n
-> | epsilon
-> A | B | … | Z | a | b … | z
b) –> m a i n
–>
–> A | B | … | Z | a | b … | z
advertisement
c) –> m a i n
–> | epsilon
–> A | B | … | Z | a | b … | z
Answer: a
Explanation: None.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“DPDA and Ambiguous Grammars”.
Answer: d
Explanation:
Context-free grammars are strictly more powerful than regular expressions:
1) Any language that can be generated using regular expressions can be generated by a context-
free grammar.
2) There are languages that can be generated by a context-free grammar that cannot be generated
by any regular expression.
As a corollary, CFGs are strictly more powerful than DFAs and NDFAs.
advertisement
2. State true or false:
S-> 0S1|01
Statement: No regular expression exists for the given grammar.
a) true
b) false
View Answer
Answer: a
Explanation: The grammar generates a language L such that L={0n1n|n>=1} which is not
regular. Thus, no regular expression exists for the same.
3. For the given set of code, the grammar representing real numbers in Pascal has error in one of
the six lines. Fetch the error.
(1) ->
(2) -> | epsilon
(3) -> | epsilon
(4) -> ‘E’ | epsilon
(5) -> + | – | epsilon
(6) -> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
a) 3
b) 4
c) 2
d) No errors
View Answer
Answer: a
Explanation:
–>
–> | epsilon
–> ‘.’ | epsilon
–> ‘E’ | epsilon
–> + | – | epsilon
–> 0 | 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9
Answer: b
Explanation: The root or interms of the grammar, starting variable can not be a terminal.
advertisement
5. Let G=(V, T, P, S)
where a production can be written as:
S->aAS|a
A->SbA|ba|SS
Which of the following string is produced by the grammar?
a) aabbaab
b) aabbaa
c) baabab
d) None of the mentioned
View Answer
Answer: b
Explanation: The step wise grammar translation can be written as:
aAS->aSbaA->aabAS->aabbaa
Answer: c
Explanation: One language can more than one grammar. Some can be ambiguous and some
cannot.
Answer: d
Explanation: Here are some process used to simplify a CFG but to produce an equivalent
grammar:
a) Removal of useless symbols(non terminal) b) Removal of Unit productions and c) Removal
of Null productions.
advertisement
Answer: a
Explanation: None.
Answer: d
Explanation: The language is recursive and every recursive language is a CFL.
10. L->rLt|tLr|t|r
The given grammar produces a language which is:
a) All palindrome
b) All even palindromes
c) All odd palindromes
d) Strings with same begin and end symbols
View Answer
Answer: c
Explanation: As there exists no production for the palindrome set, even palindromes like abba,
aabbaa, baaaaaab, etc will not be generated.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Assessment Questions and Answers focuses on “CFG-Eliminating
Useless Symbols”.
1. Suppose A->xBz and B->y, then the simplified grammar would be:
a) A->xyz
b) A->xBz|xyz
c) A->xBz|B|y
d) none of the mentioned
View Answer
Answer: a
Explanation: For the first step, substitute B in first production as it only produces terminal and
remove B production as it has already been utilized.
We get A->xBz|xyz and now, as B has no production, we eliminate the terms which hold the
variable B, thus the answer remain A->xyz.
advertisement
Answer: d
Explanation: Some derivations are not reachable from the starting variable. As B is not
reachable from the starting variable, it is a useless symbol and thus, can be eliminated.
3. Given:
S->…->xAy->…->w
if ____________, then A is useful, else useless symbol.
a) A is a non terminal
b) A is a terminal
c) w Î L
d) w Ë L
View Answer
Answer: c
Explanation: Whatever operation we perform in intermediate stages, if the string produced
belongs to the language, A is termed as useful and if not, not a useful variable.
4. Given:
S->aSb
S->e
S-> A
A->aA
B->C
C->D
The ratio of number of useless variables to number of useless production is:
a) 1
b) 3/4
c) 2/3
d) 0
View Answer
Answer: a
Explanation: A, B, C, D are the useless symbols in the given grammar as they never tend to lead
to a terminal. The productions S-> A, A->aA, B->C, C->D are also termed as useless production
as they will never produce a string to the grammar.
5. Given grammar G:
S->aS|A|C
A->a
B->aa
C->aCb
Find the set of variables thet can produce strings only with the set of terminals.
a) {C}
b) {A,B}
c) {A,B,S}
d) None of the mentioned
View Answer
Answer: c
Explanation: First step: Make a set of variables that directly end up with a terminal
Second step: Modify the set with variables that produce the elements of above
generated set.
The rest variables are termed as useless.
advertisement
6. Given grammar:
S->aS|A
A->a
B->aa
Find the number of variables reachable from the Starting Variable?
a) 0
b) 1
c) 2
d) None of the mentioned
View Answer
Answer: b
Explanation: Use a dependency graph to find which variable is reachable and which is not.
7. Inorder to simplify a context free grammar, we can skip the following operation:
a) Removal of null production
b) Removal of useless symbols
c) Removal of unit productions
d) None of the mentioned
View Answer
Answer: d
Explanation: Inorder to simplify the grammar all of the process including the removal of null
productions, unit productions and useless symbols is necessary.
8. Given a Grammar G:
S->aA
A->a
A->B
B->A
B->bb
Which among the following will be the simplified grammar?
a) S->aA|aB, A->a, B->bb
b) S->aA|aB, A->B, B->bb
c) S->aA|aB, A->a, B->A
d) None of the emntioned
View Answer
Answer: a
Explanation: Step 1: Substitute A->B
Step 2: Remove B->B
Step 3: Substitute B->A
Step 4: Remove Repeated productions
9. Simplify the given grammar:
A-> a| aaA| abBc
B-> abba| b
advertisement
Answer: a
Explanation: Using the substitution rules, we can simply eradicate what is useless and thus
produce the simplified result i.e. A-> a| aaA| ababbAc| abbc.
10. In context to the process of removing useless symbols, which of the following is correct?
a) We remove the Nullable variables
b) We eliminate the unit productions
c) We eliminate products which yield no terminals
d) All of the mentioned
View Answer
Answer: c
Explanation: In the process of removal of useless symbols, we want to remove productions that
can never take part in any derivation.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Eliminating Epsilon Productions”.
Answer: a
Explanation: We use the concept of dependency graph inorder to check, whether any of the
variable is reachable from the starting variable or not.
advertisement
Answer: b
Explanation: Any variable A for which the derivation: A->*e is possible is called Nullable.
3. Statement:
For A-> e ,A can be erased. So whenever it appears on the left side of a production, replace with
another production without the A.
State true or false:
a) true
b) false
View Answer
Answer: b
Explanation: A can be erased. So whenever it appears on the right side of the production,
replace with another production without the A.
Answer: a
Explanation: As X is nullable, we replace every right hand side presence of X with e and
produce the simplified result.
advertisement
Answer: b
Explanation: The modified grammar aftyer the removal of nullable can be shown as:
B->aAbC| abC
B->bAbA| bbA| bAb| bb
A->bB
6. Let G=(V, T, P, S) be a CFG such that _____________. Then there exists an equivalent
grammar G’ having no e productions.
a) e ∈ L(G)
b) w ∉ L(G)
c) e ∉ L(G)
d) w ∈ L(G)
View Answer
Answer: c
Explanation: Theorem: Let G = (V, T, S, P) be a CFG such that e ∉ L(G). Then there exists an
equivalent grammar G’ having no e-productions.
Answer: b
Explanation: It is an exception that A->e is not put into P’ if all x(i) are nullable variables.
advertisement
Answer: d
Explanation: The grammar after the removal of epsilon production can be shown as:
S->ABaC| AaC| ABa| Aa| a| aC| Ba| BaC
A->BC| B| C
B->b
C->D
D-> d
Answer: b
Explanation: We will replace all the nullables wherever they appear in the right hand side of any
production. D will not be erased as we are just removing nullable variables not completely
simplifying the grammar.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Eliminating Unit Productions”.
Answer: a
Explanation: Any production of the format A-> B where A and B belongs to the V set, is called
Unit production.
advertisement
2. Given Grammar G:
S->aA
A->a| A
B->B
The number of productions to be removed immediately as Unit productions:
a) 0
b) 1
c) 2
d) 3
View Answer
Answer: c
Explanation: The productions in the format A-> A are removed immediately as they produce
self and that is not a terminal or will not lead to a string. Hence, it is removed immediately.
3. Given grammar:
S->aA
A->a
A->B
B-> A
B->bb
Which of the following is the production of B after simplification by removal of unit
productions?
a) A
b) bb
c) aA
d) A| bb
View Answer
Answer: b
Explanation: The simplified grammar can be presented as follows:
S->aA| aB
A->a
B-> bb
4. If grammar G is unambiguous, G’ produced after the removal of Unit production will be:
a) ambiguous
b) unambiguous
c) finite
d) cannot be said
View Answer
Answer: b
Explanation: With the simplification of Context free grammars, undesirable properties are
introduced. It says, if grammar G, before simplification is unambiguous, after simplification will
also be unambiguous.
advertisement
Answer: c
Explanation:
If A-> B is a production, B is called A- derivable.
If C is A-derivable, C->B is a production, and B ¹ A, then B is A -derivable.
No other variables are A-derivable.
6. A can be A-> derivable if and only if __________
a) A-> A is actually a production
b) A->B, B-> A exists
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: The format says: If A->B is a production, B is called A-derivable.Thus A to be A-
derivable, a production : A-> A need to exist.
7. Given Grammar:
T-> T+R| R
R-> R*V| V
V->(T)| u
When unit productions are deleted we are left with
T-> T+R| _______|(T)| u
R->R*V|(T)| u
V-> (T)| u
Fill in the blank:
a) T*V
b) T+V
c) R*T
d) R*V
View Answer
Answer: d
Explanation: The grammar produced after the elimination of unit production is:
T-> T+R| R*V| (T)| u
R->R*V|(T)| u
V-> (T)| u
advertisement
8. Given grammar G:
S-> ABA, A->aA|e, B-> bB|e
Eliminate e and unit productions. State the number of productions the starting variable holds?
a) 6
b) 7
c) 9
d) 5
View Answer
Answer: b
Explanation: After reduction the grammar looks like:
S->ABA| AB| BA| AA| Aa| a| bB| b
A->aA| a
B->bB| b
9. Given grammar G:
S-> A| B| C
A-> aAa| B
B-> bB|bb
C->aCaa|D
D->baD|abD|aa
Eliminate e and unit productions and state the number of variables left?
a) 5
b) 4
c) 3
d) 2
View Answer
Answer: 5
Explanation: The reduced production:
S->aAa| bB|bb aCaa| baD| abD| aa, A->aAa| bB| bb, B->bB| bb, C->aCaa| baD| abD| aa, D->
baD| abD| aa
10. Which of the following variables in the given grammar is called live variable?
S->AB
A->a
a) S
b) A
c) B
d) None of the mentioned
View Answer
Answer: b
Explanation: Any variable A for which there is a production A-> x with x Ε Σ* is called live.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Chomsky Normal Form”.
Answer: b
Explanation: A context free grammar is in Greibach Normal Form if the right hand sides of all
the production rules start with a terminal, optionally followed by some variables.
advertisement
Answer: c
Explanation: Conversely, every context frr grammar can be converted into Chomsky Normal
form and to other forms.
Answer: d
Explanation: in CNF, the production rules are of the form:
A->BC
A-> a
S->e
advertisement
5. Given grammar G:
(1)S->AS
(2)S->AAS
(3)A->SA
(4)A->aa
Which of the following productions denies the format of Chomsky Normal Form?
a) 2,4
b) 1,3
c) 1, 2, 3, 4
d) 2, 3, 4
View Answer
Answer: a
Explanation: The correct format: A->BC, A->a, X->e.
Answer: a
Explanation: We can eliminate the options on the basis of the format we are aware of: A->BC,
B->b and so on.
7. With reference to the process of conversion of a context free grammar to CNF, the number of
variables to be introduced for the terminals are:
S->ABa
A->aab
B->Ac
a) 3
b) 4
c) 2
d) 5
View Answer
Answer: a
Explanation: According to the number of terminals present in the grammar, we need the
corresponding that number of terminal variables while conversion.
advertisement
8. In which of the following, does the CNF conversion find its use?
a) CYK Algorithm
b) Bottom up parsing
c) Preprocessing step in some algorithms
d) All of the mentioned
View Answer
Answer: d
Explanation: Besides the theoretical significance of CNF, it conversion scheme is helpful in
algorithms as a preprocessing step, CYK algorithms and the bottom up parsing of context free
grammars.
9. Let G be a grammar. When the production in G satisfy certain restrictions, then G is said to be
in ___________.
a) restricted form
b) parsed form
c) normal form
d) all of the mentioned
View Answer
Answer: c
Explanation: When the production in G satisfy certain restrictions, then G is said to be in
‘normal form’.
Answer: a
Explanation: e is allowed in CNF only if the starting variable does not occur on the right hand
side of the derivation.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Questions and Answers for Campus interviews focuses on
“Pumping Lemma for Context Free Language”.
Answer: b
Explanation: In automata theory, the pumping lemma for context free languages, also kmown as
the Bar-Hillel lemma, represents a property of all context free languages.
advertisement
2. Which of the expressions correctly is an requirement of the pumping lemma for the context
free languages?
a) uvnwxny
b) uvnwnxny
c) uv2nwx2ny
d) All of the mentioned
View Answer
Answer: b
Explanation: Let L be a CFL. Then there is an integer n so that for any u that belong to language
L satisfying |t| >=n, there are strings u, v, w, x, y and z satisfying
t=uvwxy
|vx|>0
|vwx|<=n For any m>=0, uvnwxny ∈ L
3.Let L be a CFL. Then there is an integer n so that for any u that belong to language L
satisfying
|t|>=n, there are strings u, v, w, x, y and z satisfying
t=uvwxy.
Let p be the number of variables in CNF form of the context free grammar. The value of n in
terms of p :
a) 2p
b) 2p
c) 2p+1
d) p2
View Answer
Answer: c
Explanation: This inequation has been derived from derivation tree for t which must have height
at least p+2(It has more than 2p leaf nodes, and therefore its height is >p+1).
4. Which of the following gives a positive result to the pumping lemma restrictions and
requirements?
a) {aibici|i>=0}
b) {0i1i|i>=0}
c) {ss|s∈{a,b}*}
d) None of the mentioned
View Answer
Answer: b
Explanation: A positive result to the pumping lemma shows that the language is a CFL and ist
contradiction or negative result shows that the given language is not a Context Free language.
advertisement
5. Using pumping lemma, which of the following cannot be proved as ‘not a CFL’?
a) {aibici|i>=0}
b) {ss|s∈{a,b}*}
c) The set legal C programs
d) None of the mentioned
View Answer
Answer: d
Explanation: There are few rules in C that are context dependent. For example, declaration of a
variable before it can be used.
Answer: b
Explanation: Although the pumping lemma provides some information about v and x that are
pumped, it says little about the location of these substrings in the string t. It can be used
whenever the pumping lemma fails. Example: {apbqcrds|p=0 or q=r=s}, etc.
Answer: c
Explanation: A set of context free language is closed under the following operations:
a) Union
b) Concatenation
c) Kleene
advertisement
Answer: b
Explanation: The pumping lemma is often used to prove that a given language L is non-context-
free, by showing that arbitrarily long strings s are in L that cannot be “pumped” without
producing strings outside L.
Answer: a
Explanation: There exists a property of all strings in the language that are of length p, where p is
the constant-called the pumping length .For a finite language L, p is equal to the maximum
string length in L plus 1.
10. Which of the following does not obey pumping lemma for context free languages ?
a) Finite languages
b) Context free languages
c) Unrestricted languages
d) None of the mentioned
View Answer
Answer: c
Explanation: Finite languages (which are regular hence context free ) obey pumping lemma
where as unrestricted languages like recursive languages do not obey pumping lemma for
context free languages.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “CFL-
Closure Properties/Decision Properties”.
Answer: a
Explanation:
T->S|R
S->aSb
S->e
R->cRd
R->e
Answer: d
Explanation: It is a theorem which states that, Context free languages are not closed under
operations like intersection and complement.
Answer: d
Explanation: These properties are termed as decision properties of a CFL and include a set of
problems like infiniteness problem, emptiness problem and membership problem.
advertisement
5. If the start symbol is one of those symbols which produce no terminal through any sequence,
the CFL is said to be
a) nullable
b) empty
c) eliminated
d) none of the mentioned
View Answer
Answer: b
Explanation: In the process of removing useless symbols, if the starting symbol is also a part,
the CFL can be then termed as empty; otherwise not.
6. Using the pumping constant n, If there is a string in the language of length between _____
and ____ then the language is infite else not.
a) n, 2n-1
b) 2n, n
c) n+1, 3n+6
d) 0, n+1
View Answer
Answer: a
Explanation: If there is a string in the language of length between n and 2n-1 then the language
is infite else not. The idea is essentially the same for regular languages.
Answer: d
Explanation: CFL is closed under union, kleene and concatenation along with the properties
reversal,homomorphism and inverse homomorphism but not difference and intersection.
advertisement
Answer: c
Explanation: Context free languages are not closed under difference, intersection and
complement operations.
9. A___________ is context free grammar with atmost one non terminal in the right handside of
the production.
a) linear grammar
b) linear bounded grammar
c) regular grammar
d) none of the mentioned
View Answer
Answer: a
Explanation: A simple linear grammar is G with N = {S}, Σ = {a, b}, P with start symbol S and
rules
S → aSb
S→ε
Answer: c
Explanation: Linear grammar is a subset of context free grammar which has atmost one non
terminal symbol in the right hand side of the production.Thus, there exists some languages
which are generated by Linear grammars.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “CFL-
Other Normal Forms”.
Answer: c
Explanation: Linearly Bounded grammar or Kuroda Normal Form allows the following format
of grammatical analysis:
AB->CD
A->BC or
A->B or
A->a
advertisement
Answer: b
Explanation: Every context sensitive grammar which does not produce an empty string can be
generated by a grammar in Kuroda Normal form.
Answer: a
Explanation: Pentonnen Normal form(for Unrestricted grammars) is a special case where there
is a slight modification in the format of Kuroda Normal form.
AB->AD
A->BC
A->a
4. Given a grammar in GNF and a derivable string in the grammar with the length n, any
___________will halt at depth n.
a) top-down parser
b) bottom-up parser
c) multitape turing machine
d) none of the mentioned
View Answer
Answer: a
Explanation: Given a grammar in GNF and a derivable string in the grammar with the length n,
any top-down parser will halt at depth n. As the parameter ‘depth’ is mentioned, we will use a
top-down parser. Example-LL parser.
advertisement
Answer: a
Explanation: Donald Knuth implied a BNF” syntax in which all definitions have such a form
may be said to be in ”Floyd Normal Form”.
A->B|C
A->BC
A->a
6. Which among the following can parse a context free grammar?
a) top down parser
b) bottom up parser
c) CYK algorithm
d) all of the mentioned
View Answer
Answer: d
Explanation: We use certain algorithms to parse a context free grammar which include the most
popular CYK algorithm which employs the concept of bottom up parsing and dynamic parsing.
7. The standard version of CYK algorithm operates only on context free grammars in the
following form:
a) Greibach Normal form
b) Chomsky Normal form
c) Backus Naur form
d) All of the mentioned
View Answer
Answer: b
Explanation: It requires the presence of a context free grammar into Chomsky Normal form to
operate. However, every context free grammar can be converted into CNF for keeping the sense
of grammar equivalent.
advertisement
Answer: a
Explanation: This is the worst case running time of CYK and and this makes it one of the most
efficient algorithms for recognizing general context free languages in practice.
Answer: d
Explanation: Valiants algorithm is actually an extention of CYK which even computes the same
parsing table yet he showed another method can be utilized fro performing this operation.
10. Which among the following is a correct option in format for representing symbol and
expression in Backus normal form?
a) <symbol> ->expression
b) <symbol>::=_expression_
c) <symbol>=<expression>
d) all of the mentioned
View Answer
Answer: b
Explanation: <symbol>::=_expression_ is the correct representation where <symbol> is a non
terminal, and expression consist of one or more sequence of symbols, more sequence are
separated by |, indicating a choice.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Intersection with Regular Languages”.
Answer: c
Explanation: Context free languages are not closed under complement and intersection. Thus,
are called Negative properties.
advertisement
Answer: b
Explanation: If a language L1 is regular and L2 is a context free language, then L1 intersection
L2 will result into a context free language.
Answer: c
Explanation: As the language seems to be finite, a dfa can be constructed for the same, thus is
regular.
4. Which of the following is not context free?
a) {w: nA=nB=nC}
b) {a*b*c*}
c) {a100b100}
d) All of the mentioned
View Answer
Answer: d
Explanation: {a*b*c*} and (c) are regular languages while option (a) is not context free
language.
advertisement
5. Which of the following can be used to prove a language is not context free?
a) Ardens theorem
b) Power Construction method
c) Regular Closure
d) None of the mentioned
View Answer
Answer: c
Explanation: We can use the properties of regular closure to prove that a language is not a
context free language. Example: Intersection of context free language and regular language is a
context free language. Proof by contradiction helps here.
Answer: c
Explanation: CYK algorithm is a parsing algorithm for context free grammars, which employs
bottom up parsing and dynamic programming.
Answer: c
Explanation: The empty-language question can be stated as: For context free grammar G find if
L(G) =f?
advertisement
Answer: a
Explanation: A triangular table is constructed to facilitate the solution of membership problem
using bottom up parsing and dynamic programming.
9. Which of the following steps are wrong with respect to infiniteness problem?
a) Remove useless variables
b) Remove unit and epsilon production
c) Create dependency graph for variables
d) If there is a loop in the dependency graph the the language is finite else infinite
View Answer
Answer: d
Explanation: If we are able to detect a loop in the formed dependency graph, then the language
in infinite.
Answer: a
Explanation: At first, we detect useless symbols and discard them. Inorder to find whether a
symbol is useless, just make it the starting symbol and check for emptiness.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Engineering Drawing Questions and Answers
2. Java Programming Examples on Computational Geometry Problems & Algorithms
3. Java Programming Examples on Set & String Problems & Algorithms
4. Cryptography and Network Security Questions and Answers
5. Java Programming Examples on Data-Structures
6. C Programming Examples on Stacks & Queues
7. Computer Science Questions and Answers
8. Python Programming Examples on Stacks & Queues
9. C++ Programming Examples on Set & String Problems & Algorithms
10. C Programming Examples on Set & String Problems & Algorithms
11. Information Science Questions and Answers
12. Home
13. Theory of Machines Questions and Answers
14. Network Theory Questions and Answers
15. C++ Programming Examples on STL
16. Java Algorithms, Problems & Programming Examples
17. C++ Algorithms, Problems & Programming Examples
18. Electromagnetic Theory Questions and Answers
19. Compilers Questions and Answers
20. Automata Theory Questions and Answers
advertisement
This set of Automata Theory Interview Questions and Answers for freshers focuses on “Turing
Machine – Notation and Transition Diagrams”.
1. A turing machine is a
a) real machine
b) abstract machine
c) hypothetical machine
d) more than one option is correct
View Answer
Answer: d
Explanation: A turing machine is abstract or hypothetical machine thought by mathematician
Alan Turing in 1936 capable of simulating any algorithm, however complicated it is.
advertisement
Answer: b
Explanation: The turing machine operates on an infinite memory tape divided into cells. The
machine positions its head over the cell and reads the symbol.
3. Which of the functions are not performed by the turing machine after reading a symbol?
a) writes the symbol
b) moves the tape one cell left/right
c) proceeds with next instruction or halts
d) none of the mentioned
View Answer
Answer: d
Explanation: After the read head reads the symbol from the input tape, it performs the following
functions:
a) writes a symbol(some model allow symbol erasure/no writing)
b) moves the tape left or right (some models allows no motion)
c) proceeds with subsequent instruction or goes either into accepting halting state or rejecting
halting state.
4. ‘a’ in a-machine is :
a) Alan
b) arbitrary
c) automatic
d) None of the mentioned
View Answer
Answer: c
Explanation: The turing machine was invented by Alan turing in 1936. He named it as a-
machine(automatic machine).
advertisement
5. Which of the problems were not answered when the turing machine was invented?
a) Does a machine exists that can determine whether any arbitrary machine on its tape is
circular.
b) Does a machine exists that can determine whether any arbitrary machine on its tape is ever
prints a symbol
c) Hilbert Entscheidungs problem
d) None of the mentioned
View Answer
Answer: d
Explanation: Invention of turing machine answered a lot of questions which included problems
like decision problem, etc.) . Alan was able to prove the properties of computation using such
model.
6. The ability for a system of instructions to simulate a Turing Machine is called _________
a) Turing Completeness
b) Simulation
c) Turing Halting
d) None of the mentioned
View Answer
Answer: a
Explanation: Turing Completeness the ability for a system of instructions to simulate a Turing
machine. A programming language that is Turing complete is theoretically capable of
expressing all tasks accomplishable by computers; nearly all programming languages are Turing
complete.
Answer: d
Explanation: We can represent a turing machine, graphically, tabularly and diagramatically.
advertisement
Answer: d
Explanation: A n abstract machine also known as abstract computer, is a theoretical model of
computer or hardware system in automata theory. Abstraction in computing process usually
assumes a discrete time paradigm.
Answer: d
Explanation: A thought experiment considers some hypothesis, theory or principle for the
purpose of thinking through its consequences.
Answer: a
Explanation: In computer science, Random access machine is an abstract machine in the general
class of register machines. Random access machine should not be confused with Random access
memory.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The
Language of Turing Machine”.
Answer: b
Explanation: A more mathematically oriented definition with the same universal nature was
introduced by church and turing together called the Church-Turing thesis(formal theory of
computation).
advertisement
Answer: c
Explanation: Alan turing proved in 1936 that a general algorithm to solve the halting problem
for all possible program-input pairs cannot exist.
Answer: d
Explanation: A state register is one which stores the state of the turing machine, one of the
finitely many. Among these is the special start state with which the state register is initialized.
Answer: b
Explanation:
The 7-tuple definition of turing machine: (Q, S, G, d, q0, B, F)
where Q= The finite set of states of finite control
S= The finite set of input symbols
G= The complete set of tape symbols
d= The transition function
q0= The start state, a member of Q, in which the finite control is found initially.
B= The blank symbol
F= The set of final or accepting states, a subset of Q.
5. If d is not defined on the current state and the current tape symbol, then the machine ______
a) does not halts
b) halts
c) goes into loop forever
d) none of the mentioned
View Answer
Answer: b
Explanation: If we reach hA or hR, we say TM halts. Once it has halted, it cannot move further,
since d is not defined at any pair (hA,X) or (hR,X) where hA = accept halting state and hR = reject
halting state.
advertisement
Answer: a
Explanation: Inorder to describe formally what a Turing machine does, we need to develop a
notation for configurations or Instantaneous descriptions(ID).
Answer: d
Explanation: Many machines that might be thought to have more computational capability than
a simple UTM can be shown to have no more power. They might compute faster or use less
memory but cannot compute more powerfully i.e. more mathematical questions.
8. Which among the following is incorrect for o-machines?
a) Oracle Turing machines
b) Can be used to study decision problems
c) Visualizes Turing machine with a black box which is able to decide cerain decion problems in
one operation
d) None of the mentioned
View Answer
Answer: d
Explanation: In automata theory, an o- machine or oracle machine is a abstract machine used to
study decision problems. The problem the oracle solves can be of any complexity class. Even
undecidable problems like halting problems can be used.
Answer: b
Explanation: RASP or Random access stored program is an abstract machine that has instances
like modern stored computers.
advertisement
Answer: d
Explanation: In theoretical computer science, the random access stored program( RASP )
machine model is an abstract machine used for the purpose of algorithm development and
algorithm complexity theory.
Answer: a
Explanation: The Rasp is a random access machine model that, unlike the RAM has its program
in its registers together with its input. The registers are unbounded(infinite in capacity); whether
the number of registers is finite is model-specific.
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: d
Explanation: RE or recursively ennumerable is only called the class of recursively ennumerable
language.
advertisement
Answer: a,b
Explanation: A language L is recursively ennumerable if there is a turing machine that accepts
L, and recursive if there is a TM that recognizes L.(Sometimes these languages are alse called
Turing-acceptable and Turing-decidable respectively).
Answer: c
Explanation: Every recursive language is recursively ennumerable but there exists recursively
ennumerable languages that are not recursive. If L is accepted by a Non deterministic TM T, and
every possible sequence of moves of T causes it to halt, then L is recursive.
Answer: c
Explanation: If T is a turing machine recognizing L, we can make it recognize L’ by
interchanging the two outputs. And every recursive language is recursively ennumerable.
Answer: d
Explanation: The closure property of recursive languages include union, intersection and
complement operations.
Answer: c
Explanation: Theorem- If L is a recursively ennumerable language whose complement is
recursively ennumerable, then L is recursive.
advertisement
Answer: d
Explanation:
Answer: a
Explanation: To ennumerate a set means to list the elements once at a time, and to say that a set
is ennumerable should perhaps mean that there exists an algorithm for ennumerating it.
Answer: b
Explanation: A language L is recursively ennumerable if and only if it can be ennumerated by
some turing machine. A recursive ennumerable language may or may not be recursive.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Turing Machine and Halting”.
1. Which of the following regular expression resembles the given diagram?
a) {a}*{b}*{a,b}
b) {a,b}*{aba}
c) {a,b}*{bab}
d) {a,b}*{a}*{b}*
View Answer
Answer: b
Explanation: The given diagram is a transition graph for a turing machine which accepts the
language with the regular expression {a,b}*{aba}.
advertisement
2. Construct a turing machine which accepts a string with ‘aba’ as its substring.
a)
b)
c)
d)
View Answer
Answer: c
Explanation: The language consist of strings with a substring ‘aba’ as fixed at its end and the left
part can be anything including epsilon. Thus the turing machine uses five states to express the
language excluding the rejection halting state which if allowed can modify the graph as:
3. The number of states required to automate the last question i.e. {a,b}*{aba}{a,b}* using
finite automata:
a) 4
b) 3
c) 5
d) 6
View Answer
Answer: a
Explanation: The finite automata can be represented as:
Answer: c
Explanation: Three things can occur when a string is tested over a turing machine:
a) enter into accept halting state
b) enter into reject halting state
c) goes into loop forever
advertisement
a) L
b) R
c) S
d) None of the mentioned
View Answer
Answer: c
Explanation: D represents the direction in which automata moves forward as per the queue
which surely cannot be a starting variable.
Answer: c
Explanation: A language generating strings which are palindrome is not regular, thus cannot b
represented using a finite automaton.
Answer: d
Explanation: Different turing machines exist for operations like copying a string, deleting a
symbol, inserting a symbol and accepting palindromes.
advertisement
8. If T1 and T2 are two turing machines. The composite can be represented using the
expression:
a) T1T2
b) T1 U T2
c) T1 X T2
d) None of the mentioned
View Answer
Answer: a
Explanation: If T1 and T2 are TMs, with disjoint sets of non halting states and transition
function d1 and d2, respectively, we write T1T2 to denote this composite TM.
a) Copies a string
b) Delete a symbol
c) Insert a symbol
d) None of the mentioned
View Answer
Answer: b
Explanation: A turing machine does the deletion by changing the tape contents from yaz to yz,
where y belongs to (S U {#})*.
10. What does the following transition graph shows:
a) Copies a symbol
b) Reverses a string
c) Accepts a pal
d) None of the mentioned
View Answer
Answer: c
Explanation: The composite TM accepts the language of palindromes over {a, b} by comparing
the input string to its reverse and accepting if and only if the two are equal.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Home
2. Java Algorithms, Problems & Programming Examples
3. C++ Algorithms, Problems & Programming Examples
4. C Algorithms, Problems & Programming Examples
5. Java Programming Examples on Set & String Problems & Algorithms
6. C Programming Examples on Set & String Problems & Algorithms
7. Network Theory Questions and Answers
8. C++ Programming Examples on STL
9. C Programming Examples on Stacks & Queues
10. Electromagnetic Theory Questions and Answers
11. C++ Programming Examples on Set & String Problems & Algorithms
12. Machine Dynamics Questions and Answers
13. Python Programming Examples on Stacks & Queues
14. Machine Design Questions and Answers
15. Machine Kinematics Questions and Answers
16. Theory of Machines Questions and Answers
17. Machine Drawing Questions and Answers
18. Compilers Questions and Answers
19. Machine Tools & Machining Questions and Answers
20. Automata Theory Questions and Answers
advertisement
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Programming Techniques-Storage and Subroutines”.
Answer: a
Explanation: A turing machine has finite number of states in its CPU. However the states are not
small in number. Real computer consist of registers which can store values (fixed number of
bits).
advertisement
2. Suppose we have a simple computer with control unit holding a PC with a 32 bit address +
Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the
finite machine will hold:
a) 2(32*64)
b) 296
c) 96
d) 32
View Answer
Answer: b
Explanation: According to the statistics of the question, we will have a finite machine with 2^96
states.
a) Change a state
b) Write a tape symbol in the cell scanned
c) Move the tape head left or right
d) All of the mentioned
View Answer
Answer: d
Explanation: A move of a turing machine is the function of the state of finite control and the
tape symbol just scanned.
Answer: a
Explanation:
The finite control not only contains state q but also three data, A, B, C. The following technique
requires no extension to the Turing Machine model. Shaping states this way allows to describe
transitions in more systematic way and often to simplify the strategy of the program.
advertisement
Answer: a
Explanation: Cartesian product works like a struct in C/C++. For Example: Computer tape
storage is something like 8 or 9 bits in each cell. One can recognize a multi track tape machine
by looking at the transitions because each will have tuples as the read and write symbols.
6. A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X
represents:
a) input alphabet
b) tape alphabet
c) shift symbols
d) none of the mentioned
View Answer
Answer: b
Explanation: The 6-tuple (Q, X, S, d, q0, F) can be explained as:
Q represents finite set of states,
X represents the tape alphabet,
S represents the input alphabet
d represents the relation on states and the symbols
q0 represents the initial state
F represents the set of final states.
Answer: c
Explanation: In a n-track turing machine, one head reads and writes on all the tracks
simultaneously.
advertisement
Answer: a
Explanation: This can be generalized for n- tracks and can be proved equivalent using
ennumerable languages.
9. Which of the following is/are not true for recursively ennumerable language?
a) partially decidable
b) Turing acceptable
c) Turing Recognizable
d) None of the mentioned
View Answer
Answer: d
Explanation: In automata theory, a formal language is called recursively ennumerable language
or partially decidable or semi decidable or turing acceptable or turing recognizable if there exists
a turing machine which will ennumerate all valid strings of the language.
Answer: a
Explanation: Recursively Ennumerable languages are type 0 languages in the Chomsky
hierarchy. All regular, context free, context sensitive languages are recursivelyennumerable
language.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Multitape Turing Machines”.
Answer: a
Explanation: A multitape turing machine is an ordinary turing machine with multiple tapes.
Each tape has its own head to control the read and write.
advertisement
2. A multitape turing machine is ________ powerful than a single tape turing machine.
a) more
b) less
c) equal
d) none of the mentioned
View Answer
Answer: a
Explanation: The multitape turing machine model seems much powerful than the single tape
model, but any multi tape machine, no matter how many tapes, can be simulated by single taped
TM.
3. In what ratio, more computation time is needed to simulate multitape turing machines using
single tape turing machines?
a) doubly
b) triple
c) quadratically
d) none of the mentioned
View Answer
Answer: c
Explanation: Thus, multitape turing machines cannot calculate any more functions than single
tape machines.
Answer: c
Explanation: Two-stack Turing machines have a read-only input and two storage tapes. If a head
moves left on either tape a blank is printed on that tape, but one symbol from a “library” can be
printed.
advertisement
Answer: c
Explanation: A read only turing machine or 2 way deterministic finite automaton is a class of
model of computability that behaves like a turing machine, and can move in both directions
across input, except cannot write to its input tape.
Answer: a
Explanation: ATM is divide into two sets: an existential state is accepting if some transitions
leads to an accepting state; an universal state is accepting if every transition leads to an
accepting state.
7. Which of the following is false for Quantum Turing machine?
a) Abstract machine
b) Any quantum algorithm can be expressed formally as a particular quantum turing machine
c) Gives a solution to ‘Is a universal quantum computer sufficient’
d) None of the mentioned
View Answer
Answer: c
Explanation: ‘Is a universal quantum computer sufficient’ is one of the unsolved problem from
physics.
advertisement
Answer: b
Explanation: A deterministic turing machine is unambiguous and for every input, there is
exactly one operation possible. It is a subset of non-deterministic Turing machines.
Answer: d
Explanation: Turings a- machine or automatic machine was left ended,right end infinite.Any of
finite number of tape symbols were allowed and the 5 tuples were not in order.
Answer: c
Explanation: An oblivious turing machine where movements of various heads are fixed
functions of time, independent of the input. Pippenger and Fischer showed that any computation
that can be performed by a multi-tape Turing machine in n steps can be performed by an
oblivious two-tape Turing machine in O(n log n) steps.
advertisement
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Which of the following are related to construction of One Tape turing machines?
a) JFLAP
b) NFLAP
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: JFLAP is educational software written in java to experiment with the topics in
automata theory and area of formal languages.
advertisement
Answer: d
Explanation: Topics like regular expressions, context free languages and unrestricted grammar
including parsers like LL,SLR parsers can be covered using JFLAPS.
Answer: b
Explanation: Multitape turing machines do have multiple tapes but they they are accessed by
separate heads.
Answer: c
Explanation: A multitape turing machine is an ordinary turing machine which is always
abstract.And they do have their equivalent single tape turing machines.
advertisement
5. Are Multitape and Multitrack turing machines same?
a) Yes
b) No
c) Somewhat yes
d) Cannot tell
View Answer
Answer: a
Explanation: Multitrack turing machines are special types of Multitape turing machines. In a
standard n-tape Turing machine, n heads move independently along n-tracks.
6. In a n-track turing machine, _________ head/heads read and write on all tracks
simultaneously.
a) one
b) two
c) n
d) infinite
View Answer
Answer: a
Explanation: In a n-track Turing machine, one head reads and writes on all tracks
simultaneously. A tape position in a n-track Turing Machine contains n symbols from the tape
alphabet.
Answer: d
Explanation: All of the mentioned are one or the other kind of Turing machines in existence.
advertisement
Answer: b
Explanation: One needs a finite number of tapes. The proofs that show the equivalence between
multi-tape TM and one-band TM rely on the fact that the number of tapes is bounded.
Answer: d
Explanation: Tms can be used as both: language recognizers/Computers. TMs are like universal
computing machines with universal storage.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non
Deterministic Turing Machines”.
Answer: c
Explanation: Turing machine is known as universal computer. It is denoted by M=(Q,Σ,Ґ ,δ ,q0,
B,F)
advertisement
Answer: d
Explanation: A turing machine can have many applications like : Enumerator (A turing machine
with an output printer), function computer, etc.
Answer: d
Explanation: The following mentioned are the only possibilities of operating a string through a
turing machine.
Answer: d
Explanation: Except Recursion, all the other options are techniques of Turing Machine
construction which further includes, Checking off symbols and Storage in finite control.
advertisement
6. Which among the following is not true for 2-way infinte TM?
a) tape in both directions
b) Leftmost square not distinguished
c) Any computation that can be performed by 2-way infinite tape can also be performed by
standard TM.
d) None of the mentioned
View Answer
Answer: d
Explanation: All of the mentioned are correct statements for a two way infinite tape turing
machine. Theorems say the power of such a machine is in no way superior than a standard
turing machine.
Answer: a
Explanation: A turing machine can be used as a transducer. The most obvious way to do this is
to treat the entire non blank portion of the initial tape as input, and to treat the entire blank
portion of the tape when the machine halts as output.
8. Which of the following does not exists?
a) Mutitape TM
b) Multihead TM
c) Multidimentional TM
d) None of the mentioned
View Answer
Answer: d
Explanation: If the tape contains k-dimentional array of cells infinte in all 2k directions, for
some fixed k and has a finite control, the machine can be called Multidimentional TM.
Answer: a
Explanation: Here, the turing machine can use the printer as an output device to print strings.
Note: There is no input to an enumerator. If it doesn’t halt, it may print an infinite set of strings.
advertisement
Answer: b
Explanation: An enumerator is a turing machine with an output printer. It can use an printer as
an output device to print output strings. As n also holds the value , epsilon will also be a part of
the output set.
Answer: a
Explanation: If an Enumerator E enumerates a language L, there is a turing machine M that
recognizes language L. Also, If a turing machine M recognizes a language L, there is an
enumerator for L.
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. Can a single tape turing machine be simulated using deterministic 2-stack turing machine?
a) Yes
b) No
c) Cannot be said
d) none of the mentioned
View Answer
Answer: a
Explanation: The symbols to left of the head of turing macine being simulated can be stored on
the stack while the symbols on the right of the head can be placed on another stack. On each
stack, symbols closer to the TM’s head are placed closer to the top of the stack than symbols
farther from the TM’s head.
advertisement
2. A ___________ is a multi tape turing machine whose input tape is read only.
a) Counter Machine
b) Multi-stack
c) Alternating Turing machine
d) None of the mentioned
View Answer
Answer: a
Explanation: Counter machines are offline(a multitape turing machine whose input is read only)
whose storage tapes are semi-infinite and whose tape symbols contains only two symbols Z and
a blank symbol B.
Answer: d
Explanation: Instantaneous description of a counter machine can be described by the state, the
input tape contents, the position of input head, and the distance of storage heads from the
symbol Z. The counter machine can really store a count on each tape and tell if the count is zero.
Answer: d
Explanation: Another procedure to restrict a turing machine is to limit the size of tape alphabet
or reduce the number of states. If the tape alphabets, number of tapes or number of states are
limited, then there is only a finite number of different turing machine, so the restricted model is
more powerful than the original one.
advertisement
Answer: b
Explanation: Linear Bounded Automaton is a type of Turing Machine where tape is not allowed
to move off the portion of the tape containing the input. It is a Turing machine with limited
amount of memory.
Answer: true
Explanation: A TM with a semi-infinite tape means that there are no cells to the left of the initial
head position. A TM with a semi infinite tape simulates a TM with an infinite tape by using a
two-track tape.
7. Which of the following is true with reference to semi-infinite tape using a two track tape?
a) Can simulate a two way tape
b) Upper track represents the head-right cells
c) Lower track represents the head-left cells
d) All of the mentioned
View Answer
Answer: d
Explanation: The upper track represents the cells of the original TM that are at the right of the
initial head position. The lower track represents the cells to the left of the initial head position,
but in reverse order.
advertisement
9. A two-way infinite tape turing machine is ________ superior than the basic model of the
turing machine in terms of power.
a) more
b) less
c) no way
d) none of the mentioned
View Answer
Answer: c
Explanation: A two way infinite tape turing machine is a turing machine with its input tape
infinte in both directions, the other component being the same as the basic model.
Answer: d
Explanation: For a basic TM, there exists a 2-counter, 3-counter and 4-counter machines
We can prove them using Deterministic two stack turing machine.
Counter machine:
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Simulation of Turing Machine”.
Answer: d
Explanation: Computationally Universal or Turing Complete is a set of data manipulation rules
if it can be used to simulate a single-taped turing machine.
advertisement
2. Give a classic example of the concept of turing complete.
a) lambda calculus
b) C++
c) Lisp
d) All of the mentioned
View Answer
Answer: d
Explanation: Most of the programming languages, conventional or unconventional are turing
complete. Functional languages like Lisp and Haskell are also turing complete.
3. Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is
called:
a) Turing Equivalence
b) State Equivalence
c) Universal Turing Machine
d) None of the mentioned
View Answer
Answer: a
Explanation: It is a closely related concept with Turing complete. It says, two computers P and
Q are called equivalent if P can simulate Q and Q can simulate P.
Answer: c
Explanation: The following conclusion is laid down from the Church-Turing thesis:
Any function whose values can be computed by an algorithm, can be computed by a Turing
machine. If any real world computer can be simulated by a turing machine, it is Turing
equivalent to a Turing Machine.
advertisement
Answer: b
Explanation: The computational aspect of any possible real world computer can be simulated
using an Universal Turing Machine so can be any turing machine.
6. State true or false:
Statement: Inorder to show something is Turing complete, it is enough to demonstrate that it can
be used to simulate some Turing complete system.
a) true
b) false
View Answer
Answer: a
Explanation: Yes it is. For instance, an imperative language is called Turing complete if it tends
to have conditional branching and an ability to maintain an arbitrary number of symbols.
Answer: d
Explanation: Real computers which are manufactured till date, all are similar to single taped
turing machine. However, they have limited physical resources so they are linearly bounded
complete on the contrary.
advertisement
Answer: d
Explanation: All of the following mentioned are the conclusions of automata theory or
computability theory.
Answer: d
Explanation: Many games fall under the category og turing complete:
a) Minecraft
b) Minesweeper
c) Dwarf Fortress
d) Conway’s Game of Life
e) Pokemon Yellow, etc.
Answer: There exists some computational languages which are not turing complete. Regular
language which is accepted by finite automata tops the list. Other examples are pixel shader
languages embedded in Direct3D and OpenGL extensions.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The
Diagonalization Languages”
1. Which of the following technique is used to find whether a natural language isnt recursive
ennumerable?
a) Diagonalization
b) Recursive Induction
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: a
Explanation: To find a non recursively ennumerable language, we use the technique of
diagonalization.
advertisement
Answer: c
Explanation: Diagonalization is a technique we use for the following operations:
a) To find a non recursively ennumerable language.
b) To prove undecidablility of halting problem.
Answer: c
Explanation: In contrast we can put up an algorithm for checking whether two FA’s are
equivalent and this program can be implemented as a program.
4. Which of the following are incorrect options?
a) Informally, problem is a yes/no question about an infinite set of possible instances
b) Formally, a problem is a language
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: d
Explanation: Example: Does a graph G has a Hamilton cycle?
=>Each undirected graph is an instance of Hamilton cycle problem.
Answer: a
Explanation: An algorithm is a TM that halts on all inputs,accepted or not. Putting other way,
decidable problems are recursive languages.
advertisement
Answer: d
Explanation: All of the mentioned problems are undecidable.
Answer: d
Explanation: We can proof A to be undecidable using the contradiction method.
Answer: b
Explanation: Any recursive ennumerable language is not closed under complementation.
advertisement
Answer: c
Explanation: Halting problem: Does a given Turing machine M halt on a given input w?
Answer: a
Explanation: When turing machines are coded as Binary strings, we are restricted to take any
input alphabet except {0,1}.
12. With reference ti enumeration of binary strings, the conversion of binary strings to integer is
possible by treating the resulting string as a base ____ integer.
a) 2
b) 8
c) 16
d) All of the mentioned
View Answer
Answer: a
Explanation: It makes sense to talk about the i-th binary string” and about “the i-th Turing
machine. If i makes no sense as a TM, assume the i-th TM accepts nothing.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Questions and Answers for Experienced people focuses on “The
Universal Language-Undecidability”.
1. The decision problem is the function from string to ______________
a) char
b) int
c) boolean
d) none of the mentioned
View Answer
Answer: c
Explanation: The decision problem requires checking of input (string) has some property or not.
That is a string to boolean transaction.
advertisement
Answer: b
Explanation: Decidability refers to the decision problem and existence of a effective method for
determining membership, and return true and false accordingly rather that going into a loop
forever.
Answer: d
Explanation: Tarski and Mostowski in 1949, established that the first order theory of natural
numbers with addition, multiplication, and equality is an undecidable theory. Others mentioned
are decidable theories.
Answer: b
Explanation: Under decidablity of regular language properties we have the following lemma
which states that A DFA which recognizes an input w is decidable.
5. Which among the following are semi decidable?
a) Empty-DFA
b) Rec-NFA
c) Infinite-DFA
d) All of the mentioned
View Answer
Answer: d
Explanation: All are the properties of regular languages and all are decidable languages.
advertisement
Answer: c
Explanation: The language accepted by Turing machines are called recursively ennumerable
(RE), and the subset of RE languages that are accepted by a turing machine that always halts are
called recursive.
Answer: a
Explanation: We can refer to languages as ‘recursive’ and problems as ‘decidable’. If a language
is not recursive , then we call the problem expressed by that language undecidable.
8. The problems which have no algorithm, regardless of whether or not they are accepted by a
turing machine that fails to halts on some input are referred as:
a) Decidable
b) Undecidable
c) Computable
d) None of the mentioned
View Answer
Answer: b
Explanation: The problems that can be solved by a turing machine can divided into two classes:
a) Those that have an algorithm
b) Intractable problems: Those that are only solved by a turing machine that may run forever on
inputs they do not accept.
Answer: a
Explanation: Example: Runtimes of efficient algorithms
O(n), O(nlogn), O(n3log2n)
Runtimes of inefficient algorithms
O(2n), O(n!)
advertisement
10. A problem is called __________ if its has an efficient algorithm for itself.
a) tractable
b) intractable
c) computational
d) none of the mentioned
View Answer
Answer: a
Explanation: A problem is called intractable iff there is an efficient (i.e. polynomial time)
algorithm that solves it. A problem is called intractable iff there exists no efficient algorithm that
solves it.
Answer: d
Explanation: A formal language is called recursive if it is a recursive subset of the set of all
possible finite sequences over the alphabet of the language.
Answer: a
Explanation: A language is recursive if there exists a turing machine such that it halts i.e.
accepts if the input belongs to the language else rejects. It is better called Turing decidable
language.
Answer: a
Explanation: R is the set of all recursive languages, a class of decision problems solvable by
turing machines. Although, R is also used for the class RP.
advertisement
Answer: c
Explanation: All recursive languages are recursively enumerable. All regular, context free and
context sensitive languages are recursive.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Rice’s
Theorem, Properties and PCP”.
Answer: c
Explanation: Rice’s theorem states that ‘Any non trivial property about the language recognized
by a turing machine is undecidable’.
advertisement
Answer: a
Explanation: A property of partial functions is called trivial if it holds for all partial computable
functions or for none, and an effective decision method is called general if it decides correctly
for every algorithm.
Answer: c
Explanation: According to rice theorem, it is undecidable to determine whether the language
recognized by an arbitrary turing machine lies in S.
Answer: d
Explanation: According to Rice’s theorem, if there exists atleast one computable function in a
particular class C of computable functions and another computable function not in C then the
problem deciding whether a particular program computes a function in C is undecidable.
advertisement
Answer: d
Explanation: All of the following mentioned are immediate results of Rice’s theorem and thus,
undecidable.
Answer: b
Explanation: Post Correspondence problem is an undecidable decision problem that was
introduced by Emil Post in 1946. Being simpler than halting problem, it can be used in proofs of
undecidability.
Answer: a
Explanation: The MPCP is : Given lists A and B of K strings ,say A = w1 ,w2, …wk and B= x1,
x2,…..xk does there exists a sequence of integers i1,i2,…ir such that w1wi1wi2…..wir =
x1xi1xi2…xir?
advertisement
Answer: a
Explanation: PCP or Post Correspondence problem is an undecidable decision problem.
Answer: a
Explanation: Yes, it can be. There exists a theorem and as well as its proof which supports the
assertion.
10. Consider three decision problem A, B, C. A is decidable and B is not. Which of the
following is a correct option?
a) C is undecidable if C is reducible to B
b) C is undecidable if B is reducible to C
c) C is decidable if A is reducible to C
d) C is decidable if C is reducible to B’s complement.
View Answer
Answer: b
Explanation: As B is undecidable and it can be reduced to C, C is also an undecidable problem.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Interview Questions and Answers for Experienced people focuses
on “Problem Solvable in Polynomial Time”.
1. If the number of steps required to solve a problem is O(nk), then the problem is said to be
solved in:
a) non-polynomial time
b) polynomial time
c) infinite time
d) none of the mentioned
View Answer
Answer: b
Explanation: Most of the operations like addition, subtraction, etc as well as computing
functions including powers, square roots and logarithms can be performed in polynomial time.
In the given question, n is the complexity of the input and k is some non negative integer.
advertisement
Answer: a
Explanation: The value of such constants can be calculated using algorithms which have time
complexity in terms if O(nk) i.e polynomial time.
Answer: d
Explanation: In graph theory, a matching or independent edge set in a graph G is a set of edges
without common vertices. Given a graph (V, E), a matching M in G is a set of pairwise non
adjacent edges i.e. no two edges share a common vertex.
4. The complexity class P consist of all the decision problems that can be solved by
___________using polynomial amount of computation time.
Answer: d
Explanation: All the decision problems that can be solved using a Deterministic turing machine
using polynomial time to compute, all belong to the complexity class P.
advertisement
6. Which of the following options are correct with reference to P-complete problems?
a) used for the problems which are difficult to solve in limited space
b) every problem in P can be reduced to it using proper reductions
c) complete problem for complexity class P
d) all of the mentioned
View Answer
Answer: d
Explanation:
The notion of P-complete decision problems is useful in the analysis of:
a) which problems are tough to parallelize effectively
b) which problems are difficult to solve in limited space
7. A problem X belongs to P complexity class if there exist ________ algorithm to solve that
problem, such that the number of steps of the algorithms bounded by a polynomial in n, where n
is the length of the input.
a) 1
b) 2
c) 3
d) all of the mentioned
View Answer
Answer: d
Explanation: A problem X belongs to P complexity class if there exist atleast 1 algorithm to
solve that problem, such that the number of steps of the algorithms bounded by a polynomial in
n, where n is the length of the input. Thus, all the options are correct.
Answer: d
Explanation: Given a context free grammar and a string, can the string be generated by the
grammar? Such problems fall in the category of P-complete.
advertisement
10. In the above problem, if the input is binary, the class the problem belongs?
a) EXPSPACE
b) DLOGTIME
c) EXPTIME-complete
d) All of the mentioned
View Answer
Answer: c
Explanation: It is the set of all decision problems that have exponential run time i.e. solvable by
deterministic turing machine in O(2p(n)) time, where p(n) is a polynomial function of n.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “Non
Deterministic Polynomial Time”.
Answer: b
Explanation: NP is said to be one of the most fundamental complexity classes. NP is an acronym
for Non deterministic polynomial time.
advertisement
Answer: a
Explanation: NP class contains many important problems, the hardest of which is NP-complete,
whose solution is sufficient to deal with any other NP problem in polynomial time.
Answer: c
Explanation: It is sufficient to construct a PSPACE machine that loops over all proof strings and
feeds each one to a polynomial time verifier. It is also contained in EXPTIME, since the same
algorithm operates in exponential time.
Answer: b
Explanation: Travelling Salesman Problem: Given an input matrix of distances between n cities,
this problem is to determine if there is a route visiting all cities with total distance less than k.
Answer: a
Explanation: This is just a commutative property of NP complexity class where a problem is
said to be in NP if it can be solved using an algorithm which was used to solve another NP
problem in polynomial amount of time.
advertisement
Answer: a
Explanation: A problem is said to be NP Hard if an algorithm for solving the problem can be
translated from for solving any other problem. It is easier to show a problem NP than showing it
Np Hard.
Answer: d
Explanation: Primality testing is a simple example. To decide whether a number is prime or not,
one simply selects non deterministically a number checks whether factors exist for the number
or not.
8. In terms of NTIME, NP problems are the set of decision problems which can be solved using
a non deterministic machine in _______ time.
a) O(n)
b) O(n1/2)
c) O(nk), k∈N
d) None of the mentioned
View Answer
Answer: c
Explanation: The complexity class NP can be defined in terms of NTIME as:
NP=O(nk) for k ∈N.
Answer: c
Explanation: NP can be defined using deterministic turing machines as verifiers.
advertisement
Answer: d
Explanation: This is a list of some problems which are in NP:
a) All problems in P
b) Decision version of Integer factorization method
c) Graph Isomorphism Problem
d) All NP complete problems, etc.
11. Which of the following does not belong to the closure properties of NP class?
a) Union
b) Concatenation
c) Reversal
d) Complement
View Answer
Answer: d
Explanation: It is unknown about the closure property-complement for the complexity class NP.
The question is so called NP versus co-NP problem.
Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
Answer: c
Explanation: Vertex cover or Node cover problem, and Hamilton Circuit problem, both are NP
complete type of problems.
advertisement
Answer: d
Explanation: There exists a set of 21 problems that are NP-complete and the set is called Karp’s
21 NP-complete problems.
Answer: a
Explanation: Exact cover is a decision problem in computer science to determine if an exact
cover exists.
Answer: c
Explanation: The relation ‘contains’ can be represented using a bipartite graph. The vertices of
the graph can be divided into two disjoint sets, one representing the subset S and the other
representing the elements of P and one edge for each subset in S;each node is included in
exactly one of the edges forming the cover.
advertisement
5. For which of the following, greedy algorithm finds a minimal vertex cover in polynomial
time?
a) tree graphs
b) bipartite graphs
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: a
Explanation: For bipartite graphs, Konigs theorem allows the bipartite vertex problem to be
solved in polynomial time.
6. Hamilton circuit problem can have the following version/s as per the input graph:
a) directed
b) undirected
c) both (a) and (b)
d) none of the mentioned
View Answer
Answer: c
Explanation: Hamilton circuit problem is a problem determining whether a Hamiltonian path(a
path in an undirected or directed graph that visits each vertex exactly once) exists in a
graph(directed or undirected).
Answer: a
Explanation: Hamilton circuit problem is a special case of travelling salesman problem, obtained
by setting the distance between two cities to one if they are adjacent and two otherwise, and
verifying that the total distance travelled is equal to n (if so, the route is a Hamiltonian circuit; if
there is no Hamiltonian circuit then the shortest route will be longer).
advertisement
Answer: d
Explanation: Using Inclusion-exclusion principle, Andreas showed how to solve Hamilton
Circuit problem in arbitrary n-vertex graphs by a Monte Carlo algorithm in time O(1.657n).
9. State true or false:
Statement: Hamiltonian cycles through any fixed edge is always even, so if one such cycle is
given, the second one must also exists.
a) true
b) false
View Answer
Answer: a
Explanation: Handshaking lemma states that ‘Every finite undirected graph has an even number
of vertices with odd degree.
Answer: b
Explanation: Enumerative combinatorics is the most classical area of combinatorics and
concentrates on counting the number of certain combinatorial objects. Fibonacci series is a basic
example of Enumerative Combinatorics.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“PSPACE”.
1. All set of polynomial questions which can be solved by a turing machine using a polynomial
amount of space:
a) PSPACE
b) NPSPACE
c) EXPSPACE
d) None of the mentioned
View Answer
Answer: a
Explanation: PSPACE is the problem class which contains all set of decision problems which
can be solved using a turing machine taking polynomial amount of space.
advertisement
Answer: c
Explanation: Membership of a string in a language defined by an arbitrary context sensitive
grammar, or by an arbitrary determinisic context sensitive grammar, is a PSPACE -complete
problem.
3. Savitch theorem relates to which of the following:
a) PSPACE=NPSPACE
b) Alternating Turing Machine
c) Time complexity
d) None of the mentioned
View Answer
Answer: a
Explanation: Some important conclusions of Savitch theorem includes:
a) PSPACE=NPSPACE: square of a polynomial function is still a polynomial function.
b) NL∈L2
Answer: d
Explanation: The closure property of PSPACE class includes :- Union, Concatenation and
Kleene operation.
advertisement
Answer: c
Explanation: The given order is the only correct order and further PSPACE belongs to
EXPTIME class and subsequently occurs EXPSPACE class.
6. NL ∈ PSPACE ∈ EXPSPACE
The given relation involves which of the following theorems?
a) Space hierarchy theorem
b) Savitch’s theorem
c) Both (a) and (b)
d) None of the mentioned
View Answer
Answer: c
Explanation: From space hierarchy theorem: NL ∈ NPSPACE, from Savitch’s theorem:
NPSPACE= PSPACE.
Answer: a
Explanation: PSPACE-complete problems are the most difficut problems is PSPACE. Finding a
simple solution to PSPACE-complete means simple solution to all other problems in PSPACE
because all PSPACE problems can be reduced to PSPACE-complete problems.
advertisement
8. Without needing extra __________ we can simulate non deterministic turing machine using
deterministic turing machine.
a) time
b) space
c) both time and space
d) none of the mentioned
View Answer
Answer: b
Explanation: Though it may use extra time, but as PSPACE=NPSPACE from savitch’s theorem,
we can say that space taken is same for both the machins, deterministic as well as non-
deterministic.
Answer: a
Explanation: The complement of all the problems in PSPACE are also in PSPACE, meaning co-
PSPACE= PSPACE.
Answer: d
Explanation: An alternative characterization of PSPACE is a set of problems decidable by a
turing machine in polynomial time, sometimes called, APTIME or AP.
advertisement
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Randomized Algorithm”
1. A randomized algorithm uses random bits as input inorder to achieve a _____________ good
performance over all possible choice of random bits.
a) worst case
b) best case
c) average case
d) none of the mentioned
View Answer
Answer: c
Explanation: A randomized algorithm is an algorithm that employs a degree of randomness as a
part of its logic using random bits as inputs and in hope of producing average case good
performace.
advertisement
Answer: a
Explanation: The other type of algorithms are probabalistic algorithms, which depending upon
the random input, have a chance of producing incorrect results or fail to produce a result.
Answer: d
Explanation: Monte Carlo algorithms are very vast, but only probably correct. On thr other side,
Las Vegas algorithms are always correct, but probably fast.
Answer: c
Explanation: The atlantic city algorithms which are bounded polynomial time algorithms are
probably correct and probably fast. It is correct more than 75% of the times.
Answer: a
Explanation: Prisonner’s dilemma is a standard example of a game analysed in game theory
where rational cooperative behaviour is judged on the basis of rewards and punishment.
advertisement
Answer: a
Explanation: Quicksort is the method of choice in many applications( Unix sort command) with
O(nlogn) in worst case.
Answer: a
Explanation: Complexity theories models randomized algorithms as probalistic turing machines.
A probalistic turing machine is a non deterministic turing machine which randomly chooses
between the available transitions at each point according to some probalistic distribution.
8. For the given algorithm, find the probability of finding after k iterations:
find_a(array A, n, k)
begin
i=0
repeat
Randomly select one element out of n elements
i=i+1
until i=k or a is found
end
a) (1/2)k
b) (1-(1/3))k
c) 1-(1/2)k
d) None of the mentioned
View Answer
Answer: c
Explanation: The given is known as Monte Carlo Algorithm. If a is fount, the algorithm
succeeds, else the algorith fails. The algorithm doesn not guarantee success but the run time is
bounded.
advertisement
9. Which of the following can be solved in computer science?
a) P=BPP problem
b) NP=co-NP problem
c) Do one way problems exist?
d) All of the mentioned
View Answer
Answer: d
Explanation: There exists a list of unsolved problems in computational theory which includes
many problems including the ones given.
Answer: d
Explanation: Freivalds algorithm is a probabalistic randomized algorithm we use to verify
matrix multiplication. On the other hand, Randomness can be useful in quicksort. If the
algorithm selects pivot element uniformaly at random, it has a probably high probabilty of
finishing the work in O(nlogn) time regardless of the input.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Complexity Classes,Class RP and ZPP”.
Answer: b
Explanation:
2n2=5000
n2+3n+7=2567
n3=125000
2n=1.13*1015
advertisement
Answer: One way to reduce the run time can be to increase the number of tapes. Sometimes,
using two tapes can be used to avoid back and forth motions altogether.
4. Which of the following are basic complexity classes for a function f:N->N?
a) Ntime(f)
b) Nspace(f)
c) Space(f)
d) All of the mentioned
View Answer
Answer: d
Explanation: Ntime(f): is a set of languages that can be accepted by a NTM T with non
deterministic time complexity function t <=f. In all four cases, the machines are allowed to be
multitape TM’s.
5. A function f is called __________ if there exists a TM T so that for any n and any input string
of length n, T halts in exactly f(n) moves.
a) Step function
b) Step counting function
c) Inplace functions
d) None of the mentioned
View Answer
Answer: b
Explanation: If f is a step counting function, T is a TM halting in f(n) moves where n is the
length of input string.
advertisement
6. Let f: N->N be a step counting function. Then for some constant C, Time(f) is a proper subset
of Time(_______)
a) O(nf)
b) O(n+f)
c) O(n2f2)
d) None of the mentioned
View Answer
Answer: c
Explanation: Using the encoding function, it is possible to show that if the function f is a step
counting function, then the function Cn2(f(n))2 is the total number of moves required.
7. Which among the following is false?
If f=O(h) and g=O(k) for f,g,h,k:N->N, then
a) f+g = O(h+k)
b) fg = O(hk)
c) fg=O(hk)
d) None of the mentioned
View Answer
Answer: c
Explanation: f,g,h,k are partial functions and each is defined at all but a finite number of points.
Answer: b
Explanation: ZPP is zero error probabalistic polynomial time complexity class which run in
polynomial time, returns an answer: yes, no or do not know.
Answer: a
Explanation: A probabalistic turing machine is a non deterministic turing machine which
randomly chooses between the available transitions at each point according to some probability
distribution.
advertisement
10. ZPP is exactly equal to the ____________of the classes RP and co-RP.
a) Union
b) Intersection
c) Concatenation
d) Difference
View Answer
Answer: b
Explanation: To prove the following statement, we need to take in note that every problem in RP
and co-RP has a Las-Vegas algorithm.
11. Suppose we have a las vegas algorithm C to prove ZPP is contained in RP and co-RP. Run C
for double its expected running time.
By Markov’s inequality, the chance that it will answer before we stop is:
a) 1/2
b) 1/4
c) 1/3
d) none of the mentioned
View Answer
Answer: a
Explanation: This means the chance we’ll give the wrong answer on a YES instance, by
stopping and yielding NO, is only 1/2, fitting the definition of an RP algorithm.
Answer: a
Explanation: ZPP is said to be closed under complement function i.e. ZPP=co-ZPP.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on
“Applications of NFA”.
Answer: d
Explanation: NFA is said to be closed under the following operations:
a) Union
b) Intersection
c) Concatenation
d) Kleene
e) Negation.
advertisement
2. It is less complex to prove the closure properties over regular languages using:
a) NFA
b) DFA
c) PDA
d) Can’t be said
View Answer
Answer: a
Explanation: None.
Answer: d
Explanation: There are many applications of finite automata, mainly in the field of Compiler
Design and Parsers and Search Engines.
4. John is asked to make an automaton which accepts a given string for all the occurrence of
‘1001’ in it. How many number of transitions would John use such that, the string processing
application works?
a) 9
b) 11
c) 12
d) 15
View Answer
Answer: a
Explanation: None.
advertisement
Answer: c
Explanation: Thompson Construction method is used to turn a regular expression in an NFA by
fragmenting the given regular expression through the operations performed on the input
alphabets.
6. Which among the following can be an example of application of finite state machine(FSM)?
a) Communication Link
b) Adder
c) Stack
d) None of the mentioned
View Answer
Answer: a
Explanation: Idle is the state when data in form of packets is send and returns if NAK is
received else waits for the NAK to be received.
Answer: a
Explanation: None.
9. Predict the number of transitions required to automate the following language using only 3
states:
L= {w | w ends with 00}
a) 3
b) 2
c) 4
d) Cannot be said
View Answer
Answer: a
Explanation: None.
10. The total number of states to build the given language using DFA:
L= {w | w has exactly 2 a’s and at least 2 b’s}
a) 10
b) 11
c) 12
d) 13
View Answer
Answer: a
Explanation: We need to make the number of a as fixed i.e. 2 and b can be 2 or more. Thus,
using this condition a finite automata can be created using 1 states.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“Gas Turbine-Steam Power Plant – I”.
Answer: b
Explanation: The difference between a Rankine cycle & a Brayton cycle is that the working
fluid in a Brayton cycle doesn’t undergo phase change while it does in Rankine cycle.
Answer: c
Explanation: Open & Closed Gas Turbine plants are the two types.
4. Power is produced when the working fluid does some work on the?
a) Shaft
b) Fins
c) Blades
d) None of the mentioned
View Answer
Answer: c
Explanation: For the production of power, the working fluid does some work on the blades of
the turbine, thereby producing Power.
advertisement
Answer: c
Explanation: Since for the production of power, the working fluid does some work on the blades
of the turbine, thereby producing Power. Hence, it is called an internal combustion plant.
6. Which among these is the main component of a gas turbine plant?
a) Condenser
b) Compressor
c) Boiler
d) Both Compressor & Boiler
View Answer
Answer: b
Explanation: The main component of a Gas turbine plant is Compressor.
Answer: c
Explanation: Multistage axial flow compressor is the compressor in practical usage in a gas
turbine plant.
advertisement
Answer: a
Explanation: A total of 65 % of power developed in the gas turbine is used for driving the
compressor.
9. The gas turbine power plant mainly uses which among the following fuels?
a) Coal and Peat
b) Kerosene oil and diesel oil and residual oil
c) Gas oil
d) Natural gas and liquid petroleum fuel
View Answer
Answer: d
Explanation: Natural gas and liquid petroleum fuel are among the two fuels used in a gas
turbine.
To practice all areas of Power Plant Engineering, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Interview Questions and Answers for freshers focuses on “Gas Turbine-
Steam Power Plant – II”.
1. The heating value of gaseous fuels is about _____________
a) 500 kJ/litre
b) 30 kJ/litre
c) 100 kJ/litre
d) 10 kJ/litre
View Answer
Answer: b
Explanation: 30 kJ/litre is the heating value of gaseous fuels.
advertisement
Answer: a
Explanation: Compressor has to be started before starting the gas turbine as the turbine work is
used by compressor.
Answer: d
Explanation: A Gas Turbine Plant has the following parts:
Compressor, Gas Turbine, Combustion chamber.
Answer: d
Explanation: A Gas Turbine has applications in nearly all fields, the major ones being in the
fields of Aviation, Oil & Gas industry, Marine propulsion.
6. The ratio of heat actually released by 1kg of fuel to heat that would be released by complete
perfect combustion is called ___________
a) Thermal efficiency
b) Combustion efficiency
c) Engine efficiency
d) Compression efficiency
View Answer
Answer: b
Explanation: Combustion efficiency is defined as,” The ratio of heat actually released by 1kg of
fuel to heat that would be released by complete perfect combustion”.
7. What is the percentage of total energy input appearing as network output of the cycle?
a) Thermal efficiency
b) Combustion efficiency
c) Engine efficiency
d) Compression efficiency
View Answer
Answer: a
Explanation: Thermal Efficiency is, “The percentage of total energy input appearing as network
output of the cycle”.
8. Which of the following method(s) can be used to improve the thermal efficiency of open
cycle gas turbine plant?
a) Inter-cooling
b) Reheating
c) Regeneration
d) All of the mentioned
View Answer
Answer: d
Explanation: The various methods to improve the efficiency of open cycles include intercooling
the feed water from the compressor to the turbine and then employing regeneration & reheat to
just use the power of the reheated water in order to maximize the power output.
Answer: c
Explanation: The only way to stop a running Gas turbine is by cutting off the fuel supply so that
the various processes in the cycle are stopped.
To practice all areas of Power Plant for Interviews, here is complete set of 1000+ Multiple
Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Questions and Answers for Experienced people focuses on “Gas
Turbine-Steam Power Plant – III”.
Answer: b
Explanation: The various methods to improve the efficiency of open cycles include intercooling
the feed water from the compressor to the turbine and then employing regeneration & reheat to
just use the power of the reheated water in order to maximize the power output. Here, this is
done by placing the intercooler before any of the above processes.
advertisement
Answer: d
Explanation: In order to make a thermodynamic process of larger efficiency, it is shifted towards
isothermal behavior. For this, the output from re-generator, which is at a higher temperature is
cooled to the temperature which is mid-way between the two temperature ranges. Then, it is
again heated to the final temperature thereby increasing the efficiency of the cycle.
Answer: d
Explanation: The ‘work ratio’ increases when the turbine inlet pressure increases, the
compressor inlet temperature decreases, the pressure ratio of the cycle decreases.
Answer: b
Explanation: The total pressure in a centrifugal compressor is a function of speed ratio. It varies
square of the speed ratio.
advertisement
Answer: a
Explanation: The efficiency of multistage compressor is lower than a single stage.
Answer: c
Explanation: Power output in a centrifugal compressor varies as the cube of the speed ratio.
7. In the ____________ heat transfer takes place between the exhaust gases and cool air.
a) Intercooler
b) Re-heater
c) Regenerator
d) Compressor
View Answer
Answer: c
Explanation: The process of heat transfer between the exhaust gases and cool air takes place in
Regenerator.
advertisement
8. In centrifugal compressor, the diffuser converts _________
a) Kinetic energy into pressure energy
b) Pressure energy into Kinetic energy
c) Kinetic energy into Mechanical energy
d) Mechanical energy into Kinetic energy
View Answer
Answer: a
Explanation: The diffuser of a centrifugal compressor converts Kinetic Energy into Pressure
energy.
To practice all areas of Power Plant for Experienced people, here is complete set of 1000+
Multiple Choice Questions and Answers.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“Fuel Oil”.
Answer: a
Explanation: A bulk of hydrocarbons in fuel oils belongs to paraffin series like methane, ethane.
advertisement
Answer: d
Explanation: Boiler fuel is one of the heavier fraction in the refining process of fuel oil.
3. Which of these properties specifies the minimum temperature at which fuel oil can be
ignited?
a) pour point
b) flash point
c) heating value
d) viscosity
View Answer
Answer: b
Explanation: The flash point is the minimum temperature at which fuel may be ignited.
Answer: c
Explanation: Because of its gaseous nature, natural gas is the cleanest of all fuel types as it does
contain ash and also produces no smoke on combustion.
advertisement
5. Which of these gases is the reason for the maintenance of natural gas at cryogenic
temperatures?
a) methane
b) ethane
c) propane
d) benzene
View Answer
Answer: a
Explanation: The major component of natural gas is methane, whose critical temperature is -83C
. So cryogenic temperatures are needed to maintain them it in liquid state at moderate pressure.
6. The gas which contributes maximum to heating value of natural gas is?
a) CO
b) CO2
c) H2
d) CH4
View Answer
Answer: d
Explanation: CH4 gas contributes maximum to the heating value of natural gas.
Answer: a
Explanation: Coal containing high percentage of durian is called splint.
advertisement
To practice all areas of Power Plant Engineering, here is complete set of 1000+ Multiple Choice
Questions and Answers.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“Coal-Oil & Coal-Water Mixtures – I”.
Answer: c
Explanation: Because peat contains 90% of moisture and hence is not suitable as utility fuel.
advertisement
2. Which of the following is not directly determined in the Proximate Analysis of coal?
a) Volatile Matter
b) Fixed Carbon
c) Moisture
d) Ash
View Answer
Answer: b
Explanation: Fixed carbon is the difference between 100% and sum of the percentages of
volatile matter, moisture and ash.
Answer: d
Explanation: This component is not determined in Ultimate Analysis.
4. If M and A represent the percentages of moisture and ash respectively, the dry and ash free
analysis in Ultimate Analysis is obtained on dividing other components by the fraction of?
a) {1-(M+A)}/100
b) {1-(M-A)}/100
c) {1-(A-M)}/100
d) 1-{(M+A)/100}
View Answer
Answer: d
Explanation: The fraction of ash and moisture is given by (M+A)/100. So the dry and ash free
part is 1-{(M+A)/100}.
advertisement
Answer: a
Explanation: Swelling index is the quantitative evaluation method devised to determine the
extent of calling in coal.
Answer: d
Explanation: Coke is the type of coal devoid of volatile matter.
7. Which of the following property is the inverse of the power required to grind coal to a
particular size for burning?
a) heating value
b) weatherabillity
c) grindability
d) sulphur content
View Answer
Answer: c
Explanation: This property of coal is measured by the standard Grindability Index.
advertisement
Answer: c
Explanation: The ash softening temperature is the temperature at which ash becomes plastic. If
the furnace temperature is higher, ash forms molten slag and causes trouble in discharge.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Interview Questions and Answers for Experienced people focuses on
“Coal-Oil & Coal-Water Mixtures – II”.
1. Presence of ______________ in dry gaseous fuel does not contribute its calorific value.
a) hydrogen
b) sulphur
c) oxygen
d) carbon
View Answer
Answer: c
Explanation: Oxygen does not contribute to the calorific value of dry gaseous fuels.
advertisement
2. Improper storage condition results weathering of coal and spontaneous combustion, which
increases its?
a) caking index
b) yield of carbonised products
c) calorific value
d) friability and oxygen content
View Answer
Answer: d
Explanation: Improper storage of coal causes loss of oxygen content, resulting in loss of heat
value.
Answer: c
Explanation: Kerosene on cracking gives laboratory gas.
4. Higher percentage of ash in coal meant for the production of metallurgical grade coke
__________
a) causes brittleness in coke
b) increases abrasion resistance of coke
c) decreases hardness of coke
d) causes high toughness
View Answer
Answer: b
Explanation: A high percentage of ash in coal meant for production of metallurgical grade coke
causes an increase in abrasion resistance in coke.
5. Carbon content by weight in air dried wood may be about _____________ %.
a) 25
b) 50
c) 10
d) 80
View Answer
Answer: b
Explanation: Air dried wood has carbon content of about 50%.
advertisement
Answer: a
Explanation: Clinkering tendency is responsible for the softening of coal.
Answer: a
Explanation: Pulverisation leads to less use of air.
8. Dry air required to burn 1kg of carbon completely may be around ________________ kg.
a) 11
b) 38
c) 2
d) 20
View Answer
Answer: a
Explanation: 11kg of dry air is required to burn 1kg of carbon.
Answer: a
Explanation: Coal having high volatile matter is called ‘fat coal’.
advertisement
Answer: d
Explanation: A good quality coal should have high carbon content.
Answer: b
Explanation: High grindability of coal implies easy pulverisation.
12. The difference in total carbon and fixed carbon of coal will be minimum in case of
__________
a) lignite
b) bituminous coal
c) high temperature coke
d) anthracite
View Answer
Answer: c
Explanation: Out of these options, high temperature coke has minimum difference.
13. Fuel gases containing hydrocarbons are not preheated before burning, because __________
a) they crack, thereby choking and fouling heat transfer surface
b) it reduces calorific value tremendously
c) it reduces flame temperature tremendously
d) there are chances of explosion during preheating
View Answer
Answer: a
Explanation: Hydrocarbons crack easily, hence they are not preheated.
advertisement
To practice all areas of Power Plant for Interviews, here is complete set of 1000+ Multiple
Choice Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Telegram | Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
Youtube | LinkedIn | Instagram | Facebook | Twitter | Pinterest
« Prev - Power Plant Questions and Answers – Coal-Oil & Coal-Water Mixtures – I
» Next - Power Plant Questions and Answers – Synthetic Fuels, Biomass and Thermodynamic
View
Categories Power Plant MCQsPost navigation
Power Plant Questions and Answers – Coal-Oil & Coal-Water Mixtures – I
Power Plant Questions and Answers – Synthetic Fuels, Biomass and Thermodynamic View
advertisement
advertisement
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“ASynthetic Fuels, Biomass and Thermodynamic View”.
Answer: a
Explanation: None.
advertisement
Answer: d
Explanation: In coal gasification, coal is gasified in a situ and the gas is conveyed to the surface.
The other processes are methods of coal liquefaction.
Answer: a
Explanation: The first products in Fischer-Tropsch process are carbon monoxide and hydrogen.
Answer: a
Explanation: High cost is the reason for no use of alcohols in petrol engines.
advertisement
Answer: d
Explanation: Pyrolytic oils, gas and char are the products of pyrolysis process.
Answer: a
Explanation: NPHR- net plant heat rate is the most important measure of performance for power
plant. AP-auxillary power NTO-net turbine output NTHR-net turbine heat rate.
advertisement
Answer: d
Explanation: The overall efficiency of a power plant is given by ɳ = 3600/NPHR.
To practice all areas of Power Plant Engineering, here is complete set of 1000+ Multiple Choice
Questions and Answers.
advertisement
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“Draught System”.
Answer: a
Explanation: The term ‘draught’ is used to define the static pressure in the furnace, in the
various ducts and the stack.
advertisement
2. The draught or pressure difference for a chimney of height of H metres is given by?
a) Δp = gH(ρa-ρg)
b) Δp = gH(ρg-ρa)
c) Δp = gHρg
d) Δp = gH(ρa+ρg)
View Answer
Answer: a
Explanation: The draught produced is given by Δp = gH(ρa-ρg).
Answer: d
Explanation: The three types of mechanical drafts are balanced, induced and forced drafts.
Answer: b
Explanation: Excess amount of air leads to significant losses in energy due to heat loss through
flue gases.
advertisement
Answer: d
Explanation: All these reasons lead to clinkering.
Answer: c
Explanation: A positive pressure exists in the furnace employing forced draught.
advertisement
8. Which of the following types of the fans has the highest cost?
a) centrifugal fans
b) axial fans
c) primary fans
d) gas recirculation fans
View Answer
Answer: b
Explanation: Axial fans have the highest cost.
Answer: d
Explanation: Except ‘electronically adjustable turbine drive’, all other are a type of drive in
variable speed control.
To practice all areas of Power Plant Engineering, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
This set of Power Plant Engineering Multiple Choice Questions & Answers (MCQs) focuses on
“Heat of Combustion-I”.
Answer: a
Explanation: Keeping flue gas temperature very high does not result in increased efficiency of
solid fuel.
Answer: c
Explanation: Bomb calorimeter can be used to determine the calorific value of both solid and
liquid fuels.
4. Which of these is not a reason for reduction in maximum flame temperature in actuality?
a) incomplete combustion
b) heat loss to exhaust gases
c) excess air requirements
d) heat loss to surroundings
View Answer
Answer: b
Explanation: Maximum flame temperature is defined on the temperature of products; hence it
cannot be a reason for reduction in flame temperature.
Answer: a
Explanation: Grindability of an object is the ease with which the object can be reduced into
powdered form. A measure of the same is the Grindability index of coal.
advertisement
6. Tar yield in the low temperature and high temperature carbonisation of dry coal may be
respectively __________ percent.
a) 10 & 3
b) 3 & 10
c) 15 & 8
d) 10 & 20
View Answer
Answer: a
Explanation: Tar yield in the low temperature and high temperature carbonisation of dry coal
may be respectively 10 & 3 percent.
Answer: d
Explanation: None of the effects are caused by the increased strength of sulphur & phosphorus
in coke.
8. The difference between the enthalpy of products & the enthalpy of reactants when complete
combustion occurs at specific temperature & pressure is called?
a) Enthalpy of burning
b) Enthalpy of Combustion
c) Enthalpy of complete combustion
d) None of the mentioned
View Answer
Answer: b
Explanation: Enthalpy of Combustion is defined as, “The difference between the enthalpy of
products & the enthalpy of reactants when complete combustion occurs at specific temperature
& pressure”.
9. The internal energy of products minus the internal energy of reactants for complete
combustion at specific temperature & pressure gives the internal energy of?
a) combustion
b) partial combustion
c) complete combustion
d) none of the mentioned
View Answer
Answer: a
Explanation: The internal energy of products minus the internal energy of reactants is called the
internal energy of combustion.
advertisement
10. HCV stands for?
a) Higher Combustion Value
b) Higher Convection Value
c) Higher Calorific Value
d) Higher Calorific Value
View Answer
Answer: d
Explanation: HCV is an acronym for High Calorific Value.
To practice all areas of Power Plant Engineering, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
1. The heat transferred when the H2O in the products is in the liquid state is called?
a) HCV
b) LCV
c) LHV
d) None of the mentioned
View Answer
Answer: a
Explanation: The heat transferred when the H2O in the products is in the liquid state is called
HCV [Higher Calorific Value].
advertisement
2. The heat transferred when the H2O in the products is in the vapour state is called?
a) HCV
b) LCV
c) HHV
d) None of the mentioned
View Answer
Answer: b
Explanation: The heat transferred when the H2O in the products is in the vapour state is called
LCV [Lower Calorific Value].
Answer: c
Explanation: Theoretical Flame Temperature is the maximum temperature achieved for given
reactants.
Answer: c
Explanation: Maximum Theoretical Flame Temperature corresponds to Complete Combustion.
advertisement
Answer: a
Explanation: In pure oxygen, the maximum flame temperature is higher than the theoretical
flame temperature because of dilution effect of Nitrogen.
Answer: a
Explanation: Maximum permissible temperature in a gas turbine is Fixed from metallurgical
considerations.
Answer: a
Explanation: Dissociation is directly proportional to temperature as when the temperature
increases, the amount of dissociation also increases & vice-versa.
advertisement
Answer: c
Explanation: Gibbs free energy is the parameter which determines the spontaneity of the
reaction after determining its randomness.
9. For exothermic reactions, free energy change is?
a) positive
b) negative
c) zero
d) none of the mentioned
View Answer
Answer: b
Explanation: Gibbs free energy is the parameter which determines the spontaneity of the
reaction after determining its randomness. For exothermic reactions, this energy difference has
to be negative.
To practice all areas of Power Plant for tests, here is complete set of 1000+ Multiple Choice
Questions and Answers.
Participate in the Sanfoundry Certification contest to get free Certificate of Merit. Join our social
networks below and stay updated with latest contests, videos, internships and jobs!
Recommended Posts:
10270_THEORY OF COMPUTATION
Time : 1hr
Max Marks : 50
N.B
1) All questions are Multiple Choice Questions having single correct option.
7) Use only black/blue ball point pen to darken the appropriate circle.
Q.no 1. Which of the following does not belong to the language if input alphabet set is
a,b
A:a
B:b
C : epsilon
D:c
Q.no 2. Which of the following regular expressions represents the set of strings which
do not contain a substring ‘rt’ if alphabet = {r, t}
A : (rt)*
B : (tr)*
C : (r*t*)
D : (t*r*)
Q.no 3. If there exists a language L, for which there exists a TM, T, that accepts every
word in L and either rejects or loops for every word that is not in L, is called
A : Recursive
B : Recursively Enumerable
C : NP-HARD
D : NP Complete
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
Q.no 5. Which of the production rule can be accepted by Chomsky grammar. (i) A->BC,
(ii) A->a
A : only i
B : only ii
C : both i and ii
D : neither i nor ii
A : Its memory
B : number of states
C : start state
D : input symbols
Q.no 8. Turing machine is more powerful than (a) Finite automata, (b) Push down
automata
A : Only (a)
B : Only (b)
A : Alan Turing
B : Turing man
C : Turing taring
D : Turling Bake
Q.no 10. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
Q.no 12. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
Q.no 15. If P, Q, R are three regular expressions and if P does not contain epsilon, then
the equation R = Q + RP has a unique solution given by
A : R = QP*
B : R = P*Q
C : R = RP
D : R = QP
Q.no 16. Which among the following are incorrect regular identities?
A:
B:
C:
D:
Q.no 17. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A : leftmost derivation
B : rightmost derivation
Q.no 20. A language L is said to be ____________ if there is a turing machine M such that
L(M)=L and M halts at every point.
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP-HARD
D : Turing Machine
Q.no 22. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Q.no 23. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))*
B : (a + ab)*
C : ( b* a b*ab*)* + b*
D : a* b (aa)*b a*
Q.no 24. Which of the following statement(s) are correct? (a) All languages can be
generated by CFG, (b) Any regular language has an equivalent CFG, (c) Some non
regular languages cannot be generated by CFG.
A : only (a)
B : Only (b)
C : Only (c)
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
D : current state
Q.no 28. Construct a regular expression for the language that contains strings having
no pair of consecutive zeros over {0, 1}.
A : (1+0)*
B:
C : ((0+1)(0+1))*
D : (01 + 10)*
Q.no 29. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
Q.no 31. Which among the following is the LEAF of the parse tree?
A : Production P
B : Nonterminal V
C : Terminal T
D : Starting symbol S
Q.no 32. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
A:7
B : 10
C : 12
D : 11
Q.no 37. According to the given language, which among the following expressions does
it corresponds to Language L={xϵ{0,1}|x is of length 4 or less}
A : (0+1+0+1+0+1+0+1)^4
B : (0+1)^4
C : (01)^4
D : (0+1+ε)^4
Q.no 38. Identify the following problem: If G=(V, E) and V' is subset of V, then V' is an
independent set iff no two nodes in V' are connected by an edge in E.
A : Satisfiability
B : Independent set
C : Node-Cover Problem
Q.no 39. Which of the following is analogous to the NFA and NPDA ?
D : Unrestricted language
A : 2,4
B : 1,3
C : 1, 2, 3, 4
D : 2, 3, 4
Q.no 41.
A : X is decidable
Q.no 42.
A:A
B:B
C:C
D:D
Q.no 44. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 47. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
A:
B:
C:
D:
Q.no 49. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 51. Find the pair of regular expressions that are equivalent
Q.no 52. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 54. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 55. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
A : Only II
B : Only III
C : Only I and II
Q.no 58. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 59.
B : X is decidable
A:3
B:5
C:7
D:2
Q.no 1. If the PDA does not stop on an accepting state and the stack is not empty, the
string is
A : rejected
D : accepted
B:4
C:2
D : cannot be represented.
Q.no 3. What is the Regular Expression Matching Zero or More Specific Characters
A:x
B:#
C:*
D:&
A:6
B:7
C:8
D:5
Q.no 5. Which one of the following languages over the alphabet {0, 1} is described by
the regular expression: (0+1)*0(0+1)*0(0+1)*
D : The set of all strings that begin and end with either 0 or 1
A : Input alphabet
B : Transition function
C : Initial State
D : Output alphabet
Q.no 7. Pushdown automata accepts
A : regular language
D : unrestricted language
A : x+1
B:x
C : x-1
D : x2
A : Captal Letters
B : Small Letters
C : Italic Letters
D : Roman Letters
A : Turing Machine
B : Finite Automata
Q.no 11. Turing Machine can update symbols on its tape, whereas the FA cannot update
symbols on tape.
A : true
B : false
C : Cannot say
D : May be
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
Q.no 13. Which of the following is false for a grammar G in Chomsky Normal Form:
A : LL(K)
B : LR(K)
C : SLR(K)
D : CLR(K)
A : type 0
B : type 1
C : type 2
D : type 3
Q.no 17. If T1 and T2 are two Turing machines, the composite can be represented using
the expression
A : T1 T2
B : T2 T1
C : T1 X T2
D : T2 X T1
A : Kleene plus +
B : Kleene star *
C : Question mark ?
D : Union
A:
B:
C:
D:
A : Terminal Symbol
C : Start symbol
D : End symbol
Q.no 21.
C : {w | w is a string of length 3}
D : {w | w is an empty string}
Q.no 22. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which any occurrence of the symbol b, is in
groups of odd numbers.
A : (abbb)*
B : a* b (bb)* a*
C : ((a+b)(a+b)(a+b))*
D : a* b* (bb)* a*
Q.no 23. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
C:
A : Type 3
B : Type 2
C : Type 1
D : Type 0
B : true
C : may be
D : cannot say
C : Palindrome string
Q.no 29. It is less complex to prove the closure properties over regular languages using
A : NFA
B : DFA
C : PDA
D : Canot be said
Q.no 30. Which of the following represents a language which has no pair of consecutive
1’s if alphabet = {0,1}?
A:
B:
C:
D:
A:3
B:7
C:5
D:6
Q.no 33. Which among the following is not true for 2-way infinte TM?
C : Any computation that can be performed by 2-way infinite tape can also be performed by
standard TM.
Q.no 35. CFGs are more powerful than (a) DFA, (b) NDFA, (c) Mealy Machine
A : Only (a)
A:1
B:2
C:3
D:4
Q.no 37. The complexity class P consist of all the decision problems that can be solved
by ___________using polynomial amount of computation time.
B : DFA
C : NDFA
Q.no 38. The automaton which allows transformation to a new state without consuming
any input symbols:
A : NFA
B : DFA
C : Epsilon NFA
D : PDA
Q.no 39. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings without double a?
A:
B : ((a+b)(a+b))*
C : (a + bb)*
D:
Q.no 40.
A:
B:
C:
D : {0, 1}
Q.no 41. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 42. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 43. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 44. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 46. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 47. The output of Moore machine can be defined as
A:
B:
C:
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
A:
B:
C:
D:
Q.no 50. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 52. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 53. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 56. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
A : any palindrome
Q.no 59. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
A : Kleene closure
B : Concatenation
C : Complement
D : Union
A : input symbol
B : stack symbol
C : output symbol
D : tape symbol
A : (01)*0 = 0(10)0*
B : (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
C : (0+1)*01(0+1)*+1*0* = (0+1)*0
D : (01)*01 = 0(10)0*1
Q.no 4. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A:4
B:5
C:6
D : unlimitted
Q.no 6.
A:R
B:
C : R*
D:
Q.no 7.
A:
B:
C:L
D : L*
D : LL1 Parsing
Q.no 9.
A:
B:
C:0
D:1
A:*,.,+
B:.,*,+
C:.,+,*
D:+,.,*
Q.no 11. Those problems that are solvable in polynomial time belong to __
A : NP
B:P
C : Hard
D : Complete
Q.no 13. Which among the following is the format of unit production?
A : A->B
B : A->b
C : B->Aa
D : B->aA
A : Push
B : Pop
D : Read
Q.no 15.
A : Always starts with b
A : Useful symbols
B : epsilon productions
C : Reachable symbols
A : decidable problem
B : undecidable problem
C : complete problem
D : trackable problem
Q.no 18. The language accepted by a Turing machine is called ………. language.
A : Regular
B : Recursively Enumerable
C : Context free
D : Context sensitive
Q.no 19. Which among the following are incorrect regular identities?
A:
B:
C:
D:
A : Finite
B : Infinite
C : May be finite
D : One
Q.no 21. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be
generated by
A : (r1)(r2)
B : (r1 + r2)
C : (r2)(r1)
D : (r1)
A : Empty variable
B : Nullable variable
C : Non-empty variable
D : Non-nullable variable
Q.no 24. Which of the following pairs have different expressive power
A : regular language
C : unrestricted
A : never
B : not always
C : always
D : maybe
A : true
B : false
C : maybe
D : cannot say
Q.no 29. The travelling salesman problem can be solved using _________
A : A spanning tree
D : DFS traversal
Q.no 30. The minimum number of 1’s to be used in a regular expression of the given
language of all strings containing exactly 2 zeroes.
A:2
B:3
C:0
D:1
A : Quadruple
B : Quintuple
C : Triple
Q.no 34. The difference between Turing Machine and Two Way FA is in:
A : Input Tape
C : Finite Control
D : All of these
Q.no 35. The worst case complexity of a deterministic problem to find the satisfiability
of a given formula of n variables is
A : O(n)
B : O(n^2)
C : O(n^3)
D : O(2^n)
Q.no 37. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
Q.no 38. The regular expression with all strings of 0′s and 1′s with at least two
consecutive 0′s is:
A : 1 + (10)*
B : (0+1)*00(0+1)*
C : (0+1)*011
D : 0*1*2*
Q.no 39. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
Q.no 40. Which of the following pairs have DIFFERENT expressive power?
B : Delete a symbol
C : Insert a symbol
Q.no 42. Find the pair of regular expressions that are equivalent
Q.no 43. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 46. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 47.
B : X is decidable
Q.no 48. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 49. The minimum number of productions required to produce a language
consisting of palindrome strings (even and odd length) over T={a,b} is
A:3
B:5
C:7
D:2
Q.no 50.
A : X is decidable
Q.no 51. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 52. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 54. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 55. Context free grammar having the following production
X->Xa
is termed as
Q.no 56. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 57. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 58. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 59. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 60. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
A : {x,y}
B : {xy}
C : {x}
D : {y}
C : Computability
D : All of these
A : yes
B : no
C : maybe
D : never
Q.no 5. The minimum number of states required to recognize an octal number divisible
by 3 is
A:1
B:3
C:5
D:7
Q.no 6. Identify the problem: Given a graph G = <V, E>, and a starting node a, does it
have a tour cost less than k?
A : Satisfiability
B : Independent set
C : Node-Cover Problem
Q.no 7. Turing Machine also behaves like General purpose computer and that TM is
known as _______
Q.no 8. Which of the following pair of regular expressions are not equivalent?
D : x+ and x*x+
Q.no 9. Turing Machine can update symbols on its tape, whereas the FA cannot update
symbols on tape.
A : true
B : false
C : Cannot say
D : May be
A : Epsilon-reachable states
B : initial state
C : Final state
D : Non-final states
A : leftmost derivation
B : rightmost derivation
A : Recursive
B : Non Recursive
C : Recognizable
D : Non Recognizable
Q.no 13. A two-way infinite tape Turing machine is ________ superior than the basic
model of the Turing machine in terms of power.
A : More
B : Less
C : No way
D : Very Much
Q.no 14. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
Q.no 15. In Moore machine, if input is of length n, then length of output string will be
A:n
B : n+1
C : n+n
D : n-1
A:0
B:1
C:2
D:3
Q.no 17. Which of the following a Turing machine does not consist of?
A : Input tape
B : Head
C : State register
D : Stack
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
Q.no 19. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
A : [(a+b)*(aa+bb)]*
B : [(0+1)-(0b+a1)*(a+]*
C : (01+11+10)*
D : (1+2+0)*(1+2)*
Q.no 24. The RE in which any number of 0′s is followed by any number of 1′s followed
by any number of 2′s is
A : (0+1+2)*
B : 0*1*2*
C : 0* + 1 + 2
D : (0+1)*2*
C : Both NP-complete
D : Both in P
A:0
B:1
C:2
D:3
Q.no 29.
A:
B:
C:
D:
Q.no 30. For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A : true
B : false
C : maybe
D : probably
Q.no 31. Which productions will generate odd length palindromes for terminals 'a' and
'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 32. Which of the following is the restricted model of Turing machines (a) Turing
machine with semi-infinite tape, (b) Multi stack machine, (c) Offline Turing machine
A : Only (a)
B : Only (b)
C : Only (c)
A : Regular
B : Context free
C : Context sensitive
D : Unrestricted
A : Mealy machine
B : Moore machine
C : Turing machine
Q.no 36. What does it mean when we say that an algorithm X is asymptotically more
efficient than Y?
Q.no 37. Construct a regular expression for the language that contains strings having
even number of 0’s followed by odd number of 1’s over {0, 1}.
A : (00)* 1 (11)*
B : ((0+1)(0+1))*
C : (0+1)*
D : (001)*
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 39. The subset construction shows that every NFA accepts a ……..
A : String
B : Function
C : Regular language
D : Context-free language
Q.no 41. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 42. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 43. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 44. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
A:
B:
C:
D:
Q.no 46. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 47. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 49. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 50. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 51.
A:A
B:B
C:C
D:D
Q.no 52. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
A:
B:
C:
A : Only II
B : Only III
C : Only I and II
Q.no 57. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 60. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A:1
B:2
C:3
D : Depends on problem
A : Type 0 grammar
B : Type 1 grammar
C : Type 2 grammar
D : Type 3 grammar
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
D : Sentential form
A : LL(1)
B : SLR
C : CLR
D : LALR
A : Finite Automaton
B : Turing Machine
C : Converting from Mealy into Moore machine and vice versa is not possible
D : More machine is Moore powerful than Mealy machine
A : yes
B : no
C : may be
D : cannot say
Q.no 9. Given the expression, is there some assignment of true and false values to the
variables that will make the entire expression true? This is termed as
A : Satisfiability problem
C : Node-Cover Problem
Q.no 10. Those problems that require large amount of computational resources that
are practically not feasible to solve, these problems are known as _________
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
Q.no 12.
A : L*
B:
C:L
D:
A : b*a*
B : (a*b*)*
C : a*b*
D:
Q.no 14. Those problems that are solvable in polynomial time belong to __
A : NP
B:P
C : Hard
D : Complete
A : LL(K)
B : LR(K)
C : SLR(K)
D : CLR(K)
A : any grammar
C : Turing machine rejects if the input does not belong to the language
Q.no 18. If T1 and T2 are two Turing machines, the composite can be represented using
the expression
A : T1 T2
B : T2 T1
C : T1 X T2
D : T2 X T1
A : R+
B : R-
C : R+ U R-
D:R
Q.no 20. In given Transition function of TM which head movement of tape is shown
(q0,a)->(q1,X,L)
A : Left Movement
B : Right Movement
C : Top Movement
D : Bottom Movement
Q.no 21.
A : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the right
movement.
B : Perform the transition from q0 to q1 by changing "X" symbol to "a" and perform the right
movement.
C : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the Left
movement.
D : Perform the transition from q0 to q1 by changing "q0" symbol to "q1" and perform the
right movement.
Q.no 22. Which of the following represents a language which has no pair of consecutive
1’s if alphabet = {0,1}?
A:
B:
C:
D:
Q.no 23. Which of the following does not obey pumping lemma for context free
languages ?
A : Finite languages
C : Unrestricted languages
D : Restricted languages
Q.no 24. The problem of finding a path in a graph that visits every vertex exactly once
is called
A : Hamiltonian path problem
Q.no 25. How many strings of length less than 4 contain the language described by the
regular expression (x+y)*y(a+ab)*
A:7
B : 10
C : 12
D : 11
Q.no 26. Is the language preserved in all the steps while eliminating epsilon transitions
from a NFA?
A : yes
B : no
C : may be
D : cannot say
Q.no 27. Turing machine (TM) is more powerful than FSM (Finite State Machine)
because
A : Yes
B : No
C : May be
D : Cannot be determined
Q.no 30. Production Rule: aAb->agb belongs to which of the following category?
A : Regular Language
Q.no 31. PDA works as Finite Automata when the number of auxiliary memory it has is
A:3
B:2
C:1
D:0
Q.no 32. The worst case complexity of a deterministic problem to find the satisfiability
of a given formula of n variables is
A : O(n)
B : O(n^2)
C : O(n^3)
D : O(2^n)
Q.no 34. Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is
undecidable. The statement that holds true is
B : P3 is decidable if P1 is reducible to P3
C : P3 is undecidable if P1 is reducible to P3
D : P3 is undecidable if P2 is reducible to P3
Q.no 35. The set of all strings over {a,b} in which strings consisting a’s and b’s and
ending with bb is
A : ab
B : a*bbb
C : (a+b)* bb
D : (a+b)+ bb
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
Q.no 37. The total number of states and transitions required to form a Moore machine
that processes a binary input string and will produce residue mod 3.
A : 3 and 6
B : 3 and 5
C : 2 and 4
D : 2 and 5
Q.no 38. The operations of PDA never work on elements other than top of the stack.
A : false
B : true
C : may be
D : cannot say
Q.no 39. For a DFA accepting binary numbers whose decimal equivalent is divisible by
4, what are all the possible remainders?
A:0
B:2
C : 0,2,4
D : 0,1,2,3
A:1
B:2
C:3
D:4
Q.no 41. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 42. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 43. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 45. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
A : Kleene closure
B : Concatenation
C : Complement
D : Union
Q.no 47. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 48. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
A : any palindrome
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 51. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 52. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 53. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 54.
A : X is decidable
A:
B:
C:
D:
Q.no 57.
B : X is decidable
Q.no 58. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 59. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 60. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 1. Which of the following can be used to simulate any Turing machine?
C : Counter machines
Q.no 2. If the PDA does not stop on an accepting state and the stack is not empty, the
string is
A : rejected
D : accepted
Q.no 3. A boolean formula is said to be in Conjuctive Normal Form (CNF) if it can
represented as
A : e1 V e2 V e3
B : e1 Ʌ e2 V e3
C : e1 V e2 Ʌ e3
D : e1 Ʌ e2 Ʌ e3
A:
B:
C:
D:
Q.no 5. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
A : moves
B : transition function
C : or symbol
D : not symbol
Q.no 6. Choose the correct option for the statement: Unambiguity is the ideal structure
of a language.
A : true
B : Partially True
C : false
D : Cannot be said
A:6
B:7
C:8
D:5
Q.no 8. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A : Alan Turing
B : Turing man
C : Turing taring
D : Turling Bake
D : LL1 Parsing
C : Nothing
D : Type of input
A:
B:
C:
D:
Q.no 14. Which of the following case does not exist in complexity theory?
A : Best case
B : Worst case
C : Average case
D : Null case
A : true
B : false
C : maybe
D : cannot say
Q.no 16. A grammar that produces more than one parse tree for some sentence is
called
A : ambiguous
B : unambiguous
C : regular
Q.no 18. There is a linear grammar that generates a context free grammar
A : Always
B : Never
C : Sometimes
D : Everytime
A : Terminals
B : Variables
C : Start Symbol
D : Productions
Q.no 21.
A:
B:
C:
D : {0, 1}
Q.no 22. Number of states required to accept strings ending with 10 are
A:3
B:2
C:1
D : can’t be represented.
Q.no 23. The complexity class P consist of all the decision problems that can be solved
by ___________using polynomial amount of computation time.
B : DFA
C : NDFA
A:0
B:1
C:2
D:3
Q.no 25. The shown language is recognized by (a) Turing machine, (b) Pushdown
A : Only (a)
B : Only (b)
C : Only (c)
A : true
B : false
C : maybe
D : cannot say
Q.no 27. Which of the functions are not performed by the Turing machine after reading
a symbol?
Q.no 28. The set of all strings over alphabet = {a,b} in which all strings having bbbb as
substring is
B : (a+b)* bb (a+b)*bb
C : bbb(a+b)*
D : bb (a+b)*
Q.no 29. Which of the following is not a Non deterministic Turing machine?
D : Unsolvable
Q.no 30. If there exists a TM which when applied to any problem in the class,
terminates, if correct answer is yes and may or may not terminate otherwise is called
A : Stable
B : Unsolvable
C : Partially solvable
D : Unstable
Q.no 31. A context free language is called ambiguous if (a) It has two or more leftmost
derivations for the same string. (b) It has two or more rightmost derivations for the
same string. (c) It has Only single derivation tree.
A : Only (a)
B : Only (b)
D : Only (c)
A : lexical analysis
B : syntax analysis
C : semantic analysis
D : code generation
Q.no 34. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings without double a?
A:
B : ((a+b)(a+b))*
C : (a + bb)*
D:
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
Q.no 36. The automaton which allows transformation to a new state without consuming
any input symbols:
A : NFA
B : DFA
C : Epsilon NFA
D : PDA
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
A : Boolean value
B : A state
C : A set of states
D : An edge
Q.no 40. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
Q.no 41. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
Q.no 42.
A:
B:
C:
D:
Q.no 44. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 46. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
A:3
B:5
C:7
D:2
Q.no 48. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 49. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 50. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 51. Find the pair of regular expressions that are equivalent
A:
B:
C:
Q.no 54. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 56. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 57.
A:A
B:B
C:C
D:D
Q.no 58. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 59. The following Turing machine acts like
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 60. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
Q.no 2. Turing machine is more powerful than (a) Finite automata, (b) Push down
automata
A : Only (a)
B : Only (b)
Q.no 3. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
D : L is a set of 0^n1^n
A : regular
B : context sensitive
C : context free
D : Unrestricted
A : NP class
B : P class
C : NP complete
D : NP hard
Q.no 8. If P, Q, R are three regular expressions and if P does not contain epsilon, then
the equation R = Q + RP has a unique solution given by
A : R = QP*
B : R = P*Q
C : R = RP
D : R = QP
Q.no 10. A grammar G=(V, T, P, S) is __________ if every production taken one of the two
forms: B->aC , B->a
A : Ambiguous
B : Regular
C : Non Regular
D : Context sensitive
A : Concatenation
B : Selection
C : Iteration
D : Addition
Q.no 12. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
Q.no 13.
A:
B:
C:0
D:1
A : Epsilon-reachable states
B : initial state
C : Final state
D : Non-final states
B : may be different
C : must be different
D : cannot say
Q.no 16. A problem is called __________ if it has an efficient algorithm for itself.
A : Tractable
B : Intractable
C : Computational
D : Computable
A : type 0
B : type 1
C : type 2
D : type 3
A : decidable problem
B : undecidable problem
C : complete problem
D : trackable problem
A : accepted by DFA
B : accepted by PDA
C : accepted by LBA
A : (0+1+0+1+0+1+0+1)^4
B : (0+1)^4
C : (01)^4
D : (0+1+ε)^4
Q.no 22. Recursively enumerable languages are …….. , whereas recursive languages are
…....
Q.no 23. How many strings of length less than 4 contain the language described by the
regular expression (x+y)*y(a+ab)*
A:7
B : 10
C : 12
D : 11
Q.no 24. Which of the following is the restricted model of Turing machines (a) Turing
machine with semi-infinite tape, (b) Multi stack machine, (c) Offline Turing machine
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 26. Which productions will generate even length palindromes for terminals 'a'
and 'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
C : Turing machines
Q.no 28. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
C:
Q.no 29. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
Q.no 30. Which of the following pairs have DIFFERENT expressive power?
C : Both NP-complete
D : Both in P
A:3
B:7
C:5
D:6
B : {xx,xy,yx,yy}
C : {x,y}
D : {x,y,xy}
C : Determining of a universal Turing machine can be written for fewer than k instructions
for some k
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
Q.no 37. Which among the following is equivalent to the given regular expression 01*+1
A : (01)*+1
B : 0((1)*+1)
C : (0(1)*)+1
D : ((0*1)1*)*
A : Compiler Design
B : Grammar Parsers
C : Text Search
D : Image processing
Q.no 39. Which of the regular expressions correspond to the given problem statement:
Express the identifiers in C Programming language where l=letters d=digits
A : (l+_)(d+_)*
B : (l+d+_)*
C : (l+_)(l+d+_)*
D : (_+d)(l+d+_)*
A : Instantaneous description
B : input symbols
C : start state
D : final state
Q.no 41. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
A : any palindrome
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
A : Only II
B : Only III
C : Only I and II
Q.no 46. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 48. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 49. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
A : Kleene closure
B : Concatenation
C : Complement
D : Union
Q.no 51. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 52. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 53. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 54. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 55. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 57.
B : X is decidable
Q.no 59. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
A:
B:
C:
D:
A:
B:
C:
D:
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
A : leftmost derivation
B : rightmost derivation
A:4
B:5
C:6
D : unlimitted
A:1
B:2
C:3
D : Depends on problem
A : Terminal Symbol
C : Start symbol
D : End symbol
A : Type 0 grammar
B : Type 1 grammar
C : Type 2 grammar
D : Type 3 grammar
A : R+
B : R-
C : R+ U R-
D:R
A : Push
B : Pop
D : Read
Q.no 12. Problems that can be solved in polynomial time are known as
A : intractable
B : tractable
C : decision
D : complete
Q.no 13. In given Transition function of TM which head movement of tape is shown
(q0,a)->(q1,X,L)
A : Left Movement
B : Right Movement
C : Top Movement
D : Bottom Movement
Q.no 14. For alphabet = {a,b}, the regular expression r = (aa)*(bb)*b denotes
A : Set of strings with 2 a’s and 2 b’s
D : Set of strings with even number of a’s followed by odd number of b’s
A : Kleene plus +
B : Kleene star *
C : Question mark ?
D : Union
Q.no 16. Which of the following are the examples of finite state machine system? (a)
Control Mechanism of an elevator (b) Traffic Lights (c) Combinational Locks
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 17. The Grammar can be defined as: G= (V, T, P, S) In the given definition, what
does S represents?
A : Accepting State
B : Starting Variable
C : Sensitive Grammar
D : Final state
C : Turing machine rejects if the input does not belong to the language
A : Satisfiability
B : Independent set
C : Node-Cover Problem
Q.no 20. Which of the following regular expressions represents the set of strings which
do not contain a substring ‘rt’ if alphabet = {r, t}
A : (rt)*
B : (tr)*
C : (r*t*)
D : (t*r*)
Q.no 21. The travelling salesman problem can be solved using _________
A : A spanning tree
D : DFS traversal
Q.no 22. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
Q.no 23.
A : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the right
movement.
B : Perform the transition from q0 to q1 by changing "X" symbol to "a" and perform the right
movement.
C : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the Left
movement.
D : Perform the transition from q0 to q1 by changing "q0" symbol to "q1" and perform the
right movement.
A:1
B:2
C:3
D:4
Q.no 25. If there exists a TM which when applied to any problem in the class,
terminates, if correct answer is yes and may or may not terminate otherwise is called
A : Stable
B : Unsolvable
C : Partially solvable
D : Unstable
Q.no 26. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
A : All Regular grammars are context free but not vice versa
B : All context free grammars are regular grammars but not vice versa
C : Regular grammar and context free grammar are the same entity
D : All context sensitive grammar are regular grammar but not vice versa
A : Regular language
B : Context-free language
C : Context-sensitive language
Q.no 29. Which among the following is the LEAF of the parse tree?
A : Production P
B : Nonterminal V
C : Terminal T
D : Starting symbol S
Q.no 30. Which among the following is not true for 2-way infinte TM?
C : Any computation that can be performed by 2-way infinite tape can also be performed by
standard TM.
Q.no 31. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
D : Chomsky Normal Form
A : Regular
B : Context free
C : Context sensitive
D : Unrestricted
Q.no 34. The complement of a language will only be defined when and only when the
__________ over the language is defined.
A : String
B : Word
C : Alphabet
D : Grammar
Q.no 35. Out of the three decision problems P1, P2 and P3, P1 is decidable and P2 is
undecidable. The statement that holds true is
B : P3 is decidable if P1 is reducible to P3
C : P3 is undecidable if P1 is reducible to P3
D : P3 is undecidable if P2 is reducible to P3
Q.no 37. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which any occurrence of the symbol b, is in
groups of odd numbers.
A : (abbb)*
B : a* b (bb)* a*
C : ((a+b)(a+b)(a+b))*
D : a* b* (bb)* a*
Q.no 38. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be
generated by
A : (r1)(r2)
B : (r1 + r2)
C : (r2)(r1)
D : (r1)
A : Mealy machine
B : Moore machine
C : Turing machine
Q.no 42. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 43. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 44. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
A:
B:
C:
D:
A:3
B:5
C:7
D:2
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 49. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 50. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 51.
A:A
B:B
C:C
D:D
Q.no 52. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 53. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 55. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 56.
A : X is decidable
Q.no 57. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 58. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 59. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
A:
B:
C:
A : (01)*0 = 0(10)0*
B : (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
C : (0+1)*01(0+1)*+1*0* = (0+1)*0
D : (01)*01 = 0(10)0*1
Q.no 2. If P, Q, R are three regular expressions and if P does not contain epsilon, then
the equation R = Q + RP has a unique solution given by
A : R = QP*
B : R = P*Q
C : R = RP
D : R = QP
Q.no 3.
A : L*
B:
C:L
D:
Q.no 4. Which of the following pair of regular expressions are not equivalent?
D : x+ and x*x+
Q.no 5. In Moore machine, if input is of length n, then length of output string will be
A:n
B : n+1
C : n+n
D : n-1
A : Terminals
B : Variables
C : Start Symbol
D : Productions
A : yes
B : no
C : may be
D : cannot say
Q.no 8. Finite automata needs minimum _______ number of stacks
A:0
B:1
C:2
D:3
Q.no 9. Those problems that require large amount of computational resources that are
practically not feasible to solve, these problems are known as _________
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
Q.no 10. Which among the following is the format of unit production?
A : A->B
B : A->b
C : B->Aa
D : B->aA
A : yes
B : no
C : maybe
D : never
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
Q.no 14. The decision problem is the function from string to ______________
A : char
B : int
C : boolean
D : float
Q.no 15.
Q.no 16. Turing Machine can update symbols on its tape, whereas the FA cannot update
symbols on tape.
A : true
B : false
C : Cannot say
D : May be
Q.no 17. Those problems that are solvable in polynomial time belong to __
A : NP
B:P
C : Hard
D : Complete
Q.no 18. Which of the following statement is true? (a) Turing machine was developed
by Alan Turing, (b) PDA is less powerful than Turing machine, (c) FA is more powerful
than TM
A : Only (a)
B : Only (b)
D : Only (c)
A:2
B:3
C:4
D:5
A : Captal Letters
B : Small Letters
C : Italic Letters
D : Roman Letters
Q.no 21. Which of the following does not obey pumping lemma for context free
languages ?
A : Finite languages
C : Unrestricted languages
D : Restricted languages
Q.no 22. Which of the regular expressions correspond to the given problem statement:
Express the identifiers in C Programming language where l=letters d=digits
A : (l+_)(d+_)*
B : (l+d+_)*
C : (l+_)(l+d+_)*
D : (_+d)(l+d+_)*
Q.no 23. Which of the following automata takes stack as auxiliary storage
A : finite automata
B : pushdown automata
C : Turing machine
A : Empty
B : abcabc
C : b*c|a
D : abc
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
A : subset
B : proper subset
C : not subset
Q.no 29. Construct a regular expression for the language that contains strings having
even number of 0’s followed by odd number of 1’s over {0, 1}.
A : (00)* 1 (11)*
B : ((0+1)(0+1))*
C : (0+1)*
D : (001)*
Q.no 31.
A:
B:
C:
D:
Q.no 32. Which of the following pairs have different expressive power
B : Deterministic Push Down Automata (DPDA) and Non-deterministic Push Down Automata
(NPDA)
Q.no 34. Turing machine (TM) is more powerful than FSM (Finite State Machine)
because
Q.no 35. Is the language preserved in all the steps while eliminating epsilon transitions
from a NFA?
A : yes
B : no
C : may be
D : cannot say
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
A : Yes
B : No
C : May be
D : Cannot be determined
Q.no 39. The shown language is recognized by (a) Turing machine, (b) Pushdown
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 40. What does it mean when we say that an algorithm X is asymptotically more
efficient than Y?
Q.no 41.
B : X is decidable
A : I and II
B : I and IV
C : II and III
D : II and IV
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 45. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 46. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
Q.no 47. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 48. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 49. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 50. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 53. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 55. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 56. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 57. Which of the following is NOT generated by regular expression
R = (ab + abb)* bbab
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 58. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
A : any palindrome
A : Only II
B : Only III
C : Only I and II
A : Push
B : Pop
D : Read
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
Q.no 3. Choose the correct option for the statement: Unambiguity is the ideal structure
of a language.
A : true
B : Partially True
C : false
D : Cannot be said
A : regular language
D : unrestricted language
B : More than one state can have two or more outgoing transitions
A : {x,y}
B : {xy}
C : {x}
D : {y}
Q.no 7. Given the expression, is there some assignment of true and false values to the
variables that will make the entire expression true? This is termed as
A : Satisfiability problem
C : Node-Cover Problem
Q.no 8. What is the Regular Expression Matching Zero or More Specific Characters
A:x
B:#
C:*
D:&
A:
B:
C:
D:
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
Q.no 11.
A:
B:
C:L
D : L*
A : Its memory
B : number of states
C : start state
D : input symbols
B : Turing Machine
C : Converting from Mealy into Moore machine and vice versa is not possible
Q.no 16. Which of the production rule can be accepted by Chomsky grammar. (i) A->BC,
(ii) A->a
A : only i
B : only ii
C : both i and ii
D : neither i nor ii
Q.no 17. A two-way infinite tape Turing machine is ________ superior than the basic
model of the Turing machine in terms of power.
A : More
B : Less
C : No way
D : Very Much
Q.no 18. The language accepted by a Turing machine is called ………. language.
A : Regular
B : Recursively Enumerable
C : Context free
D : Context sensitive
Q.no 19. Which of the following does not belong to the language if input alphabet set is
a,b
A:a
B:b
C : epsilon
D:c
A : All Regular grammars are context free but not vice versa
B : All context free grammars are regular grammars but not vice versa
C : Regular grammar and context free grammar are the same entity
D : All context sensitive grammar are regular grammar but not vice versa
D : Turing Machine
Q.no 23. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings without double a?
A:
B : ((a+b)(a+b))*
C : (a + bb)*
D:
Q.no 24.
C : {w | w is a string of length 3}
D : {w | w is an empty string}
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
A : Quadruple
B : Quintuple
C : Triple
Q.no 27.
A:
B:
C:
D : {0, 1}
Q.no 29. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
C:
Q.no 30. It is less complex to prove the closure properties over regular languages using
A : NFA
B : DFA
C : PDA
D : Canot be said
C : Palindrome string
B : stack alphabet
D : transition function
Q.no 33. The total number of states and transitions required to form a Moore machine
that processes a binary input string and will produce residue mod 3.
A : 3 and 6
B : 3 and 5
C : 2 and 4
D : 2 and 5
C : Determining of a universal Turing machine can be written for fewer than k instructions
for some k
D : current state
Q.no 37. Which of the following is not a Non deterministic Turing machine?
D : Unsolvable
Q.no 38. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which any occurrence of the symbol b, is in
groups of odd numbers.
A : (abbb)*
B : a* b (bb)* a*
C : ((a+b)(a+b)(a+b))*
D : a* b* (bb)* a*
A : lexical analysis
B : syntax analysis
C : semantic analysis
D : code generation
A : false
B : true
C : may be
D : cannot say
Q.no 41. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 42. Find the pair of regular expressions that are equivalent
Q.no 43. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
A:
B:
C:
D:
Q.no 45. What does the following transition graph shows
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 46. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 47. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 48.
Q.no 49. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 52. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 53. The minimum number of productions required to produce a language
consisting of palindrome strings (even and odd length) over T={a,b} is
A:3
B:5
C:7
D:2
Q.no 54. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 55.
A : X is decidable
Q.no 56. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 57. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 58. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 59. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
A : Kleene closure
B : Concatenation
C : Complement
D : Union
B : type 1
C : type 2
D : type 3
Q.no 3. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
Q.no 4. The major difference between Mealy and Moore machine is about:
A : Output Variations
B : Input Variations
C : Both
D : Transitions
Q.no 5. Which of the following are the examples of finite state machine system? (a)
Control Mechanism of an elevator (b) Traffic Lights (c) Combinational Locks
A : Only (a)
B : Only (b)
C : Only (c)
D : Sentential form
C : Nothing
D : Type of input
A : leftmost derivation
B : rightmost derivation
A : queue
B : linked list
C : hash table
D : stack
Q.no 11. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
C : Computability
D : All of these
Q.no 14. If T1 and T2 are two Turing machines, the composite can be represented using
the expression
A : T1 T2
B : T2 T1
C : T1 X T2
D : T2 X T1
Q.no 15. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A : Epsilon-reachable states
B : initial state
C : Final state
D : Non-final states
Q.no 17. Which one of the following is the most powerful method?
A : LL(1)
B : SLR
C : CLR
D : LALR
Q.no 18. There is a linear grammar that generates a context free grammar
A : Always
B : Never
C : Sometimes
D : Everytime
Q.no 19. The finite automata is called NFA when there exists____________ for a specific
input from current state to next state
A : Single path
B : Multiple paths
D : Three paths
Q.no 20. If there exists a language L, for which there exists a TM, T, that accepts every
word in L and either rejects or loops for every word that is not in L, is called
A : Recursive
B : Recursively Enumerable
C : NP-HARD
D : NP Complete
Q.no 21. The RE in which any number of 0′s is followed by any number of 1′s followed
by any number of 2′s is
A : (0+1+2)*
B : 0*1*2*
C : 0* + 1 + 2
D : (0+1)*2*
Q.no 23. Which of the following does not obey pumping lemma for context free
languages ?
A : Finite languages
C : Unrestricted languages
D : Restricted languages
Q.no 24. Is the language preserved in all the steps while eliminating epsilon transitions
from a NFA?
A : yes
B : no
C : may be
D : cannot say
Q.no 26. The difference between Turing Machine and Two Way FA is in:
A : Input Tape
C : Finite Control
D : All of these
Q.no 27. The regular expression with all strings of 0′s and 1′s with at least two
consecutive 0′s is:
A : 1 + (10)*
B : (0+1)*00(0+1)*
C : (0+1)*011
D : 0*1*2*
Q.no 28. Under which of the following operation, NFA is not closed?
A : Negation
B : Kleene
C : Concatenation
D : complement
A:3
B:7
C:5
D:6
Q.no 30. The operations of PDA never work on elements other than top of the stack.
A : false
B : true
C : may be
D : cannot say
Q.no 32. The minimum number of 1’s to be used in a regular expression of the given
language of all strings containing exactly 2 zeroes.
A:2
B:3
C:0
D:1
Q.no 33. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Q.no 34. For a DFA accepting binary numbers whose decimal equivalent is divisible by
4, what are all the possible remainders?
A:0
B:2
C : 0,2,4
D : 0,1,2,3
Q.no 35. Which among the following is equivalent to the given regular expression 01*+1
A : (01)*+1
B : 0((1)*+1)
C : (0(1)*)+1
D : ((0*1)1*)*
B : no trival method.
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
A : regular language
C : unrestricted
Q.no 39. The complexity class P consist of all the decision problems that can be solved
by ___________using polynomial amount of computation time.
B : DFA
C : NDFA
A : Type 3
B : Type 2
C : Type 1
D : Type 0
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 43. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 44. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 46. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
A : Only II
B : Only III
C : Only I and II
Q.no 49. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 51. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 52.
B : X is decidable
Q.no 53. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 54. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 55. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 56.
A:A
B:B
C:C
D:D
Q.no 57. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 58. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 59. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 60. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
A : Recursive
B : Non Recursive
C : Recognizable
D : Non Recognizable
A:*,.,+
B:.,*,+
C:.,+,*
D:+,.,*
C : Turing machine rejects if the input does not belong to the language
B : may be different
C : must be different
D : cannot say
C : Nothing
D : Type of input
A : Type 0 grammar
B : Type 1 grammar
C : Type 2 grammar
D : Type 3 grammar
A : input symbol
B : stack symbol
C : output symbol
D : tape symbol
Q.no 9. If the PDA does not stop on an accepting state and the stack is not empty, the
string is
A : rejected
B : goes into loop forever
D : accepted
Q.no 10. Which of the following regular expressions represents the set of strings which
do not contain a substring ‘rt’ if alphabet = {r, t}
A : (rt)*
B : (tr)*
C : (r*t*)
D : (t*r*)
Q.no 11. A grammar G=(V, T, P, S) is __________ if every production taken one of the two
forms: B->aC , B->a
A : Ambiguous
B : Regular
C : Non Regular
D : Context sensitive
A : b*a*
B : (a*b*)*
C : a*b*
D:
Q.no 13. Which one of the following languages over the alphabet {0, 1} is described by
the regular expression: (0+1)*0(0+1)*0(0+1)*
D : The set of all strings that begin and end with either 0 or 1
Q.no 14.
A:R
B:
C : R*
D:
A : yes
B : no
C : may be
D : cannot say
A : x+1
B:x
C : x-1
D : x2
Q.no 17. The Grammar can be defined as: G= (V, T, P, S) In the given definition, what
does S represents?
A : Accepting State
B : Starting Variable
C : Sensitive Grammar
D : Final state
Q.no 18. Which of the following is not a part of 5-tuple finite automata?
A : Input alphabet
B : Transition function
C : Initial State
D : Output alphabet
Q.no 19. In Moore machine, if input is of length n, then length of output string will be
A:n
B : n+1
C : n+n
D : n-1
Q.no 20. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
A : moves
B : transition function
C : or symbol
D : not symbol
A : 2,4
B : 1,3
C : 1, 2, 3, 4
D : 2, 3, 4
Q.no 24. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
Q.no 25. Which of the following represents a language which has no pair of consecutive
1’s if alphabet = {0,1}?
A:
B:
C:
D:
B : stack alphabet
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
A:0
B:1
C:2
D:3
A : never
B : not always
C : always
D : maybe
Q.no 30. Which productions will generate odd length palindromes for terminals 'a' and
'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 32. Which of the following automata takes stack as auxiliary storage
A : finite automata
B : pushdown automata
C : Turing machine
C : Both NP-complete
D : Both in P
A : [(a+b)*(aa+bb)]*
B : [(0+1)-(0b+a1)*(a+]*
C : (01+11+10)*
D : (1+2+0)*(1+2)*
Q.no 36. PDA works as Finite Automata when the number of auxiliary memory it has is
A:3
B:2
C:1
D:0
C : Determining of a universal Turing machine can be written for fewer than k instructions
for some k
Q.no 38. A context free language is called ambiguous if (a) It has two or more leftmost
derivations for the same string. (b) It has two or more rightmost derivations for the
same string. (c) It has Only single derivation tree.
A : Only (a)
B : Only (b)
D : Only (c)
A : {xy,xy}
B : {xx,xy,yx,yy}
C : {x,y}
D : {x,y,xy}
A : All Regular grammars are context free but not vice versa
B : All context free grammars are regular grammars but not vice versa
C : Regular grammar and context free grammar are the same entity
D : All context sensitive grammar are regular grammar but not vice versa
Q.no 41. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 42. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
A:
B:
C:
D:
A : Kleene closure
B : Concatenation
C : Complement
D : Union
Q.no 45. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 46.
A : X is decidable
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 49. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
A : any palindrome
A : Copies a string
B : Delete a symbol
C : Insert a symbol
A:3
B:5
C:7
D:2
Q.no 55. What does the following transition graph shows
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 56. Find the pair of regular expressions that are equivalent
Q.no 57. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 58. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 59. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
Q.no 60. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
A : R+
B : R-
C : R+ U R-
D:R
B : Variables
C : Start Symbol
D : Productions
A:
B:
C:
D:
A : NP class
B : P class
C : NP complete
D : NP hard
Q.no 5.
A:
B:
C:0
D:1
Q.no 7. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A : leftmost derivation
B : rightmost derivation
Q.no 11. If P, Q, R are three regular expressions and if P does not contain epsilon, then
the equation R = Q + RP has a unique solution given by
A : R = QP*
B : R = P*Q
C : R = RP
D : R = QP
Q.no 12. The major difference between Mealy and Moore machine is about:
A : Output Variations
B : Input Variations
C : Both
D : Transitions
Q.no 13. Which among the following are incorrect regular identities?
A:
B:
C:
D:
Q.no 14. Which of the following pair of regular expressions are not equivalent?
D : x+ and x*x+
Q.no 15. A boolean formula is said to be in Conjuctive Normal Form (CNF) if it can
represented as
A : e1 V e2 V e3
B : e1 Ʌ e2 V e3
C : e1 V e2 Ʌ e3
D : e1 Ʌ e2 Ʌ e3
Q.no 16. Which of the following is false for a grammar G in Chomsky Normal Form:
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
A : Turing Machine
B : Finite Automata
Q.no 19. Which of the following case does not exist in complexity theory?
A : Best case
B : Worst case
C : Average case
D : Null case
Q.no 20. Which of the production rule can be accepted by Chomsky grammar. (i) A->BC,
(ii) A->a
A : only i
B : only ii
C : both i and ii
D : neither i nor ii
Q.no 21. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Q.no 22.
A:
B:
C:
D:
Q.no 23. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))*
B : (a + ab)*
C : ( b* a b*ab*)* + b*
D : a* b (aa)*b a*
A : true
B : false
C : maybe
D : cannot say
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
Q.no 27. For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A : true
B : false
C : maybe
D : probably
Q.no 30. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be
generated by
A : (r1)(r2)
B : (r1 + r2)
C : (r2)(r1)
D : (r1)
Q.no 31. Which of the following statement(s) are correct? (a) All languages can be
generated by CFG, (b) Any regular language has an equivalent CFG, (c) Some non
regular languages cannot be generated by CFG.
A : only (a)
B : Only (b)
C : Only (c)
A : Mealy machine
B : Moore machine
C : Turing machine
Q.no 33. The problem of finding a path in a graph that visits every vertex exactly once
is called
Q.no 34. The subset construction shows that every NFA accepts a ……..
A : String
B : Function
C : Regular language
D : Context-free language
Q.no 35. Construct a regular expression for the language that contains strings having
no pair of consecutive zeros over {0, 1}.
A : (1+0)*
B:
C : ((0+1)(0+1))*
D : (01 + 10)*
Q.no 36. Production Rule: aAb->agb belongs to which of the following category?
A : Regular Language
Q.no 37. Which of the following pairs have DIFFERENT expressive power?
Q.no 38. Construct a regular expression for the language that contains strings that
start with either ‘01’ or ‘10’ over {0, 1}.
A : (01 + 10)*
D : (1+0)*
A:1
B:2
C:3
D:4
Q.no 40. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
Q.no 41.
B : X is decidable
Q.no 42. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 43.
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 45. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 47. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 48. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 49.
A:A
B:B
C:C
D:D
Q.no 50. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 51. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
A:
B:
C:
Q.no 53. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 54. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 55. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
A : Only II
B : Only III
C : Only I and II
Q.no 57. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
Q.no 58. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 59. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
B : More than one state can have two or more outgoing transitions
C : Nothing
D : Type of input
Q.no 3. Problems that can be solved in polynomial time are known as
A : intractable
B : tractable
C : decision
D : complete
Q.no 4. If T1 and T2 are two Turing machines, the composite can be represented using
the expression
A : T1 T2
B : T2 T1
C : T1 X T2
D : T2 X T1
Q.no 5. Which of the following can be used to simulate any Turing machine?
C : Counter machines
D : Set of strings with even number of a’s followed by odd number of b’s
Q.no 8. The transition a Push down automaton makes is additionally dependent upon
the:
A : Current State
B : input tape
C : stack
D : terminals
Q.no 9. If there exists a language L, for which there exists a TM, T, that accepts every
word in L and either rejects or loops for every word that is not in L, is called
A : Recursive
B : Recursively Enumerable
C : NP-HARD
D : NP Complete
A : Finite
B : Infinite
C : May be finite
D : One
Q.no 11. Given the expression, is there some assignment of true and false values to the
variables that will make the entire expression true? This is termed as
A : Satisfiability problem
C : Node-Cover Problem
A : Captal Letters
B : Small Letters
C : Italic Letters
D : Roman Letters
Q.no 13. Those problems that are solvable in polynomial time belong to __
A : NP
B:P
C : Hard
D : Complete
A:4
B:5
C:6
D : unlimitted
Q.no 15. Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1)
abaabaaabaa 2) aaaabaaaa
3) baaaaabaaaab 4) baaaaabaa
A : 1, 2 and 3
B : 2, 3 and 4
C : 1, 2 and 4
D : 1, 3 and 4
Q.no 16. Those problems that require large amount of computational resources that
are practically not feasible to solve, these problems are known as _________
A : Decidable
B : Undecidable
C : Tractable
D : Intractable
Q.no 17. Regular expression x + y denotes the set
A : {x,y}
B : {xy}
C : {x}
D : {y}
A:2
B:3
C:4
D:5
A : Terminal Symbol
C : Start symbol
D : End symbol
Q.no 21. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
Q.no 23. CFGs are more powerful than (a) DFA, (b) NDFA, (c) Mealy Machine
A : Only (a)
Q.no 24. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which any occurrence of the symbol b, is in
groups of odd numbers.
A : (abbb)*
B : a* b (bb)* a*
C : ((a+b)(a+b)(a+b))*
D : a* b* (bb)* a*
Q.no 25. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
Q.no 26. Which of the following pairs have different expressive power
A : Deterministic Finite Automata (DFA) and Non-deterministic Finite Automata (NFA)
B : Deterministic Push Down Automata (DPDA) and Non-deterministic Push Down Automata
(NPDA)
A : Instantaneous description
B : input symbols
C : start state
D : final state
Q.no 28. PDA works as Finite Automata when the number of auxiliary memory it has is
A:3
B:2
C:1
D:0
Q.no 29. The set of all strings over alphabet = {a,b} in which all strings having bbbb as
substring is
B : (a+b)* bb (a+b)*bb
C : bbb(a+b)*
D : bb (a+b)*
Q.no 30. Which of the following represents a language which has no pair of consecutive
1’s if alphabet = {0,1}?
A:
B:
C:
D:
A : Empty variable
B : Nullable variable
C : Non-empty variable
D : Non-nullable variable
A : Type 3
B : Type 2
C : Type 1
D : Type 0
C : Palindrome string
A : [(a+b)*(aa+bb)]*
B : [(0+1)-(0b+a1)*(a+]*
C : (01+11+10)*
D : (1+2+0)*(1+2)*
Q.no 35.
A:
B:
C:
D : {0, 1}
A : All Regular grammars are context free but not vice versa
B : All context free grammars are regular grammars but not vice versa
C : Regular grammar and context free grammar are the same entity
D : All context sensitive grammar are regular grammar but not vice versa
Q.no 37. Construct a regular expression for the language that contains strings having
even number of 0’s followed by odd number of 1’s over {0, 1}.
A : (00)* 1 (11)*
B : ((0+1)(0+1))*
C : (0+1)*
D : (001)*
Q.no 38. If there exists a TM which when applied to any problem in the class,
terminates, if correct answer is yes and may or may not terminate otherwise is called
A : Stable
B : Unsolvable
C : Partially solvable
D : Unstable
Q.no 39. Number of states required to accept strings ending with 10 are
A:3
B:2
C:1
D : can’t be represented.
A : any palindrome
A:3
B:5
C:7
D:2
Q.no 44. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 45. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 46. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 47. What does the following transition graph shows
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 48. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 52. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 53. The following Turing machine acts like
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 55.
A : X is decidable
B : X is undecidable but partially decidable
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 57. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 59. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 60. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
A : Alan Turing
B : Turing man
C : Turing taring
D : Turling Bake
A:6
B:7
C:8
D:5
Q.no 3. Which one of the following languages over the alphabet {0, 1} is described by
the regular expression: (0+1)*0(0+1)*0(0+1)*
A : The set of all strings containing the substring 00
D : The set of all strings that begin and end with either 0 or 1
Q.no 4. Turing machine is more powerful than (a) Finite automata, (b) Push down
automata
A : Only (a)
B : Only (b)
Q.no 5. Which of the following does not belong to the language if input alphabet set is
a,b
A:a
B:b
C : epsilon
D:c
A : Push
B : Pop
D : Read
A : Concatenation
B : Selection
C : Iteration
D : Addition
Q.no 8. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
Q.no 9. Identify the problem: Given a graph G = <V, E>, and a starting node a, does it
have a tour cost less than k?
A : Satisfiability
B : Independent set
C : Node-Cover Problem
A : Terminals
B : Variables
C : Start Symbol
D : Productions
A : accepted by DFA
B : accepted by PDA
C : accepted by LBA
A : Terminals
B : Variables
C : Start Symbol
D : Productions
A:0
B:1
C:2
D:3
Q.no 14. The Grammar can be defined as: G= (V, T, P, S) In the given definition, what
does S represents?
A : Accepting State
B : Starting Variable
C : Sensitive Grammar
D : Final state
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
Q.no 16.
A:
B:
C:L
D : L*
Q.no 17. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
B : may be different
C : must be different
D : cannot say
A : Recursive language
C : Regular language
Q.no 20. The major difference between a moore and mealy machine is that
Q.no 21. Which among the following is not true for 2-way infinte TM?
C : Any computation that can be performed by 2-way infinite tape can also be performed by
standard TM.
A : Quadruple
B : Quintuple
C : Triple
Q.no 23. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))*
B : (a + ab)*
C : ( b* a b*ab*)* + b*
D : a* b (aa)*b a*
Q.no 24. A context free language is called ambiguous if (a) It has two or more leftmost
derivations for the same string. (b) It has two or more rightmost derivations for the
same string. (c) It has Only single derivation tree.
A : Only (a)
B : Only (b)
D : Only (c)
Q.no 25. Which of the functions are not performed by the Turing machine after reading
a symbol?
Q.no 26. Which of the regular expressions correspond to the given problem statement:
Express the identifiers in C Programming language where l=letters d=digits
A : (l+_)(d+_)*
B : (l+d+_)*
C : (l+_)(l+d+_)*
D : (_+d)(l+d+_)*
Q.no 27. The difference between Turing Machine and Two Way FA is in:
A : Input Tape
C : Finite Control
D : All of these
A : regular language
C : unrestricted
Q.no 29.
A : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the right
movement.
B : Perform the transition from q0 to q1 by changing "X" symbol to "a" and perform the right
movement.
C : Perform the transition from q0 to q1 by changing "a" symbol to "X" and perform the Left
movement.
D : Perform the transition from q0 to q1 by changing "q0" symbol to "q1" and perform the
right movement.
Q.no 30.
A:
B:
C:
D:
A : Type 3
B : Type 2
C : Type 1
D : Type 0
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
Q.no 34. Which productions will generate even length palindromes for terminals 'a'
and 'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 35. The complexity class P consist of all the decision problems that can be solved
by ___________using polynomial amount of computation time.
B : DFA
C : NDFA
Q.no 36. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
C : Turing machines
A : Yes
B : No
C : May be
D : Cannot be determined
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
D : current state
Q.no 41. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 42. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 44. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 46. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 47. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 48. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 49. Find the pair of regular expressions that are equivalent
Q.no 50. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 53. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 54. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 55.
A:A
B:B
C:C
D:D
Q.no 56. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 57. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 58. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
A : Kleene closure
B : Concatenation
C : Complement
D : Union
A : queue
B : linked list
C : hash table
D : stack
Q.no 2. A grammar that produces more than one parse tree for some sentence is called
A : ambiguous
B : unambiguous
C : regular
D : LL1 Parsing
A : regular language
D : unrestricted language
Q.no 5. Number of states required to accept strings ending with 101
A:3
B:4
C:2
D : cannot be represented.
A : leftmost derivation
B : rightmost derivation
A : regular
B : context sensitive
C : context free
D : Unrestricted
D : Set of strings with even number of a’s followed by odd number of b’s
A : decidable problem
B : undecidable problem
C : complete problem
D : trackable problem
Q.no 10. NFA, in its name has Non-deterministic words because
A : yes
B : no
C : maybe
D : never
A : Useful symbols
B : epsilon productions
C : Reachable symbols
Q.no 13. A two-way infinite tape Turing machine is ________ superior than the basic
model of the Turing machine in terms of power.
A : More
B : Less
C : No way
D : Very Much
Q.no 14. Which of the following statement is true? (a) Turing machine was developed
by Alan Turing, (b) PDA is less powerful than Turing machine, (c) FA is more powerful
than TM
A : Only (a)
B : Only (b)
C : Both (a) and (b)
D : Only (c)
D : Sentential form
A : Its memory
B : number of states
C : start state
D : input symbols
A : Type 0 grammar
B : Type 1 grammar
C : Type 2 grammar
D : Type 3 grammar
A : b*a*
B : (a*b*)*
C : a*b*
D:
Q.no 19. Which among the following are incorrect regular identities?
A:
B:
C:
D:
Q.no 20. Choose the correct option for the statement: Unambiguity is the ideal
structure of a language.
A : true
B : Partially True
C : false
D : Cannot be said
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
A:3
B:7
C:5
D:6
Q.no 24. The operations of PDA never work on elements other than top of the stack.
A : false
B : true
C : may be
D : cannot say
Q.no 25. Number of states required to accept strings ending with 10 are
A:3
B:2
C:1
D : can’t be represented.
A : never
B : not always
C : always
D : maybe
Q.no 28. What does it mean when we say that an algorithm X is asymptotically more
efficient than Y?
A : Mealy machine
B : Moore machine
C : Turing machine
Q.no 30. The worst case complexity of a deterministic problem to find the satisfiability
of a given formula of n variables is
A : O(n)
B : O(n^2)
C : O(n^3)
D : O(2^n)
B : stack alphabet
D : transition function
Q.no 32. Which of the following statement(s) are correct? (a) All languages can be
generated by CFG, (b) Any regular language has an equivalent CFG, (c) Some non
regular languages cannot be generated by CFG.
A : only (a)
B : Only (b)
C : Only (c)
C : {w | w is a string of length 3}
D : {w | w is an empty string}
Q.no 34. The automaton which allows transformation to a new state without consuming
any input symbols:
A : NFA
B : DFA
C : Epsilon NFA
D : PDA
Q.no 36. Recursively enumerable languages are …….. , whereas recursive languages are
…....
A : 2,4
B : 1,3
C : 1, 2, 3, 4
D : 2, 3, 4
Q.no 41. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 42. What does the following transition graph shows
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
A : any palindrome
Q.no 45. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 46. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 48. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 50. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 51. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 52.
B : X is decidable
A : Copies a string
B : Delete a symbol
C : Insert a symbol
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 56.
A:
B:
C:
Q.no 58. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
A : Only II
B : Only III
C : Only I and II
Q.no 60. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
A : Recursive
B : Non Recursive
C : Recognizable
D : Non Recognizable
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
Q.no 3. The minimum number of states required to recognize an octal number divisible
by 3 is
A:1
B:3
C:5
D:7
Q.no 5. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
A : moves
B : transition function
C : or symbol
D : not symbol
A : P, NP
B : NP, NP hard
C : P, P complete
D : NP Hard,P
C : Nothing
D : Type of input
A:
B:
C:
D:
Q.no 10. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
Q.no 11.
A:R
B:
C : R*
D:
Q.no 12. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
Q.no 14. Which of the following pair of regular expressions are not equivalent?
D : x+ and x*x+
A:
B:
C:
D:
Q.no 16. In given Transition function of TM which head movement of tape is shown
(q0,a)->(q1,X,L)
A : Left Movement
B : Right Movement
C : Top Movement
D : Bottom Movement
A : type 0
B : type 1
C : type 2
D : type 3
A : (01)*0 = 0(10)0*
B : (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
C : (0+1)*01(0+1)*+1*0* = (0+1)*0
D : (01)*01 = 0(10)0*1
Q.no 19. Which of the following are the examples of finite state machine system? (a)
Control Mechanism of an elevator (b) Traffic Lights (c) Combinational Locks
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 20. What is the Regular Expression Matching Zero or More Specific Characters
A:x
B:#
C:*
D:&
D : current state
A : false
B : true
C : may be
D : cannot say
A : Regular language
B : Context-free language
C : Context-sensitive language
Q.no 24. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
Q.no 25. Which productions will generate even length palindromes for terminals 'a'
and 'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 27. The total number of states and transitions required to form a Moore machine
that processes a binary input string and will produce residue mod 3.
A : 3 and 6
B : 3 and 5
C : 2 and 4
D : 2 and 5
B : Grammar Parsers
C : Text Search
D : Image processing
Q.no 29. Identify the following problem: If G=(V, E) and V' is subset of V, then V' is an
independent set iff no two nodes in V' are connected by an edge in E.
A : Satisfiability
B : Independent set
C : Node-Cover Problem
A : Regular
B : Context free
C : Context sensitive
D : Unrestricted
Q.no 31. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
Q.no 32. For a DFA accepting binary numbers whose decimal equivalent is divisible by
4, what are all the possible remainders?
A:0
B:2
C : 0,2,4
D : 0,1,2,3
Q.no 33. Turing machine (TM) is more powerful than FSM (Finite State Machine)
because
A : regular language
C : unrestricted
A:0
B:1
C:2
D:3
Q.no 37. The shown language is recognized by (a) Turing machine, (b) Pushdown
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 38. Which of the following is not a Non deterministic Turing machine?
D : Unsolvable
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
A : Boolean value
B : A state
C : A set of states
D : An edge
Q.no 41. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 42. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 43.
A:A
B:B
C:C
D:D
Q.no 44. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 45.
A : X is decidable
Q.no 46. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
A:3
B:5
C:7
D:2
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 49. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 50. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
Q.no 51. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
Q.no 52. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 53. Find the pair of regular expressions that are equivalent
Q.no 54. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 55. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 57. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 58. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 60. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 1.
A:
B:
C:L
D : L*
Q.no 2. Finite automata needs minimum _______ number of stacks
A:0
B:1
C:2
D:3
Q.no 3. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP-HARD
Q.no 5. The finite automata is called NFA when there exists____________ for a specific
input from current state to next state
A : Single path
B : Multiple paths
D : Three paths
Q.no 6.
A:
B:
C:0
D:1
Q.no 7. Turing Machine also behaves like General purpose computer and that TM is
known as _______
A : A->B
B : A->b
C : B->Aa
D : B->aA
Q.no 9.
A : L*
B:
C:L
D:
Q.no 11. The decision problem is the function from string to ______________
A : char
B : int
C : boolean
D : float
A : leftmost derivation
B : rightmost derivation
Q.no 13.
A : Useful symbols
B : epsilon productions
C : Reachable symbols
Q.no 16. Given the language L = {ab, aa, baa}, which of the following strings are in L*? 1)
abaabaaabaa 2) aaaabaaaa
3) baaaaabaaaab 4) baaaaabaa
A : 1, 2 and 3
B : 2, 3 and 4
C : 1, 2 and 4
D : 1, 3 and 4
Q.no 17. Given the expression, is there some assignment of true and false values to the
variables that will make the entire expression true? This is termed as
A : Satisfiability problem
C : Node-Cover Problem
A : Alan Turing
B : Turing man
C : Turing taring
D : Turling Bake
C : Converting from Mealy into Moore machine and vice versa is not possible
C : LR parsing
D : SLR parsing
Q.no 21. Which of the following automata takes stack as auxiliary storage
A : finite automata
B : pushdown automata
C : Turing machine
Q.no 22. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings without double a?
A:
B : ((a+b)(a+b))*
C : (a + bb)*
D:
A : true
B : false
C : maybe
D : cannot say
Q.no 24. The automaton which allows transformation to a new state without consuming
any input symbols:
A : NFA
B : DFA
C : Epsilon NFA
D : PDA
Q.no 25. Which of the regular expressions correspond to the given problem statement:
Express the identifiers in C Programming language where l=letters d=digits
A : (l+_)(d+_)*
B : (l+d+_)*
C : (l+_)(l+d+_)*
D : (_+d)(l+d+_)*
Q.no 26. The complement of a language will only be defined when and only when the
__________ over the language is defined.
A : String
B : Word
C : Alphabet
D : Grammar
Q.no 27. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
A:3
B:2
C:1
D:0
Q.no 30. The regular expression with all strings of 0′s and 1′s with at least two
consecutive 0′s is:
A : 1 + (10)*
B : (0+1)*00(0+1)*
C : (0+1)*011
D : 0*1*2*
Q.no 31. For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A : true
B : false
C : maybe
D : probably
Q.no 33. The maximum number of transitions which can be performed over a state in a
DFA having alphabet set a,b,c are
A:1
B:2
C:3
D:4
Q.no 34. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Q.no 35. Under which of the following operation, NFA is not closed?
A : Negation
B : Kleene
C : Concatenation
D : complement
A : never
B : not always
C : always
D : maybe
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 38. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
A : Every language that is defined by regular expression can also be defined by finite
automata
B : Every language defined by finite automata can also be defined by regular expression
Q.no 40. Which of the following is analogous to the NFA and NPDA ?
D : Unrestricted language
Q.no 41. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 42. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 43. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
A:
B:
C:
Q.no 46. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
A : Copies a string
B : Delete a symbol
C : Insert a symbol
A : any palindrome
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 50. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 52. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 53. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 54. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
A:
B:
C:
D:
Q.no 56. What does the following transition graph shows
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 57. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 58.
B : X is decidable
C : X is not a decision problem
A : Kleene closure
B : Concatenation
C : Complement
D : Union
A : Finite Automaton
B : Turing Machine
D : Sentential form
A:4
B:5
C:6
D : unlimitted
A:6
B:7
C:8
D:5
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
A : R+
B : R-
C : R+ U R-
D:R
Q.no 10. Number of states required to accept strings ending with 101
A:3
B:4
C:2
D : cannot be represented.
Q.no 11. Minimal finite automata need _____________ no. of final states
A:1
B:2
C:3
D : Depends on problem
Q.no 12. Choose the correct option for the statement: Unambiguity is the ideal
structure of a language.
A : true
B : Partially True
C : false
D : Cannot be said
B : More than one state can have two or more outgoing transitions
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
A : Recursive language
C : Regular language
Q.no 16. Turing Machine can update symbols on its tape, whereas the FA cannot update
symbols on tape.
A : true
B : false
C : Cannot say
D : May be
A : b*a*
B : (a*b*)*
C : a*b*
D:
Q.no 18. Are the given two patterns equivalent?
(1) gray | grey (2) gr(a|e)y
A : yes
B : no
C : may be
D : cannot say
C : Nothing
D : Type of input
A : Concatenation
B : Selection
C : Iteration
D : Addition
Q.no 22. What does it mean when we say that an algorithm X is asymptotically more
efficient than Y?
C : Turing machines
Q.no 24. Which productions will generate odd length palindromes for terminals 'a' and
'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 25. How many strings of length less than 4 contain the language described by the
regular expression (x+y)*y(a+ab)*
A:7
B : 10
C : 12
D : 11
Q.no 26. Construct a regular expression for the language that contains strings that
start with either ‘01’ or ‘10’ over {0, 1}.
A : (01 + 10)*
D : (1+0)*
B : [(0+1)-(0b+a1)*(a+]*
C : (01+11+10)*
D : (1+2+0)*(1+2)*
B : stack alphabet
D : transition function
Q.no 29. Which of the following pairs have different expressive power
B : Deterministic Push Down Automata (DPDA) and Non-deterministic Push Down Automata
(NPDA)
A : lexical analysis
B : syntax analysis
C : semantic analysis
D : code generation
Q.no 31. The set of all strings over {a,b} in which strings consisting a’s and b’s and
ending with bb is
A : ab
B : a*bbb
C : (a+b)* bb
D : (a+b)+ bb
Q.no 32. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
A : subset
B : proper subset
C : not subset
Q.no 34. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
C : Determining of a universal Turing machine can be written for fewer than k instructions
for some k
Q.no 36.
C : {w | w is a string of length 3}
D : {w | w is an empty string}
A:1
B:2
C:3
D:4
Q.no 38. The minimum number of 1’s to be used in a regular expression of the given
language of all strings containing exactly 2 zeroes.
A:2
B:3
C:0
D:1
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 40. The RE in which any number of 0′s is followed by any number of 1′s followed
by any number of 2′s is
A : (0+1+2)*
B : 0*1*2*
C : 0* + 1 + 2
D : (0+1)*2*
Q.no 41. Which one of following is false.
Q.no 42. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
A:
B:
C:
D:
A:3
B:5
C:7
D:2
Q.no 45. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 47. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 48. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
Q.no 49. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 50. Find the pair of regular expressions that are equivalent
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 52.
A:A
B:B
C:C
D:D
B : Only III
C : Only I and II
Q.no 54. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 55. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 56. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 57. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 58. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 59.
Q.no 60. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 3. Which of the following regular expressions represents the set of strings which
do not contain a substring ‘rt’ if alphabet = {r, t}
A : (rt)*
B : (tr)*
C : (r*t*)
D : (t*r*)
A : Its memory
B : number of states
C : start state
D : input symbols
A : NP class
B : P class
C : NP complete
D : NP hard
A : Kleene plus +
B : Kleene star *
C : Question mark ?
D : Union
Q.no 9. The major difference between Mealy and Moore machine is about:
A : Output Variations
B : Input Variations
C : Both
D : Transitions
Q.no 10.
A:
B:
C:0
D:1
Q.no 11. In given Transition function of TM which head movement of tape is shown
(q0,a)->(q1,X,L)
A : Left Movement
B : Right Movement
C : Top Movement
D : Bottom Movement
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
A:R
B:
C : R*
D:
Q.no 15. For alphabet = {a,b}, the regular expression r = (aa)*(bb)*b denotes
D : Set of strings with even number of a’s followed by odd number of b’s
D : LL1 Parsing
A : Polynomial
B : Non polynomial
C : Logarithmic
D : Non Logarithmic
A : Captal Letters
B : Small Letters
C : Italic Letters
D : Roman Letters
Q.no 19. Which of the following a Turing machine does not consist of?
A : Input tape
B : Head
C : State register
D : Stack
Q.no 21.
A:
B:
C:
D:
Q.no 22. Which among the following is the LEAF of the parse tree?
A : Production P
B : Nonterminal V
C : Terminal T
D : Starting symbol S
Q.no 23. Identify the following problem: If G=(V, E) and V' is subset of V, then V' is an
independent set iff no two nodes in V' are connected by an edge in E.
A : Satisfiability
B : Independent set
C : Node-Cover Problem
Q.no 24. The ability for a system of instructions to simulate a Turing Machine is called
_________
A : Turing Completeness
B : Simulation
C : Turing Halting
D : Computability
D : current state
Q.no 26. The complement of a language will only be defined when and only when the
__________ over the language is defined.
A : String
B : Word
C : Alphabet
D : Grammar
Q.no 28. The difference between number of states in FA for regular expression (a + b)
and (a + b) * is:
A:1
B:2
C:3
D:0
Q.no 29. Which of the following does not obey pumping lemma for context free
languages ?
A : Finite languages
C : Unrestricted languages
D : Restricted languages
A:3
B:7
C:5
D:6
Q.no 32. Number of states required to accept strings ending with 10 are
A:3
B:2
C:1
D : can’t be represented.
Q.no 33. The difference between Turing Machine and Two Way FA is in:
A : Input Tape
C : Finite Control
D : All of these
A : Empty
B : abcabc
C : b*c|a
D : abc
A : {xy,xy}
B : {xx,xy,yx,yy}
C : {x,y}
D : {x,y,xy}
Q.no 36. A context free language is called ambiguous if (a) It has two or more leftmost
derivations for the same string. (b) It has two or more rightmost derivations for the
same string. (c) It has Only single derivation tree.
A : Only (a)
B : Only (b)
Q.no 37. If there exists a TM which when applied to any problem in the class,
terminates, if correct answer is yes and may or may not terminate otherwise is called
A : Stable
B : Unsolvable
C : Partially solvable
D : Unstable
Q.no 38. Which of the following is not a Non deterministic Turing machine?
D : Unsolvable
A : any palindrome
Q.no 44. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
B : Concatenation
C : Complement
D : Union
Q.no 47. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 49. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 50. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 51. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 52. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 53. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 54. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 56. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
A:
B:
C:
D:
Q.no 59. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 60. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 1.
A : L*
B:
C:L
D:
Q.no 2. In Moore machine, if input is of length n, then length of output string will be
A:n
B : n+1
C : n+n
D : n-1
A : NP
B:P
C : Hard
D : Complete
Q.no 4. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
A : Tractable
B : Intractable
C : Computational
D : Computable
Q.no 7. If T1 and T2 are two Turing machines, the composite can be represented using
the expression
A : T1 T2
B : T2 T1
C : T1 X T2
D : T2 X T1
Q.no 8. The transition a Push down automaton makes is additionally dependent upon
the:
A : Current State
B : input tape
C : stack
D : terminals
Q.no 9. Turing Machine also behaves like General purpose computer and that TM is
known as _______
Q.no 10. Which of the following can be used to simulate any Turing machine?
C : Counter machines
Q.no 11.
A:
B:
C:L
D : L*
Q.no 12. Which of the following are the actions that operates on stack top?
A : only push
B : only pop
A:2
B:3
C:4
D:5
A : LL(K)
B : LR(K)
C : SLR(K)
D : CLR(K)
A : Push
B : Pop
D : Read
C : Nothing
D : Type of input
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
A:*,.,+
B:.,*,+
C:.,+,*
D:+,.,*
A : Terminals
B : Variables
C : Start Symbol
D : Productions
C : Both NP-complete
D : Both in P
Q.no 24. Which of the following automata takes stack as auxiliary storage
A : finite automata
B : pushdown automata
C : Turing machine
Q.no 25. The total number of states and transitions required to form a Moore machine
that processes a binary input string and will produce residue mod 3.
A : 3 and 6
B : 3 and 5
C : 2 and 4
D : 2 and 5
Q.no 26. Which among the following is equivalent to the given regular expression 01*+1
A : (01)*+1
B : 0((1)*+1)
C : (0(1)*)+1
D : ((0*1)1*)*
Q.no 27. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be
generated by
A : (r1)(r2)
B : (r1 + r2)
C : (r2)(r1)
D : (r1)
Q.no 29. Recursively enumerable languages are …….. , whereas recursive languages are
…....
Q.no 30. Which of the following statement(s) are correct? (a) All languages can be
generated by CFG, (b) Any regular language has an equivalent CFG, (c) Some non
regular languages cannot be generated by CFG.
A : only (a)
B : Only (b)
C : Only (c)
C : Turing machines
Q.no 32. Construct a regular expression for the language that contains strings having
even number of 0’s followed by odd number of 1’s over {0, 1}.
A : (00)* 1 (11)*
B : ((0+1)(0+1))*
C : (0+1)*
D : (001)*
Q.no 34. Which of the following pairs have DIFFERENT expressive power?
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
A:1
B:2
C:3
D:4
Q.no 38. The travelling salesman problem can be solved using _________
A : A spanning tree
D : DFS traversal
B : stack alphabet
D : transition function
Q.no 40. A grammar G=(V,T,P,S) in which V represents
A : Set of Nonterminals
B : Start symbol
C : Set of terminals
D : Production
Q.no 41. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 42. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
Q.no 43. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 45. Find the pair of regular expressions that are equivalent
Q.no 46. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 47. The following Turing machine acts like
A : Copies a string
B : Delete a symbol
C : Insert a symbol
Q.no 48. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 50. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
Q.no 51. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 53. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
A:
B:
C:
D:
Q.no 55.
A:A
B:B
C:C
D:D
Q.no 56. The output of Moore machine can be defined as
A:
B:
C:
Q.no 57. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 58.
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 60. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
Q.no 1. Which of the following does not belong to the language if input alphabet set is
a,b
A:a
B:b
C : epsilon
D:c
B : Selection
C : Iteration
D : Addition
Q.no 3. Which of the following are the examples of finite state machine system? (a)
Control Mechanism of an elevator (b) Traffic Lights (c) Combinational Locks
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 4. Turing machine is more powerful than (a) Finite automata, (b) Push down
automata
A : Only (a)
B : Only (b)
Q.no 5. _________ is the class of decision problems that can be solved by non-
deterministic polynomial algorithms?
A : NP
B:P
C : Hard
D : Complete
Q.no 6. Identify the problem: Given a graph G = <V, E>, and a starting node a, does it
have a tour cost less than k?
A : Satisfiability
B : Independent set
C : Node-Cover Problem
D : Traveling Salesman Problem
A : Epsilon-reachable states
B : initial state
C : Final state
D : Non-final states
C : Computability
D : All of these
D : L is a set of 0^n1^n
Q.no 10. Choose the correct option for the statement: Unambiguity is the ideal
structure of a language.
A : true
B : Partially True
C : false
D : Cannot be said
A : Type 0 grammar
B : Type 1 grammar
C : Type 2 grammar
D : Type 3 grammar
A : any grammar
Q.no 13. Which of the production rule can be accepted by Chomsky grammar. (i) A->BC,
(ii) A->a
A : only i
B : only ii
C : both i and ii
D : neither i nor ii
Q.no 14. There is a linear grammar that generates a context free grammar
A : Always
B : Never
C : Sometimes
D : Everytime
A : yes
B : no
C : may be
D : cannot say
A : queue
B : linked list
C : hash table
D : stack
Q.no 17. Construct a regular expression for the language that contains strings having at
least one pair of consecutive zeros over {0, 1}.
A : (100)*
B : 1* (00)* 1*
C : [ (1 + 0 )* (00) (1 + 0 )*] +
D : ((0+1)(0+1))*
Q.no 18. If the PDA does not stop on an accepting state and the stack is not empty, the
string is
A : rejected
D : accepted
B : may be different
C : must be different
D : cannot say
A:
B:
C:
D:
Q.no 21. CFGs are more powerful than (a) DFA, (b) NDFA, (c) Mealy Machine
A : Only (a)
Q.no 22. The RE in which any number of 0′s is followed by any number of 1′s followed
by any number of 2′s is
A : (0+1+2)*
B : 0*1*2*
C : 0* + 1 + 2
D : (0+1)*2*
Q.no 23. The minimum number of 1’s to be used in a regular expression of the given
language of all strings containing exactly 2 zeroes.
A:2
B:3
C:0
D:1
C : Determining of a universal Turing machine can be written for fewer than k instructions
for some k
A : Compiler Design
B : Grammar Parsers
C : Text Search
D : Image processing
Q.no 26. Which of the following is the restricted model of Turing machines (a) Turing
machine with semi-infinite tape, (b) Multi stack machine, (c) Offline Turing machine
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 27. The problem of finding a path in a graph that visits every vertex exactly once
is called
Q.no 29. Let the class of language accepted by finite state machine be L1 and the class
of languages represented by regular expressions be L2 then
A : L1<L2
B : L1>=L2
C : L1!=L2
D : L1=L2
Q.no 30. Which of the following statements is false ?
Q.no 32. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))*
B : (a + ab)*
C : ( b* a b*ab*)* + b*
D : a* b (aa)*b a*
Q.no 33. For a DFA accepting binary numbers whose decimal equivalent is divisible by
4, what are all the possible remainders?
A:0
B:2
C : 0,2,4
D : 0,1,2,3
A : 2,4
B : 1,3
C : 1, 2, 3, 4
D : 2, 3, 4
A : Empty variable
B : Nullable variable
C : Non-empty variable
D : Non-nullable variable
Q.no 36. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
Q.no 37. Which of the following does not obey pumping lemma for context free
languages ?
A : Finite languages
C : Unrestricted languages
D : Restricted languages
Q.no 38. Is the language preserved in all the steps while eliminating epsilon transitions
from a NFA?
A : yes
B : no
C : may be
D : cannot say
Q.no 39. The minimum number of productions required to produce a language
consisting of palindrome strings over T={a,b} is
A:3
B:7
C:5
D:6
A : lexical analysis
B : syntax analysis
C : semantic analysis
D : code generation
Q.no 41.
B : X is decidable
A:3
B:5
C:7
D:2
Q.no 43. Which of the following is NOT generated by regular expression
R = (ab + abb)* bbab
A : ababbbbab
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 44. Which Transition table of Turing Machine is correct for the following problem
"Design a TM to find 2's complement of a binary number".
A:
B:
C:
D:
Q.no 45. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 46. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 47. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 49. The context free languages are closed under (a) union, (b) concatenation, (c)
Kleen closure
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 50. Which of the following will not be accepted by the following DFA?
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 51.
A : X is decidable
Q.no 52. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 53. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 54. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
A:
B:
C:
D:
A : any palindrome
Q.no 58. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 59. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
Q.no 60. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
A : yes
B : no
C : maybe
D : never
Q.no 2. A grammar that produces more than one parse tree for some sentence is called
A : ambiguous
B : unambiguous
C : regular
A : decidable problem
B : undecidable problem
C : complete problem
D : trackable problem
Q.no 5. If there exists a language L, for which there exists a TM, T, that accepts every
word in L and either rejects or loops for every word that is not in L, is called
A : Recursive
B : Recursively Enumerable
C : NP-HARD
D : NP Complete
Q.no 6.
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP-HARD
Q.no 8. Which of the following case does not exist in complexity theory?
A : Best case
B : Worst case
C : Average case
D : Null case
A : Terminals
B : Variables
C : Start Symbol
D : Productions
Q.no 11. Number of states required to accept strings ending with 101
A:3
B:4
C:2
D : cannot be represented.
A : Alan Turing
B : Turing man
C : Turing taring
D : Turling Bake
Q.no 13. Which one of the following languages over the alphabet {0, 1} is described by
the regular expression: (0+1)*0(0+1)*0(0+1)*
D : The set of all strings that begin and end with either 0 or 1
Q.no 14. Which of the following is false for a grammar G in Chomsky Normal Form:
Q.no 15. Which of the following is not a part of 5-tuple finite automata?
A : Input alphabet
B : Transition function
C : Initial State
D : Output alphabet
A : type 0
B : type 1
C : type 2
D : type 3
A : accepted by DFA
B : accepted by PDA
C : accepted by LBA
A : Kleene plus +
B : Kleene star *
C : Question mark ?
D : Union
A : decidable
B : Undecidable
C : sometimes decidable
D : infinite
Q.no 20. Which among the following are incorrect regular identities?
A:
B:
C:
D:
A : [(a+b)*(aa+bb)]*
B : [(0+1)-(0b+a1)*(a+]*
C : (01+11+10)*
D : (1+2+0)*(1+2)*
Q.no 24. Which among the following is not true for 2-way infinte TM?
Q.no 25. The maximum number of transitions which can be performed over a state in a
DFA having alphabet set a,b,c are
A:1
B:2
C:3
D:4
Q.no 27. It is less complex to prove the closure properties over regular languages using
A : NFA
B : DFA
C : PDA
D : Canot be said
Q.no 28. Production Rule: aAb->agb belongs to which of the following category?
A : Regular Language
Q.no 29. If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be
generated by
A : (r1)(r2)
B : (r1 + r2)
C : (r2)(r1)
D : (r1)
Q.no 30. For every CFL, G, there exists a PDA M such that L(G) = L(M) and vice versa.
A : true
B : false
C : maybe
D : probably
A:0
B:1
C:2
D:3
Q.no 32. The subset construction shows that every NFA accepts a ……..
A : String
B : Function
C : Regular language
D : Context-free language
Q.no 34.
A:
B:
C:
D:
Q.no 35. Which productions will generate even length palindromes for terminals 'a'
and 'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 36. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which any occurrence of the symbol b, is in
groups of odd numbers.
A : (abbb)*
B : a* b (bb)* a*
C : ((a+b)(a+b)(a+b))*
D : a* b* (bb)* a*
Q.no 37. The shown language is recognized by (a) Turing machine, (b) Pushdown
A : Only (a)
B : Only (b)
C : Only (c)
Q.no 38. Which of the regular expressions correspond to the given problem statement:
Express the identifiers in C Programming language where l=letters d=digits
A : (l+_)(d+_)*
B : (l+d+_)*
C : (l+_)(l+d+_)*
D : (_+d)(l+d+_)*
A : Instantaneous description
B : input symbols
C : start state
D : final state
C : Palindrome string
Q.no 41. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
A : Kleene closure
B : Concatenation
C : Complement
D : Union
Q.no 43. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 44.
A:A
B:B
C:C
D:D
Q.no 45. Examine the following DFA: If input is 011100101, which edge is NOT
traversed?
A:AB
B:BD
C:CD
D:DA
Q.no 46. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*
Q.no 47. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
Q.no 48. Consider the following statements.
I. The complement of every Turing decidable language is Turing decidable
II. There exists some language which is in NP but is not Turing decidable
III. If L is a language in NP, L is Turing decidable
Which of the above statements is/are true?
A : Only II
B : Only III
C : Only I and II
Q.no 49. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 50. Find the pair of regular expressions that are equivalent
A:
B:
C:
D:
A : Copies a symbol
B : Reverses a string
C : Accepts a palindrome
Q.no 54. If all the production rules have single nonterminal symbol on the left side
then grammar is called as
C : Unrestricted grammar
D : Phrase grammar
A:
B:
C:
A : There exist context-free languages such that all context free grammars generating them
are ambiguous.
B : An unambiguous context free grammar always has a unique parse tree for each string of
the language generated by it.
C : Both deterministic and non deterministic PDA always accet same set of languages.
Q.no 57. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 58. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
D : P3 is decidable if P3 is reducible to P2’s complement
A : Copies a string
B : Delete a symbol
C : Insert a symbol
A : NP
B:P
C : Hard
D : Complete
Q.no 2. What is the Regular Expression Matching Zero or More Specific Characters
A:x
B:#
C:*
D:&
Q.no 3. The minimum number of states required to recognize an octal number divisible
by 3 is
A:1
B:3
C:5
D:7
D : LL1 Parsing
A : Captal Letters
B : Small Letters
C : Italic Letters
D : Roman Letters
A : queue
B : linked list
C : hash table
D : stack
Q.no 7.
A:
B:
C:L
D : L*
Q.no 8. Which of the following pair of regular expressions are not equivalent?
D : x+ and x*x+
Q.no 9. Which of the following correctly recognize the symbol ‘|-‘ in context to PDA?
A : moves
B : transition function
C : or symbol
D : not symbol
Q.no 10. The major difference between a moore and mealy machine is that
A : Regular Language
B : Non-Regular Language
C : May be Regular
D : Cannot be said
Q.no 12. Which of the following does not belong to the language if input alphabet set is
a,b
A:a
B:b
C : epsilon
D:c
Q.no 13. To which of the following class does a CNF-satisfiability problem belong?
A : NP class
B : P class
C : NP complete
D : NP hard
D : Sentential form
A : (01)*0 = 0(10)0*
B : (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
C : (0+1)*01(0+1)*+1*0* = (0+1)*0
D : (01)*01 = 0(10)0*1
C : Turing machine rejects if the input does not belong to the language
A : R+
B : R-
C : R+ U R-
D:R
A : Turing Machine
B : Finite Automata
Q.no 19. Minimal finite automata need _____________ no. of final states
A:1
B:2
C:3
D : Depends on problem
A : Concatenation
B : Selection
C : Iteration
D : Addition
A : Regular
B : Context free
C : Context sensitive
D : Unrestricted
Q.no 22. The operations of PDA never work on elements other than top of the stack.
A : false
B : true
C : may be
D : cannot say
D : current state
B : stack alphabet
D : transition function
Q.no 25. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings without double a?
A:
B : ((a+b)(a+b))*
C : (a + bb)*
D:
A:1
B:2
C:3
D:4
A : All Regular grammars are context free but not vice versa
B : All context free grammars are regular grammars but not vice versa
C : Regular grammar and context free grammar are the same entity
D : All context sensitive grammar are regular grammar but not vice versa
C : Turing machines
Q.no 29. The complement of a language will only be defined when and only when the
__________ over the language is defined.
A : String
B : Word
C : Alphabet
D : Grammar
A : Boolean value
B : A state
C : A set of states
D : An edge
A : regular language
C : Both NP-complete
D : Both in P
Q.no 36. Which productions will generate odd length palindromes for terminals 'a' and
'b' ?
A : S-> aSa|bSb|a|b
B : S-> aSa|bSb|aa|bb
C : S-> aSa|bSb
D : S-> aSb|bSa|a|b
Q.no 38. Number of states required to accept strings ending with 10 are
A:3
B:2
C:1
D : can’t be represented.
A : Regular language
B : Context-free language
C : Context-sensitive language
Q.no 41. John is asked to make an automaton which accepts a given string for all the
occurrence of ‘1001’ in it. How many number of transitions would John use such that,
the string processing application works?
A : 10
B : 11
C : 12
D : 15
Q.no 42.
A:3
B:5
C:7
D:2
Q.no 45. Out of the three problems S, Q and R, S is an NP-complete problem and Q and R
are the two other problems not known to be in NP. Which one of the following
statements is true if Q is polynomial time reducible to S and S is the polynomial time
reducible to R?
A : Q is NP-complete
B : R is NP-complete
C : Q is NP-hard
D : R is NP-hard
Q.no 47. The regular expression for all strings of 0′s and 1′s with no two consecutive 0′s
is
A : (0+1)
B : (0+1)*
C:
D : (0+1)* 011
Q.no 48. The lexical analysis for a modern computer language such as Java needs the
power of which one of the following machine models in a necessary and sufficient
sense?
D : Turing machine
Q.no 49. Which grammar accepts the language of {a, b} having strings ending with 'a'.
A : S->aS | bS
B : S->aS | bS |b
C : S->aS | bS |S
D : S->aS | bS |a
Q.no 50. Construct a Turing machine which accepts a string with ‘aba’ as its substring.
A:
B:
C:
D:
Q.no 51. Which Transition table of Turing Machine is correct to check well formedness
of parentheses?
A:
B:
C:
D:
Q.no 52. The problems which have no algorithm, regardless of whether or not they are
accepted by a turing machine that fails to halt on some input are referred as:
A : Decidable
B : Undecidable
C : Computable
D : Recognizable
A : any palindrome
A : I and II
B : I and IV
C : II and III
D : II and IV
Q.no 55. From the options given below the statement, which is not necessarily true if
X1 is the recursive language and X2 and X3 are the languages that are recursively
enumerable but not recursive.
A:
B:
C : X2 – X1 is recursively enumerable
D : X1 – X3 is recursively enumerable
Q.no 56. The context free grammar
S->SS|0S1 |1S0|Є
generates :
Q.no 57. In conversion from the following CFG to CNF, the number of nonterminals to
be introduced for the terminals are:
S->Aba , A->aab , B->Ac
A:2
B:3
C:4
D:5
Q.no 58.
A : X is decidable
A : ababaabaa
B : abbbaa
C : abbbaabb
D : abbaabbaa
Q.no 60. Consider the following regular expressions. i) (a+b)* ii) (a*+b*)* iii) ((ϵ+a)b*)*
Which of the following statements is correct?
Q.no 1. Which of the following statement is true? (a) Turing machine was developed by
Alan Turing, (b) PDA is less powerful than Turing machine, (c) FA is more powerful
than TM
A : Only (a)
B : Only (b)
D : Only (c)
A : regular
B : context sensitive
C : context free
D : Unrestricted
A : {x,y}
B : {xy}
C : {x}
D : {y}
A:
B:
C:
D:
A : Useful symbols
B : epsilon productions
C : Reachable symbols
A:*,.,+
B:.,*,+
C:.,+,*
D:+,.,*
B:1
C:2
D:3
B : More than one state can have two or more outgoing transitions
A : Finite
B : Infinite
C : May be finite
D : One
Q.no 10. A boolean formula is said to be in Conjuctive Normal Form (CNF) if it can
represented as
A : e1 V e2 V e3
B : e1 Ʌ e2 V e3
C : e1 V e2 Ʌ e3
D : e1 Ʌ e2 Ʌ e3
Q.no 11. If P, Q, R are three regular expressions and if P does not contain epsilon, then
the equation R = Q + RP has a unique solution given by
A : R = QP*
B : R = P*Q
C : R = RP
D : R = QP
Q.no 12. What is the pumping length of string of length x?
A : x+1
B:x
C : x-1
D : x2
Q.no 13. The language accepted by a Turing machine is called ………. language.
A : Regular
B : Recursively Enumerable
C : Context free
D : Context sensitive
Q.no 14. A language L is said to be ____________ if there is a turing machine M such that
L(M)=L and M halts at every point.
A : Turing acceptable
B : Decidable
C : Undecidable
D : NP-HARD
Q.no 15. The push down automata indicate the acceptance of input string in terms of
A : final state
B : empty stack
D : start state
Q.no 18. The transition a Push down automaton makes is additionally dependent upon
the:
A : Current State
B : input tape
C : stack
D : terminals
A : b*a*
B : (a*b*)*
C : a*b*
D:
Q.no 20. Which of the following a Turing machine does not consist of?
A : Input tape
B : Head
C : State register
D : Stack
A : Yes
B : No
C : May be
D : Cannot be determined
Q.no 22. The travelling salesman problem can be solved using _________
A : A spanning tree
D : DFS traversal
Q.no 23. Which of the following pairs have DIFFERENT expressive power?
A : Binary tree
B : Sparse tree
C : Parse tree
D : Forest
A : (x+y)
B : (x+y)*
C : (x* + y)
D : (xy)*
Q.no 27. Pushdown automata behaves like Turing machine when it has the number of
auxiliary memory
A : one or more
B : two or more
C : zero
D : one
Q.no 28. The production of the form A->B , where A and B are non terminals is called
A : Null production
C : Unit production
Q.no 30. The total number of states and transitions required to form a Moore machine
that processes a binary input string and will produce residue mod 3.
A : 3 and 6
B : 3 and 5
C : 2 and 4
D : 2 and 5
B : Grammar Parsers
C : Text Search
D : Image processing
Q.no 32. Is the language preserved in all the steps while eliminating epsilon transitions
from a NFA?
A : yes
B : no
C : may be
D : cannot say
Q.no 33. The worst-case efficiency of solving a problem in polynomial time is?
A : O(p(n))
C:
Q.no 34. CFGs are more powerful than (a) DFA, (b) NDFA, (c) Mealy Machine
A : Only (a)
A : Quadruple
B : Quintuple
C : Triple
D : None of the mentioned
Q.no 36. Which of the regular expressions corresponds to the given problem statement
over the alphabet = {a, b}, All strings in which the total number of a’s is divisible by 2.
A : ((a+b)(a+b))*
B : (a + ab)*
C : ( b* a b*ab*)* + b*
D : a* b (aa)*b a*
Q.no 37. Which of the following is analogous to the NFA and NPDA ?
D : Unrestricted language
D : Turing Machine
Q.no 40. A context free language is called ambiguous if (a) It has two or more leftmost
derivations for the same string. (b) It has two or more rightmost derivations for the
same string. (c) It has Only single derivation tree.
A : Only (a)
B : Only (b)
D : Only (c)
Q.no 41. Choose the correct option for the given statement: The DFA shown represents
all strings which have 1 at the second last position.
A : Correct
C : Wrong proposition
D : May be correct
Q.no 42. Let S be an NP-complete problem and Q and R be two other problems not
known to be in NP. Q is polynomial time reducible to S and S is polynomial-time
reducible to R. Which one of the given statements is true?
A : R is NP-complete
B : R is NP-hard
C : Q is NP-complete
D : Q is NP-hard
A:
B:
C:
D:
B : abbbab
C : ababbabbbab
D : ababbbbbab
Q.no 45. The language A-> tB|t generated by which of the following grammar?
A : Type 3
B : Type 2
C : Type 1
D : Type 0
Q.no 47.
A:A
B:B
C:C
D:D
A:
B:
C:
D:
A : (a + b ) * ab
B : ab (a + b ) *
C:a(a+b)*b
D : b (a + b ) * a
Q.no 51. Construct the regular expressions for the following DFAs:
A : (0 + 11*0)*
B : 0*+010*
C : (0+010)*
D : (0+1)*
Q.no 52. Any string of terminals that can be generated by the following CFG
S-> XY ,
X-> aX | bX | a ,
Y-> Ya | Yb | a
Q.no 53. Which Transition Diagram is correct for the following problem
"Design a TM that erases all non blank symbols on the tape, where the sequence of non-
blank symbols does not contain any blank symbols B in between. Consider Alphabet
{a,b}.
A:
B:
C:
D:
A:
B:
C:
Q.no 55. The CFG "S-> aS | bS |a|b " is equivalent to regular expression
A : (a + b)
B : (a + b) (a + b)*
C : (a + b) (a + b)
D : (a . b) (a . b)
Q.no 56. Consider three decision problems P1, P2 and P3. It is known that P1 is
decidable and P2 is undecidable. Which one of the following is True?
A : P3 is decidable if P1 is reducible to P3
B : P3 is undecidable if P3 is reducible to P2
C : P3 is undecidable if P2 is reducible to P3
Q.no 57. Which of the following grammars are in Chomsky Normal Form:
A : S->AB | BC | CD,
A->0,
B->1,
C->2,
D->3
B : S->AB,
S->BCA | 0 | 1 | 2 | 3
C : S->Ab0,
A->001,
B->A2
D : SA->Aba,
A->aab,
B->Ac
Q.no 58. The regular expression denotes a language comprising all possible strings of
even length over the alphabet (0, 1)
A : 1 + 0(1+0)*
B : (0+1) (1+0)*
C : (1+0)
D : (00+0111+10)*
Q.no 59. Find the pair of regular expressions that are equivalent
Q.no 60. The set of all strings over alphabet ={a,b} in which a single a followed by any
number of b’s or a single b followed by any number of a’s is
A : ab* + ba*
B : ab*ba*
C : a*b + b*a
D : (a+b)(a+b)*