vu cs402 Mid Term - Quiz No.12
vu cs402 Theory of Automata Quiz
This quiz belongs to book/course code vu cs402 Theory of Automata of vu organization. We have 36 quizzes available related to the book/course Theory of Automata. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Mid Term. 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: Between the two consecutive joints on a path
One character can be pushed and one character can be popped
Any no. of characters can be pushed and one character can be popped
One character can be pushed and any no. of characters can be popped
Any no. of characters can be pushed and any no. of characters can be popped
Question 2: For the given input, it provides the Boolean OR output
NAND box (NOT AND)
DELAY box
OR box
AND box
Question 3: If r1 = (aa + bb) and r2 = (a + b) then the language (aa + bb)(a + b) will be generated by
(r1)(r2)
(r1 + r2)
(r2)(r1)
(r1)*
Question 4: Length of null string is
Always not equal to 0
Always equal to 0
It has variable length
All are true
Question 5: FA1 and FA2 are two FA's representing two languages. Then FA3, which is sum of FA1 and FA2, will accept the strings which are
Accepted by FA1 AND FA2
Accepted by FA1 OR FA2
Accepted by FA1 AND/OR FA2
None of the given options
Question 6: The grammatical rules are often called __________
Productions
Terminals
Non-terminals
None of given
Question 7: Languages generated by kleene star are always __________.
Finite
Infinite
Sometimes finite & sometimes infinite
None of the these
Question 8: GTG can have __________ final state.
0
1
More than 1
All of the given
Question 10: CFG stands for __________
Context Free Graph
Context Free Grammer
Context Finite Graph
Context Finite Grammer
