My Courses
Automata Theory Multiple Choice Question & Answers (MCQs) set-12
1. The password to the admins account=”administrator”. The total number of states required to make a password-pass system using DFA would be __________ a) 14 states b) 13 states c) 12 states d) A password pass system cannot be created using DFA 2.Let u=’1101’, v=’0001’, then uv=11010001 and vu= 00011101.Using the given information what is…
Automata Theory Multiple Choice Question & Answers (MCQs) set-11
1. Which of the following does not belong to input alphabet if S={a, b}* for any language? a) a b) b c) e d) none of the mentioned 2. Which of the given are correct? a) Moore machine has 6-tuples b) Mealy machine has 6-tuples c) Both Mealy and Moore has 6-tuples d) None of…
Automata Theory Multiple Choice Question & Answers (MCQs) set-10
1. Which of the following is an utility of state elimination phenomenon? a) DFA to NFA b) NFA to DFA c) DFA to Regular Expression d) All of the mentioned 2. Regular expression {0,1} is equivalent to a) 0 U 1 b) 0 / 1 c) 0 + 1 d) All of the mentioned 3.…
Automata Theory Multiple Choice Question & Answers (MCQs) set-9
1. Which among the following is smallest for n=50 a) 2n2 b) n2+3n+7 c) n3 d) 2n 2. It is less complex to prove the closure properties over regular languages using: a) NFA b) DFA c) PDA d) Can’t be said 3. For a give Moore Machine, Given Input=’101010’, thus the output would be of…
Automata Theory Multiple Choice Question & Answers (MCQs) set-8
1. The class of recursively ennumerable language is known as: a) Turing Class b) Recursive Languages c) Universal Languages d) RE 2. A multitape turing machine is ________ powerful than a single tape turing machine. a) more b) less c) equal d) none of the mentioned 3. State true or false: Statement: Multitape turing machine…
Automata Theory Multiple Choice Question & Answers (MCQs) set-7
1. If two sets, R and T has no elements in common i.e. RÇT=Æ, then the sets are called a) Complement b) Union c) Disjoint d) Connected 2. Which among the following is not a part of the Context free grammar tuple? a) End symbol b) Start symbol c) Variable d) Production 3. A PDA…
Automata Theory Multiple Choice Question & Answers (MCQs) set-6
1. Which kind of proof is used to prove the regularity of a language? a) Proof by contradiction b) Direct proof c) Proof by induction d) None of the mentioned 2. The language of balanced paranthesis is a) regular b) non regular c) may be regular d) none of the mentioned 3. If L1′ and…
Automata Theory Multiple Choice Question & Answers (MCQs) set-5
1. If the number of steps required to solve a problem is O(nk), then the problem is said to be solved in: a) non-polynomial time b) polynomial time c) infinite time d) none of the mentioned 2. The hardest of NP problems can be: a) NP-complete b) NP-hard c) P d) None of the mentioned…
Automata Theory Multiple Choice Question & Answers (MCQs) set-4
1. A turing machine has ____________ number of states in a CPU. a) finite b) infinte c) May be finite d) None of the mentioned 2. 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…
Automata Theory Multiple Choice Question & Answers (MCQs) set-3
1. Moore Machine is an application of: a) Finite automata without input b) Finite automata with output c) Non- Finite automata with output d) None of the mentioned 2. The non- Kleene Star operation accepts the following string of finite length over set A = {0,1} | where string s contains even number of 0…