gs gs101 Introduction to Turing Machines - Multitape Turing Machines - 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: A turing machine with several tapes in known as:
Multi-tape turing machine
Poly-tape turing maching
Universal turing machine
All of the mentioned
Question 2: A multitape turing machine is ________ powerful than a single tape turing machine.
more
less
equal
none of the mentioned
Question 3: In what ratio, more computation time is needed to simulate multitape turing machines using single tape turing machines?
doubly
triple
quadratically
none of the mentioned
Question 4: Which of the following is true for two stack turing machines?
one read only input
two storage tapes
one read only input & two storage tapes
None of the mentioned
Question 5: Which of the following is not a Non deterministic turing machine?
Alternating Turing machine
Probabalistic Turing machine
Read-only turing machine
None of the mentioned
Question 6: Which of the turing machines have existential and universal states?
Alternating Turing machine
Probalistic Turing machine
Read-only turing machine
None of the mentioned
Question 7: Which of the following is false for Quantum Turing machine?
Abstract machine
Any quantum algorithm can be expressed formally as a particular quantum turing machine
Gives a solution to ‘Is a universal quantum computer sufficient’
None of the mentioned
Question 8: A deterministic turing machine is:
ambiguous turing machine
unambiguous turing machine
non-deterministic
none of the mentioned
Question 9: Which of the following is true about Turing’s a-machine?
a stands for automatic
left ended, right end-infinite
finite number of tape symbols were allowed
all of the mentioned
Question 10: Which of the following is a multi tape turing machine?
Post turing Machine
Wang-B Machine
Oblivious turing Machine
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
