
KS5 Model of Computation FSM and Turing Machines
Authored by David Dodwell-Bennett
Computers
12th Grade
Used 3+ times

AI Actions
Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...
Content View
Student View
10 questions
Show all answers
1.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following combinations is NOT accepted?
abb
bba
bab
abcabb
2.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following combinations is accepted?
bacc
baab
baabca
aabca
3.
MULTIPLE CHOICE QUESTION
3 mins • 1 pt
For the input sequence of 10110, what is the state sequence?
ABABCD
ABABAA
ABAACD
BABCDA
4.
MULTIPLE CHOICE QUESTION
3 mins • 1 pt
What is the output sequence for the input sequence 11011010?
00110110
10000100
00010011
00010010
5.
MULTIPLE CHOICE QUESTION
3 mins • 1 pt
For the input sequence of 0001110, what is the state sequence?
AAABBBC
AAABCCD
ABBCCDA
AABCDAB
6.
MULTIPLE CHOICE QUESTION
30 sec • 1 pt
The transition functions of a Turing machine are in what format?
𝛿 (current state, input symbol) = (output symbol, next state, movement)
𝛿 (current state, output symbol) = (next state, input symbol, movement)
𝛿 (next state, output symbol) = (current state, input symbol, movement)
𝛿 (current state, input symbol) = (next state, output symbol, movement)
7.
MULTIPLE CHOICE QUESTION
2 mins • 1 pt
Which of the following represents one of the transition functions of this Turing machine?
𝛿 (A, 0) = (B, 1, R)
𝛿 (B, 1) = (B, 0, R)
𝛿 (B, 0) = (C, 1, L)
𝛿 (C, 1) = (C, 0, R)
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 Classlink

Continue with Clever
or continue with

Microsoft
%20(1).png)
Apple
Others
Already have an account?