0 of 16 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
Information
Quiz Description :
Name: Turing Machine objective question answer test – 2
Subject: Automata ( Theory of Computation)
Topic: Turing Machine
Questions: 16 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 objective question answer test  2 "
0 of 16 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
 Answered
 Review
 Question 1 of 16
1. Question
1 pointsA problem is decidable if there is
CorrectIncorrectUnattempted  Question 2 of 16
2. Question
1 pointsPost correspondence problem is first suggested by
CorrectIncorrectUnattempted  Question 3 of 16
3. Question
1 pointsPost correspondence is to determine a
CorrectIncorrectUnattempted  Question 4 of 16
4. Question
1 pointsIf L_{1} and L_{2} are two regular languages then the problem “Is L_{1} ⨁ L_{2} (L_{1} ExOR L_{2}) regular” is
CorrectIncorrectUnattempted  Question 5 of 16
5. Question
1 pointsPost correspondence problem over {a} is
CorrectIncorrectUnattempted  Question 6 of 16
6. Question
1 pointsLet G_{1} and G_{2} are two grammars and G_{1} is regular grammar. The problem L(G_{1}) = L(G_{2}) or not is decidable when
CorrectIncorrectUnattempted  Question 7 of 16
7. Question
1 pointsIf L_{1}, L_{2}, .. .. .., L_{n} are regular languages, then L = L_{1} ∪ L_{2} ∪ .. .. .. ∪ L_{n} is regular. This is
CorrectIncorrectUnattempted  Question 8 of 16
8. Question
1 pointsIf L_{1} is a recursively enumerable language, then whether L_{1}^{c} is recursively enumerable or not is
CorrectIncorrectUnattempted  Question 9 of 16
9. Question
1 pointsIf L_{1}, L_{2}, .. .. .. L_{n} are regular languages, then L = L_{1} ⨁ L_{1} ⨁ .. .. .. ⨁ L_{n} is regular. This is
CorrectIncorrectUnattempted  Question 10 of 16
10. Question
1 pointsDeciding ambiguity of a language generated by a CFG is
CorrectIncorrectUnattempted  Question 11 of 16
11. Question
1 pointsSelect the correct statements
CorrectIncorrectUnattempted  Question 12 of 16
12. Question
1 pointsIf a language L and its complement (∼L) are recursively enumerable then select statement
CorrectIncorrectUnattempted  Question 13 of 16
13. Question
1 pointsSelect the correct statement
CorrectIncorrectUnattempted  Question 14 of 16
14. Question
1 pointsIf there is a Turing machine M for a problem set P. M is applied to any problem in the set P and terminates when answer is “Yes” and may or may not terminate otherwise then P is
CorrectIncorrectUnattempted  Question 15 of 16
15. Question
1 pointsThe statement “A Turing machine con’t solve Halting problem” is
CorrectIncorrectUnattempted  Question 16 of 16
16. Question
1 pointsConsider the following problem X
Given a Turing machine M over the input alphabet ∑ any state of M and a word w∈∑, does the computation of M on w visit the state q?
Which of the following statements about X is correct?CorrectIncorrectUnattempted