gs gs101 Introduction to Turing Machines - Programming Techniques-Storage and Subroutines - 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 has ____________ number of states in a CPU.
finite
infinte
May be finite
None of the mentioned
Question 3: In one move a turing machine will:
Change a state
Write a tape symbol in the cell scanned
Move the tape head left or right
All of the mentioned
Question 5: Statement 1: Multitrack Turing machine.
Statement 2: Gamma is Cartesian product of a finite number of finite sets.
Which among the following is the correct option?
Statement 2: Gamma is Cartesian product of a finite number of finite sets.
Which among the following is the correct option?
Statement 1 is the assertion and Statement 2 is the reason
Statement 1 is the reason and Statement 2 is the assertion
Statement 1 and Statement 2 are independent from each other
None of the mentioned
Question 6: A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents:
input alphabet
tape alphabet
shift symbols
none of the mentioned
Question 7: Which of the following statements are false?
A multi track turing machine is a special kind of multi tape turing machine
4-heads move independently along 4-tracks in standard 4-tape turing machine
In a n-track turing machine, n head reads and writes on all the tracks simultaneously.
All of the mentioned
Question 9: Which of the following is/are not true for recursively enumerable language?
partially decidable
Turing acceptable
Turing Recognizable
None 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
