lOMoARcPSD|44639330

FAFL MCQs - MCQs

Theory of computation (Visvesvaraya Technological University)

Scan to open on Studocu

Studocu is not sponsored or endorsed by any college or university

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)
 lOMoARcPSD|44639330

UNIT-I
1. There are ________ tuples in finite state machine.
a) 4 b) 5 c) 6 d) unlimited
Answer: B
2. Transition function maps.
a) Σ * Q -> Σ b) Q * Q -> Σ c) Σ * Σ -> Q d) Q * Σ -> Q
Answer: D
3. Number of states require to accept string ends with 10.
a) 3 b) 2 c) 1 d) can’t be represented.
Answer: A
4. Extended transition function is .
a) Q * Σ* -> Q b) Q * Σ -> Q c) Q* * Σ* -> Σ d) Q * Σ ->
Σ
Answer: A
5. δ*(q,ya) is equivalent to .
a) δ((q,y),a) b) δ(δ*(q,y),a) c) δ(q,ya) d) independent from δ
notation
Answer: B
6. String X is accepted by finite automata if .
a) δ*(q,x) E A b) δ(q,x) E A c) δ*(Q0,x) E A d) δ(Q0,x) E
A
Answer: C
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
Answer: A
8. Language of finite automata is.
a) Type 0 b) Type 1 c) Type 2 d) Type 3
Answer: D

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

9. Finite automata requires minimum _______ number of stacks.

a) 1 b) 0 c) 2 d) None of the mentioned
Answer: B
10. Number of final state require to accept Φ in minimal finite automata.
a) 1 b) 2 c) 3 d) None of the mentioned
Answer: D

11.Regular expression for all strings starts with ab and ends with bba
is_____________.
a) ab(b+a)*aba b) ab(a+b)*bab c) ab(a+b)*bba d) None of
the mentioned
Answer: C
12. How many DFA’s exits with two states over input alphabet {0,1} ?
a) 64 b) 24 c) 32 d) None of the mentioned
Answer: A
13. The basic limitation of finite automata is that it can’t remember
arbitrary large amount of information.
a) Flase b) True c)cnt say d) None of the
mentioned
Answer: B
14. Number of states require to simulate a computer with memory
capable of storing ’3′ words each of length ’8′.
a) 2^(3*8) b) 3^(2*8) c) 2^(8*3) d) None of
the mentioned
Answer:A
15. FSM with output capability can be used to add two given integer in
binary representation.
a) Flase b) True c)cnt say d) None of the
mentioned
Answer: B
16. In Mealy machine o/p depends on_______________

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a) current input symbol and present state b) Present input symbol and
current state
c) current input symbol and current state d) Present input symbol and
present state
Answer: D
17. In Moore machine the next state is decided by_______________
a) current input symbol and present state b) Present input symbol and
current state
c) current input symbol and current state d) Present input symbol and
present state
Answer: C
18. In Moore machine the output function associated with ______
a) Λ (Lamda) b) Q c)q0 d) F
Answer: A
19. Melay and Moore machines are collection of _______ tuples.
a) 1 b) 6 c) 3 d) None of the mentioned
Answer: B
20. NDFA Stands for____________________________
a) Non Determining Finite Automata b) None Deterministic Finite
Automata
c) Non Deterministic First Automata d) Non Deterministic Finite
Automata
Answer: D

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

UNIT-2

1. In case of regular sets the question is „ L1 subset or equal to L2? ‟ is

Answer:b

a. Decidable
b. Cant say
c. Un decidable
d. trivially decidable

2. Let r and s are regular expressions denoting the languages R and S. Then
(rs)denote

answer:d

a. R*
b. RS
c. R+
d. RUS

3. Let r , s , t are regular expressions . Φ * =

answer:c

a. Φ
b. {Φ}
c. {ε}
d. ε

4. ‟The regular sets are closed under union‟ is

answer:a

e.

a. True
b. True or False
c. False
d. can„t say

5. L= {an bn an | n = 1 , 2 , 3, - - - - } is an example of a language that is

answer:b

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a. not context free and complement is also not CF

b. not context free
c. context free and whose complement is not CF
d. context free

6. Let r, s, t are regular expressions. (ε+ r)* =

answer:a

a. r*
b. εr
c. ε
d. r

7. 1 + 01 =

answer:b

a. ε+0
b. (ε+0)1
c. 1 01
d. 1(ε+0)

8. „The regular sets are closed under kleene closure‟ is

answer:a

a. can‟ t say
b. True
c. True or False
d. False

9. Let L1 be 0*10 * and L2 be 10*1 The quotient of L1 and L2 is

answer:d

a. empty
b. 1
c. 10*
d. 0*

10. Pick the correct statement The logic of pumping lemma is a good example
of

answer:d

a. iteration
b. divide and conquer

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

c. the pigeon hole principle

d. recursion

11. ---- Denotes all strings of 0,s and 1, s.

answer:c

a. 01
b. ( 0 + 1) *
c. ( 0 + 1)
d. 0*1

12. Let r, s, t are regular expression s. Φ * =

answer:b

a. {Φ}
b. Φ
c. ε
d. {ε}

13. In NFA for r= a the minimum number of states are

answer:a

a. 2
b. 3
c. 1
d. 0

e. 15.

14.The FA pictured above recognizes

a. All strings
b. No String
c. є alone
d. None of the above

15)The String 1101 does not belong to set represented by

a. 110 *(0+1)
b. 1(0+1)*101
c. (10)*(01)*(00+11)*
d. 00+(11*)0)*1

Answer:d

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

16) The regular expression 0*(10*)* denotes the same set as

answer:d

a. 1*0)*1
b. 0+(0+10)*
c. 0+1)*10(0+1)*
d. None of the above

17).The minimum number of states in the NFA accepting the language

(ab+abc)* is ---------------

answer:2

18)..The left linear grammar S → S10/ 0 generate

answer:c

a. 010 *
b. 010
c. 0(10)*
d. 0*10

19.)A grammar is a device

answer:a

a. acceptor
b. generative
c. cognitive
d. can‟t say

20). Regular grammar is a subset of grammar .

Answer:b

a. Type 0
b. Type 0, 1 & 2
c. Type 2
d. Type 1

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

UNIT-3

1. A grammar G is known to have GNF representation then

a) G can‟t be written left or right linear
b) G may be written as left linear or right linear
c) We can write G as left linear
d) We can write G as left linear or right linear
Answer: B
2. A CFL for which every CFG is ambiguous is said to be an ambiguous-----
CFL.
a) inherently
b) inequal

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

c) implicitly
d) Explicitly
Answer: A
3. The following CFG S aB |bA,A b| aS |bAA ,Bb| bS |aBB
Generates strings of terminals that have
a) equal number of a‟s and b‟s
b) even number of a‟s and even number of b‟s
c) odd number of a‟s and even number of a‟s
d) odd number of a‟s and odd number of b‟s
Answer: A
4. Pumping lemma for CFL : Let L be any CFL .Then there is a constant n
depending only on L ,such that if z is in
L and | z|>= n then we may write z= u v w x y such that
1) | vx|>= 1
2) | vwx| is----------
3) for all i>=0 u vi w xi y is in L
a) <n
b) >=n
c) <=n
d) >n
Answer: C
5. Context free languages are closed under ”union” is
a) can‟t say
b) False
c) True
d) True or False
Answer: C
6. A CFG is ambiguous if some word has left most derivations
a) < 1
b) 1
c) exactly 5
d) >1
Answer: D
7. Let two kinds of grammars be defined as follows
i) Aa, ABC
ii) A aa
a) ii denotes CNF and i does n‟t denote GNF
b) i denote CNF and ii does n‟t denote GNF
c) i denote CNF and ii denotes GNF
d) ii denotes CNF and i denotes GNF
Answer: C

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

8. Context free languages are closed under “Concatenation” is

a) False
b) True
c) True or False
d) Can‟t say
Answer: B
9. CFL‟s are closed under
a) Union and complementation
b) concatenation & intersection
c) Substitution & homomorphism
d) inverse homomorphism & complementation
Answer: D
10.A context free grammar is said to be ambiguous if it contains --------------
-------------------
Answer: CFL
11. If L is CFL and R is regular set then Land R is a----------------------------
Answer: CFL
12. NPDA = ( S, Σ, Г, δ, s, X). s belongs to
a) s
b) δ
c) X
d) S
Answer: D
13. Consider the following grammar
S  a ABB | aAA
A  aBB | a
B  bBB | A
In NPDA for above G δ (Q1,b,A) =
a) ( Q1,BB),(Q1,λ)
b) (Q1,BB),(Q1, λ)
c) (Q1,BB)
d) (Q1,ABB),(Q1,AA)
Answer: C
14. A PDA is deterministic if :
i) δ (q, λ, z) != φ implies δ (q,a,z) = φ for all a belongs to Z
ii) δ ( q,a,z) is
a) empty
b) empty and singleton
c) singleton
d) empty or singleton
Answer: B

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

15. A regular set accepted by DFA with n states is accepted to final state by a
DPDA with n states and at least ---------------- pushdown symbols
a) 1
b) 2
c) 4
Answer: A
16. Let L be a language accepted by a DPDA then compliment(L) can also be
accepted by a DPDA.” Is-------------
a) True
b) can‟t say
c) False
d) true or false
Answer: A
17. Context free languages are closed under ”union” is
a) can‟t say
b) False
c) True
d) True or False
Answer: C
18. NPDA = ( S, Σ, Г, δ, s, X).-----------. represents finite set of states
a) Σ
b) δ
c) S
d) Г
Answer: C
19. Non deterministic finite state acceptor--------------
a) CFL
b) CSL
c) Recursively enumerable language
d) RL
Answer: D
20. Which of the following is not accepted by DPDA
a) String ending with a particular alphabet
b) All strings in which a given symbol is present at least twice
c) All strings in which a given symbol is present at least thrice
d) Even palindromes
Answer: D
21. A PDA behaves like an FA when the number of auxiliary memory it has
is
a) 1 or more
b) 0
c) 3 or more

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

d) 2 or more
Answer: B
22. Let L be a DCFL .R be a regular language then L?R is not a DCFL is
a) can‟t say
b) true or false
c) True
d) False
e) X
Answer: D
23. Deterministic push down automaton :
a) CFL
b) DCFL
c) Recursively enumerable language
d) RL
Answer: B
24. Which of the following is accepted by an NPDA and not DPDA
a) All strings in which a given symbol is present at least twice
b) String ending with a particular alphabet
c) Even palindromes
d) All strings in which a given symbol is present at least thrice
Answer: C
25. A PDA behaves like an FA when the number of auxiliary memory it has
is
a) 1 or more
b) 2 or more
c) 3 or more
d) 0
Answer: D
26. A PDA behaves like as FA when the number of auxiliary memory it has
is
a. 0
b) 1
c) 2
d) None
Answer: A

UNIT-4

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

1. The class of TM is equivalent to the class of

a) Type 0
b) Type 3
c) Type 1
d) Type 2
Answer: A
2. Turing machines use what as their memory
a) finite tape
b) infinite tape
c) RAM
d) ROM
e) None
Answer: B
3. Comparing TM and computers we find
a) Both are equivalent
b) They can not be compared
c) TM has more computational power
d) Computers have
e) more computational power
Answer: E
4. A Turing machine computes by going from one configuration to another.
We say that configuration C1 yields configuration
C2 if the Turing machine can legally move form C1 to C2 in
a) two steps
b) a finite number of steps
c) an infinite number of steps
d) a single step
Answer: C
5. Recursive enumerable languages is also known as languages.
a) type 0
b) type 3
c) type 2
d) type 1
Answer: A
6 .The LBA is a variant of
a) PDA
b) FA
c) TM
d) NFA
Answer:C
7. Turing machine is

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a. RL b. CFL c. Recursively enumerable language d. CSL

Answer: C
8. Turing machine that halts
a. recursive language b. CFL c. Recursively enumerable language d.
CSL
Answer: A
9. Any TM with m symbols and n states can be simulated by another TM
with just 2 symbols and less than
a. 8mn states b. 4mn + 8 states c. 8mn +4 states d. mn states
Answer: D
10. Which of the following is not a variant of the standard Turing machine?
a. LBA b. PDA c. universal Turing machine d. TM
Answer: B
11. LBA (NDTM) =(S, A, δ, S0, Δ L, ΔR, F). _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ is
input alphabet
a. Δ L b. Δ R c. Δ L, Δ R d. δ
Answer: C
12. Which automata is associated with context sensitive language ?
a. turing machine b. finite automata c. PDA d. LBA
Answer: D
13. LBA is _ _ _ _
a. unrestricted TM b. restricted TM from one side c. restricted TM from
both sides d. can't say
Answer: C
14. Which of the following is true : Read Write head can move
a. to the left of left endmarker in LBA b. to the right of left endmarker in
LBA
c. to the right of right end marker in LBA d. it can't move 1
Answer: C
15. Set of all Turing machines is
a. uncountable b. countable but infinite c. finite d. void 1
Answer: A
16. Which of the following statements is true?
a. A set X is recursive if we have a algorithm to decide whether a given
element belongs to X or not
b. A recursive set is recursively enumerable
c. A context sensitive language is recursive
d. set of real numbers is not enumerable
Answer: B
17. Find the false statement is
a. L is recursively enumerable then so is compliment of L
b. L is recursive then so is complement of L
c. L is recursive then compliment of L is recursively enumerable

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

d. If L and complement of L are recursively enumerable then both are

recursive
Answer: D
18. If there exits a language L for which there exits aTM, T that accepts every
word in L and either rejects or loops for every word that is not in L is said to
be
a. recursive b. recursively enumerable c. NP-HARD d. NP-
COMPLETE
Answer: B
19. LBA (NDTM) =(S, A, Δ, S0, Δ L, ΔR, F). δ(Si, ΔR) = _ _ _ _ _
a. (Sj, ΔR,R) b. (Sj, ΔR,L) c. (Sj,ΔL,R) d. (Sj, ΔR,L)
Answer: B
20. LBA is a NDTM is _ _ _ _
a. True b. False c. True or False d. can't say
Answer: A

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

UNIT : 5

a. 1. Which of the following is superset to all ?

Answer:d

a)type 2

b)type 1

c)type 3

d)type 0

2. LBA is a NDTM is----------------

answer:c

a. False
b. True or False
c. True
d. can‟t say

Abb | b aA , A 3. Consider grammar represented by S

answer:a

a. LR(0)
b. LR(1)
c. LR(3)
d. LR(2)

4. Find the correct statement

answer:b

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a. recursive is same as recursively enumerable

b. type 3 is also called as Regular Language
c. recursively enumerable implies recursive
d. recursive implies recursively enumerable

5. The complement of recursive is

answer:b

a. recursive
b. neither recursive nor non recursive
c. non recursive
d. recursive or non

e. recursive

6. What can you say about the membership problem for Type 0
grammars ?

Answer:c

a. decidable
b. partially decidable
c. can‟t say
d. undecidable

7. MPCP stands for

answer:c

a. many posts correspondence problem

b. many posts correspondence problem
c. modified posts correspondence problem
d. merged posts correspondence problem

8. The class of context free languages are contained in

answer:d

a. DTIME(n*n)
b. DTIME(n*n*n*n)
c. DTIME(n)
d. DTIME(n*n*n)

9. What version of a problem is used to determine if it is NP hard

answer:b

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a. worst case solution

b. decision problem
c. optimal solution problem
d. optimal value problem

10. The class of unrestricted language corresponds to

answer:b

a. PDA
b. TM
c. LBA
d. FA

11. Recursive enumerable languages is also known as languages.

Answer:a

e.

a. type 0
b. type 1
c. type 3
d. type 2

a B| λ A B| λ , B A, A 12.Give the type of the following

grammars S

answer:c

a. LL
b. LR(0)
c. LR(1)
d. LR(2)

13. Which of the following is not primitive recursive?

Answer:d

a. Addition
b. LCM
c. division
d. Ackerman‟s function

14. A problem whose language is recursive is said to be

answer:d

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

a. decidable
b. decidable or un decidable
c. can‟t say
d. un decidable

15. Find the odd man out

answer:c

a. State entry problem

b. Blank tape halting problem
c. Post correspondence problem
d. The hating problem of TM

16. ‟MPCP is un decidable problem ‟is-----------

answer:a

a. True
b. true or false
c. False
d. can‟t say

17. The problem of determining whether or not a TM over [0,1] will

ever print the symbol 1 with a given tape configuration is

answer:b

a. can‟t say
b. unsolvable
c. solvable or unsolvable
d. solvable

18. If NP!= coNP then

answer:a

a. NP!= P
b. P=coNP
c. P!= coNP
d. NP=P

19. Let B be a LBA .Then grammar corresponding to L(B) is

Answer:b

a. CFL
b. CSL

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

c. regular grammar
d. Unrestricted grammar

20. Give the type of the following grammars P!begin D ; C end D ! d|

d;DC ! c| c;C

a. LR(1) b.L c.LR(2)

Answer:c

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)

 lOMoARcPSD|44639330

Downloaded by aecsaranya durai (aecsaranyadurai@gmail.com)