0 of 20 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
Information
Quiz Description :
Name: Turing machine mcq Test with answers – 1
Subject: Automata ( Theory of Computation)
Topic: Turing Machine
Questions: 20 Objective type
Time Allowed: 15 Minutes
Important for: Computer Science B. Tech / M. Tech students and Professional for university exam, Job interview and PSU exams.
You have already completed the Test before. Hence you can not start it again.
Test is loading...
You must sign in or sign up to start the Test.
You have to finish following quiz, to start this Test:
Congratulations!!!" Turing machine mcq Test with answers  1 "
0 of 20 questions answered correctly
Your time:
Time has elapsed
Your Final Score is : 0
You have attempted : 0
Number of Correct Questions : 0 and scored 0
Number of Incorrect Questions : 0 and Negative marks 0
Average score  
Your score 

Not categorized
You have attempted: 0
Number of Correct Questions: 0 and scored 0
Number of Incorrect Questions: 0 and Negative marks 0
It’s time to share this quiz with your friends on Facebook, Twitter, Google Plus, Whatsapp or LinkedIn…
Click on View Questions Button to check Correct and incorrect answers.
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 Answered
 Review
 Question 1 of 20
1. Question
1 pointsWhat is the reason behind a Turing machine is more powerful than finite state machine FSM?
CorrectIncorrectUnattempted  Question 2 of 20
2. Question
1 pointsA pushdown automata behaves like a Turing machine, when it has number of auxiliary/ memory.
CorrectIncorrectUnattempted  Question 3 of 20
3. Question
1 pointsThe language L = {a^{n}b^{n}a^{n} n≥ 1} is recognized by
CorrectIncorrectUnattempted  Question 4 of 20
4. Question
1 pointsIf Turing machine accepts all the words of the languages L and rejects or loops for other words, which are not in L, then L is said to be
CorrectIncorrectUnattempted  Question 5 of 20
5. Question
1 pointsIf a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
CorrectIncorrectUnattempted  Question 6 of 20
6. Question
1 pointsUniversal Turing machine (UTM) influenced the concepts of
CorrectIncorrectUnattempted  Question 7 of 20
7. Question
1 pointsThe number of symbols necessary to simulate a Turing machine with m symbols and n states
CorrectIncorrectUnattempted  Question 8 of 20
8. Question
1 pointsA universal Turing machine is a
CorrectIncorrectUnattempted  Question 9 of 20
9. Question
1 pointsHe difference between a readonly Turing machine and a twoway finite state machine is
CorrectIncorrectUnattempted  Question 10 of 20
10. Question
1 pointsWhich is correct regard an offline Truing machine?
CorrectIncorrectUnattempted  Question 11 of 20
11. Question
1 pointsWhich of the following statement is wrong?
CorrectIncorrectUnattempted  Question 12 of 20
12. Question
1 pointsFour pairs are following; in each pair both objects have some common thing. Choose the odd pair;
CorrectIncorrectUnattempted  Question 13 of 20
13. Question
1 pointsWe think of a Turing machine’s transition function as a
CorrectIncorrectUnattempted  Question 14 of 20
14. Question
1 pointsChurch’s Thesis supports
CorrectIncorrectUnattempted  Question 15 of 20
15. Question
1 pointsA random access machine (RAM) and truing machine are different in
CorrectIncorrectUnattempted  Question 16 of 20
16. Question
1 pointsChoose the correct statement
CorrectIncorrectUnattempted  Question 17 of 20
17. Question
1 pointsGiven S = {a, b}, which one of the following sets is not countable?
CorrectIncorrectUnattempted  Question 18 of 20
18. Question
1 pointsIn which of the stated below is the following statement true?
“For every nondeterministic machine M_{1}, there exists as equivalent deterministic machine M_{2} recognizing the same language.”CorrectIncorrectUnattempted  Question 19 of 20
19. Question
1 pointsWhich of the following conversion is not possible (algorithmically)?
CorrectIncorrectUnattempted  Question 20 of 20
20. Question
1 pointsMatch the following ListI with ListII and select the correct answer using the codes given below the lists:
ListI ListII A. Laxical analyser 1. Pushdown automata B. Parsing 2. Turing machine C. Computing 3. Finite state automata D. Nondeterministic but finite machine 4. Nondeterministic FA CorrectIncorrectUnattempted