TOC_CO4&CO5
Authored by Nandini V
Computers
University
Used 1+ times
AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
25 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
A Turing machine that is able to simulate other Turing machines:
Nested Turing machines
Universal Turing machine
Counter machine
None of the mentioned
2.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the problems are unsolvable?
Halting problem
Boolean Satisfiability problem
Halting problem & Boolean Satisfiability problem
None of the mentioned
3.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Which of the following a Turing machine does not consist of?
input tape
head
state register
none of the mentioned
4.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The value of n if Turing machine is defined using n-tuples:
6
7
8
5
5.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
Statement: Instantaneous descriptions can be designed for a Turing machine. State true or false:
true
false
7.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
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
Access all questions and much more by creating a free account
Create resources
Host any resource
Get auto-graded reports
Continue with Google
Continue with Email
Continue with Microsoft
or continue with
%20(1).png)
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?
