Scribd
Upload
75 views

UNIT - I - Session Wise MCQ

This document contains 8 multiple choice questions about finite automata and finite state machines: 1. The questions cover topics like the transition function of DFAs and NFAs, the maximum number of states in a DFA converted from an NFA, basic limitations of finite state machines, strings recognized by FSMs, types of languages recognized by finite automata, properties of dead states, and characteristics of Moore machines. 2. The questions are part of a practice test or review on fundamental concepts in finite automata theory and finite state machines. 3. Each question is identified by a number, the session and question number, the text of the multiple choice question, and metadata on the cognitive level, content area,

Uploaded by

Manish Valechha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
75 views

UNIT - I - Session Wise MCQ

This document contains 8 multiple choice questions about finite automata and finite state machines: 1. The questions cover topics like the transition function of DFAs and NFAs, the maximum number of states in a DFA converted from an NFA, basic limitations of finite state machines, strings recognized by FSMs, types of languages recognized by finite automata, properties of dead states, and characteristics of Moore machines. 2. The questions are part of a practice test or review on fundamental concepts in finite automata theory and finite state machines. 3. Each question is identified by a number, the session and question number, the text of the multiple choice question, and metadata on the cognitive level, content area,

Uploaded by

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

Unit 1

Multiple Choice Questions


Q. Session Question M Blooms CO PO
No. No. ar Taxonomy
ks
1 1 1) The transitional function of a 1 2
DFA is
a.Q X Σ→Q
b.Q X Σ→2Q
c.Q X Σ→2n
d.Q X Σ→Qn
2 2 2) The transitional function of a 1 2
NFA is
a.Q X Σ→Q
b.Q X Σ→2Q
c.Q X Σ→2n
d.Q X Σ→Qn
3 3 3) Maximum number of states of a 2 2
DFA converted from a NFA with n
states is
a.n
b.n^2
c.2n
d.None of these
1,3 1, 12,
4 4 4) Basic limitations of finite state 1 3
machine is
a.It cannot remember arbitrarily
large amount of information
b. It cannot remember state
transitions
c. It cannot remember grammar for
a language
d. It cannot remember language
generated from a grammar
5 5 5) The string WWR is not 2 2
recognized by any FSM because
a. A FSM cannot remember
arbitrarily large amount of
information
b. A FSM cannot fix the midpoint
c. A FSM cannot match W with
WR
d. A FSM cannot remember first
and last inputs
6 6 6) A finite automata recognizes 1 2
a. Any Language
b. Context Sensitive Language
c. Context Free Language
d. Regular Language

7 7 7) Which is true for Dead State? 1 2


a. It cannot be reached anytime
b. There is no necessity of the state
c. If control enters no way to
come out from the state
d. If control enters FA dead.

8 8 Which is true for Moore Machine? 1 2

a. Output depends on present


state
b. Output depends on present input
c. Output depends on present state
and present input
d. Output depends on present state
and past input

You might also like