Question Bank for Unit Test

Subject: Theory of Computation Semester: V

Class: T.Y. B.Tech Unit Test: 01

Unit No: - I
Que.
Question CO Level Marks
No.
1. MCQs
1 A language is regular if and only if 01 Understand 01
a) accepted by DFA
b) accepted by PDA
c) accepted by LBA
d) accepted by Turing machine
2 Which of the technique can be used to prove that a 01 Remember 01
language is non regular?
a) Ardens theorem
b) Pumping Lemma
c) Ogden’s Lemma
d) None of the mentioned
3 Which of the following language regular? 01 Analyze 01
a) {aibi|i>=0}
b) {aibi|0<i<5}
c) {aibi|i>=1}
d) None of the mentioned
4 All the regular languages can have one or more of 01 Understand 01
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
5 In Moore machine, output is produced over the 01 Remember 01
change of:
a) Transitions
b) states
c) Both
d) None of the mentioned
6 Which of the following statements is correct? 01 Remember 01
a) A = { If an bn | n = 0,1, 2, 3 ..} is regular language
b) Set B of all strings of equal number of a's and b's
defines a regular language
 c) L (A* B*)∩ B gives the set A
d) None of these
7 Basic limitation of FSM is that it 01 Remember 01
a) can not remember arbitrary large amount of
information
b) sometimes fails to recognize grammars that are
regular
c) sometimes recognizes grammars are not regular
d) None of these
8 FSM can recognize 01 Understand 01
a) any grammar
b) only Context Free Grammar
c) Both (a) and ( b )
d) Only Regular Grammar
9 (a+b)* is equivalent to 01 Apply 01
a) a) b*a*
b) (a*b*)*
c) a*b*
d) none of the mentioned
10 Which of the following pair of regular expression are 01 Apply 01
not equivalent?
a) 1(01)* and (10)*1
b) x(xx)* and (xx)*x
c) (ab)* and a*b*
d) x+ and x*x+
11 RR* can be expressed in which of the forms: 01 Understand 01
a) R+
b) R-
c) R+ U R-
d) R
12 Concatenation of R with Ф outputs: 01 Understand 01
a) R
b) Ф
c) R.Ф
d) None of the mentioned
13 Which of the following is not a regular expression? 01 Understand 01
a) [(a+b)*-(aa+bb)]*
b) [(0+1)-(0b+a1)*(a+b)]*
c) (01+11+10)*
d) (1+2+0)*(1+2)*
14 Transition function maps. 01 Apply 01
a) Σ * Q -> Σ
b) Q * Q -> Σ
c) Σ * Σ -> Q
d) Q * Σ -> Q
15 Concatenation Operation refers to which of the Understand 01
following set operations:
 a) Union
b) Dot
c) Kleene
d) Two of the options are correct
2. Short Answer Questions
1 Construct a regular expression corresponding to the 01 Apply 04
state diagram given below.

2 Construct DFA accepting language represented by 0* 01 Apply 04

1* 2*
3 Construct a minimum state automaton equivalent to 01 Apply 04
a given automaton M whose transition table is given
below

4 Use pumping lemma, show that following set is not 01 Apply 04

Regular.
{ an b2n |n > 0 }
5 Construct a MOORE machine equivalent to MEALY 01 Solve 04
machine defined by following table,

6 Find the Regular Expression for given finite 01 Apply 04

automata,
3 Long Answer Question
1 Construct a minimum state automata equivalent to 01 Solve 08
DFA

2 Construct DFA accepting language represented by, 01 Apply 08

10 + (0 + 11) 0 * 1
3 Use pumping lemma, show that following set is not 01 Apply 08
Regular.
a) { an bm | m > n > 0 }
b) {a2n | m > n > 0 }
4 Construct a minimum state automaton equivalent to 01 Solve 08
a given automaton M whose transition table is given
below