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

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

Ans- a. If it is accepted by automata

2. There are ____ tuples in finite state machine.

a. 4

b. 5

c. 6

d. Unlimited

Ans- d. Unlimited

3. The sum of minimum and maximum number of final states for a DFA n states is equal to:

a. n+1

b. n

c. n-1

d. n+2

Ans- a. n+1

4. The maximum sum of in degree and out degree over a state in a DFA can be determined as: ?= {a, b, c, d}

a. 4+4

b. 4+16

c. 4+0

d. Depends on the Language

Ans- d. Depends on the Language

5. The maximum number of transition which can be performed over a state in a DFA? ?= {a, b, c}

a. 1

b. 2

c. 3

d. 4

Ans- c. 3

6. How many languages are over the alphabet R?

a. countably infinite

b. countably finite

c. uncountable finite

d. uncountable infinite

Ans- d. uncountable infinite

7. For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

a. 3

b. 2

c. 22

d. 27

Ans- a. 3

8. The password to the admins account="administrator". The total number of states required to make a password-pass system using DFA would be ____

a. 14 states

b. 13 states

c. 12 states

d. A password pass system cannot be created using DFA

Ans- a. 14 states

9. Which of the following is not an example of finite state machine system?

a. Control Mechanism of an elevator

b. Combinational Locks

c. Traffic Lights

d. Digital Watches

Ans- d. Digital Watches

10. Can a DFA recognize a palindrome number?

a. Yes

b. No

c. Yes, with input alphabet as ?*

d. Can't be determined

Ans- b. No