MCQ Computer Science
Automata Theory Multiple Choice Question & Answers (MCQs) set-13
1. Under which of the following operation, NFA is not closed? a) Negation b) Kleene c) Concatenation d) None of…
Read More »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…
Read More »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)…
Read More »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…
Read More »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…
Read More »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)…
Read More »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)…
Read More »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…
Read More »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…
Read More »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…
Read More »