gs gs101 Introduction to Turing Machines - Simulation of Turing Machine - 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 Introduction to Turing Machines. 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: Fill in the blank with an appropriate option.
In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine.
In automata theory, ___________ is said to be Computationally Universal if can be used to simulate any single taped Turing Machine.
Computer’s instruction set
A programming language
Cellular Automaton
All of the mentioned
Question 2: Give a classic example of the concept of turing complete.
lambda calculus
C++
Lisp
All of the mentioned
Question 3: Let two machines be P and Q. The state in which P can simulate Q and Q can simulate P is called:
Turing Equivalence
State Equivalence
Universal Turing Machine
None of the mentioned
Question 4: Which of the following remarks the given statement?
Statement: Any function whose values can be computed by an algorithm, can be computed by a Turing machine.
Statement: Any function whose values can be computed by an algorithm, can be computed by a Turing machine.
Smn theorem
Structured Program theorem
Church-Turing thesis
None of the mentioned
Question 5: Which of the following can be used to simulate any turing machine?
Finite State Automaton
Universal Turing Machine
Counter machines
All of the mentioned
Question 7: Which of the following can lack in a Universal computer?
Turing Complete Instruction set
Infinite memory
Infinite time
None of the mentioned
Question 8: Which among are not the results of computational theory?
In general, it is impossible to predict that what a Turing-complete program will do over an arbitrarily long time
It is impossible to determine for every input, whether the program will eventually stop or continue forever
It is not possible to determine whether a program will return true or false
None of the mentioned
Question 9: Which of the games fill under the category of Turing-complete?
Minecraft
Minesweeper
Dwarf Fortress
Conway’s Game of Life e) Pokemon Yellow, etc.
Question 10: Which of the following a Non-turing Complete language?
Regular Language
Context free grammars
Epigram
All of the mentioned
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
