Theory of Computation MCQ (Multiple Choice Questions) - SchoolingAxis

Theory of Computation MCQ (Multiple Choice Questions)

 1. Which among the following is not an associative operation?

a. Union

b. Concatenation

c. Dot

d. None of the mentioned


Ans- d. None of the mentioned


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


Ans- a. Expressions are juxtaposed


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


Ans- a. (x-y)-z


4. (a + b*c) most correctly represents:

a. (a +b) *c

b. (a)+((b)*.c)

c. (a + (b*)).c

d. a+ ((b*).c)


Ans- d. a+ ((b*).c)


5. The finite automata accept the following languages:

a. Context Free Languages

b. Context Sensitive Languages

c. Regular Languages

d. All the mentioned


Ans- c. Regular Languages


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


Ans- c. R, L(R)


7. The appropriate precedence order of operations over a Regular Language is

a. Kleene, Union, Concatenate

b. Kleene, Star, Union

c. Kleene, Dot, Union

d. Star, Union, Dot


Ans- c. Kleene, Dot, Union


8. Regular Expression denote precisely the ____ of Regular Language.

a. Class

b. Power Set

c. Super Set

d. None of the mentioned


Ans- a. Class


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


Ans- a. 4


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


Ans- a. Create the NFA using Null moves

Previous Post Next Post

Responsive Ad