# Theory of Computation MCQ (Multiple Choice Questions) - SchoolingAxis

1. 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

Ans- d. None of the mentioned

2. Which of the following are not quantifiers?

a. Kleene plus +

b. Kleene star *

c. Question mark ?

d. None of the mentioned

Ans- d. None of the mentioned

3. The following is/are an approach to process a regexp:

a. Contruction of NFA and subsequently, a DFA.

b. Thompson's Contruction Algorithm

c. Both (a) and (b)

d. None of the mentioned

Ans- c. Both (a) and (b)

4. Which of the following languages have built in regexps support?

a. Perl

b. Java

c. Python

d. C++

Ans- a. Perl

5. Which of the following do Regexps do not find their use in?

a. search engines

b. word processors

c. sed

d. None of the mentioned

Ans- d. None of the mentioned

6. What kind of expressions do we used for pattern matching?

a. Regular Expression

b. Rational Expression

c. Regular & Rational Expression

d. None of the mentioned

Ans- c. Regular & Rational Expression

7. Regular expressions are closed under

a. Union

b. Intersection

c. Kleene star

d. All of the mentioned

Ans- d. All of the mentioned

8. 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

Ans- b. Every finite subset of non-regular set is regular

9. Regular expression are:

a. Type 0 language

b. Type 1 language

c. Type 2 language

d. Type 3 language

Ans- a. Type 0 language

10. Which of the following is not a regular expression?

a. [(a+b)-(aa+bb)]

b. [(0+1)-(0b+a1)(a+b)]

c. (01+11+10)*

d. (1+2+0)(1+2)

Ans- b. [(0+1)-(0b+a1)(a+b)]