Automata Theory Programming Techniques Storage Subroutines Online Exam Quiz
Automata Theory Programming Techniques Storage Subroutines GK Quiz. Question and Answers related to Automata Theory Programming Techniques Storage Subroutines. MCQ (Multiple Choice Questions with answers about Automata Theory Programming Techniques Storage Subroutines
Suppose we have a simple computer with control unit holding a PC with a 32 bit address + Arithmetic unit holding one double length 64 bit Arithmetic Register. The number of states the finite machine will hold:
Options
A : 2(32*64)
B : 296
C : 96
D : 32
In one move a turing machine will:
Options
A : Change a state
B : Write a tape symbol in the cell scanned
C : Move the tape head left or right
D : All of the mentioned
A turing machine has ____________ number of states in a CPU.
Options
A : finite
B : infinte
C : May be finite
D : None of the mentioned
A multi track turing machine can described as a 6-tuple (Q, X, S, d, q0, F) where X represents:
Options
A : input alphabet
B : tape alphabet
C : shift symbols
D : none of the mentioned
Which of the following is/are not true for recursively ennumerable language?
Options
A : partially decidable
B : Turing acceptable
C : Turing Recognizable
D : None of the mentioned
According to Chomsky hierarchy, which of the following is adopted by Recursively Ennumerable language?
Options
A : Type 0
B : Type 1
C : Type 2
D : Type 3
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Automata Theory Operators Regular Expression
Automata Theory Pda Acceptance Empty Stack
Automata Theory Polynomial Space Turing Machine
Automata Theory Pumping Lemma Regular Language
Automata Theory Questions Bank