gs gs101 Introduction to Turing Machines - The Language 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: A turing machine that is able to simulate other turing machines:
Nested Turing machines
Universal Turing machine
Counter machine
None of the mentioned
Question 2: Which of the problems are unsolvable?
Halting problem
Boolean Satisfiability problem
Halting problem & Boolean Satisfiability problem
None of the mentioned
Question 3: Which of the following a turing machine does not consist of?
input tape
head
state register
none of the mentioned
Question 5: If d is not defined on the current state and the current tape symbol, then the machine ______
does not halts
halts
goes into loop forever
none of the mentioned
Question 7: Which of the following are the models equivalent to Turing machine?
Multi tape turing machine
Multi track turing machine
Register machine
All of the mentioned
Question 8: Which among the following is incorrect for o-machines?
Oracle Turing machines
Can be used to study decision problems
Visualizes Turing machine with a black box which is able to decide cerain decion problems in one operation
None of the mentioned
Question 9: RASP stands for:
Random access storage program
Random access stored program
Randomly accessed stored program
Random access storage programming
Question 10: Which of the following is not true about RASP?
Binary search can be performed more quickly using RASP than a turing machine
Stores its program in memory external to its state machines instructions
Has infinite number of distinguishable, unbounded registers
Binary search can be performed less quickly using RASP than a turing machine e) More than two options are incorrect
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
