Scribd
Upload
5 views

Unit 1 MCQ

Uploaded by

chaudharisagar2345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Unit 1 MCQ

Uploaded by

chaudharisagar2345
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Theory of Computation

Class- TY-BTech CSE Semester-I


Multiple Choice Questions
MCQ’s (Options in bold are the answers for respective MCQ)
UNIT-1
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
2. Which of the following is true?
a) (01)*0 = 0(10)*
b) (0+1)*0(0+1)*1(0+1) = (0+1)*01(0+1)*
c) (0+1)*01(0+1)*+1*0* = (0+1)*
d) All of the mentioned
3. A language is regular if and only if
a) accepted by DFA
b) accepted by PDA
c) accepted by LBA
d) accepted by Turing machine
4. Regular grammar is
a) context free grammar
b) non context free grammar
c) english grammar
d) none of the mentioned
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
6. Regular expression are
a) Type 0 language
b) Type 1 language
c) Type 2 language
d) Type 3 language
7. Which of the following is true?
a) Every subset of a regular set is regular
b) Every finite subset of non-regular set is regular
c) The union of two non regular set is not regular
d) Infinite union of finite set is regular
8. Regular expressions are closed under
a) Union
b) Intersection
c) Kleen star
d) All of the mentioned
9. Regular expressions are used to represent which language
a) Recursive language
b) Context free language
c) Regular language
d) All of these
10. Which of the following operation can be applied on regular expressions?
a) Union
b) Concatenation
c) Closure
d) All of these
11. The set of all strings over ∑ = {0,1} in which all strings that beings and ends with 0 is
a) 0(0+1)0
b) 00
c) 00(0+1)0
d) All of these
12. The set of all strings over ∑ = {a,b} in which all strings having bbbb as substring is
a) (a+b)* bbbb (a+b)*
b) (a+b)* bb (a+b)*bb
c) bbbb (a+b)*
d) bb (a+b)*
13. 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 these
14. The set of all strings over ∑ = {a,b} in which all strings of a’s and b’s ending in bb is
a) ab
b) a*bbb
c) (a+b)* bb
d) All of these
15. Which of the following identity is wrong?
a) R + R = R
b) (R*)* = R*
c) ɛR = Rɛ = R
d) ØR = RØ = RR*
16. Which of the following statement is true?
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
c) We can convert regular expressions into finite automata
d) All of these
17. 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
18. Regular expression (x/y)(x/y) denotes the set
a) {xy,xy}
b) {xx,xy,yx,yy}
c) {x,y}
d) {x,y,xy}
19. Regular expression x/y denotes the set
a) {x,y}
b) {xy}
c) {x}
d) {y}
20. The regular expressions denote zero or more instances of an x or y is
a) (x+y)
b) (x+y)*
c) (x* + y)
d) (xy)*
21. 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)*
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*
23. The regular expression have all strings of 0′s and 1′s with no two consecutive 0′s is :
a.(0+1)
b.(0+1)*
c.(0+∈) (1+10)*
d.(0+1)* 011
24. 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*
25. In regular expressions, the operator ‘*’ stands for
a.Concatenation
b.Selection
c.Iteration
d.Addition

You might also like