gs gs101 Finite Automata - Non Deterministic Finite Automata-Introduction - Quiz No.1
gs gs101 Automata Theory Quiz
This quiz belongs to book/course code gs gs101 Automata Theory of gs organization. We have 92 quizzes available related to the book/course Automata Theory. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Finite Automata. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Which of the following options is correct?
Statement 1: Initial State of NFA is Initial State of DFA.
Statement 2: The final state of DFA will be every combination of final state of NFA.
Statement 1: Initial State of NFA is Initial State of DFA.
Statement 2: The final state of DFA will be every combination of final state of NFA.
Statement 1 is true and Statement 2 is true
Statement 1 is true and Statement 2 is false
Statement 1 can be true and Statement 2 is true
Statement 1 is false and Statement 2 is also false
Question 3: An automaton that presents output based on previous state or current input:
Acceptor
Classifier
Transducer
None of the mentioned.
Question 5: NFA, in its name has ’non-deterministic’ because of :
The result is undetermined
The choice of path is non-deterministic
The state to be transited next is non-deterministic
All of the mentioned
Question 6: Which of the following is correct proposition?
Statement 1: Non determinism is a generalization of Determinism.
Statement 2: Every DFA is automatically an NFA
Statement 1: Non determinism is a generalization of Determinism.
Statement 2: Every DFA is automatically an NFA
Statement 1 is correct because Statement 2 is correct
Statement 2 is correct because Statement 2 is correct
Statement 2 is false and Statement 1 is false
Statement 1 is false because Statement 2 is false
Question 8: The construction time for DFA from an equivalent NFA (m number of node)is:
O(m2)
O(2m)
O(m)
O(log m)
Question 10: Which of the following option is correct?
NFA is slower to process and its representation uses more memory than DFA
DFA is faster to process and its representation uses less memory than NFA
NFA is slower to process and its representation uses less memory than DFA
DFA is slower to process and its representation uses less memory than NFA
Online Quizzes of gs101 Automata Theory
Other Classes Of Problems - Randomized Algorithm - Quiz No.1
gs gs101
Automata Theory Online Quizzes
Push Down Automata - DPDA and Ambiguous Grammars - Quiz No.1
gs gs101
Automata Theory Online Quizzes
