1. Are Multitape and Multitrack turing machines same? a) Yes b) No c) Somewhat yes d) Cannot tell 2. Complete the following statement: Statement : A language is turing recognizable if an only if ___________ a) an enumerator enumerates it b) it is finite c) both (a) and (b) d) …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-48

1. Which of them have XML as their default format? a) IWork b) LibreOffice c) OpenOffice d) All of the mentioned Answer: d Explanation: More that hundred of document formats using XML syntax have been developed, including RSS, Atom, SOAP and XHTML. 2. Which of the following is an example …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-47

1. A DTD is associated with a XML file by means of ___________ a) Function b) <!DOCTYPE> c) Macros d) None of the mentioned 2. A push down automaton with only symbol allowed on the stack along with fixed symbol. a) Embedded PDA b) Nested Stack automata c) DPDA d) …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-45

1. What does NP stands for in complexity classes theory? a) Non polynomial b) Non-deterministic polynomial c) Both (a) and (b) d) None of the mentioned 2. A ___________ is a multi tape turing machine whose input tape is read only. a) Counter Machine b) Multi-stack c) Alternating Turing machine …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-44

1. Which of the expressions correctly is an requirement of the pumping lemma for the context free languages? a) uvnwxny b) uvnwnxny c) uv2nwx2ny d) All of the mentioned 2. Which of the following is/are not an application of turing machine? a) Language Recognization b) Computers of functions on non …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-43

1. X is a simple mathematical model of a computer. X has unrestricted and unlimited memory. X is a FA with R/W head. X can have an infinite tape divided into cells, each cell holding one symbol. Name X? a) Push Down Automata b) Non deterministic Finite Automata c) Turing …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-42

1. Which of the given problems are NP-complete? a) Node cover problems b) Directed Hamilton Circuit Problem c) Both (a) and (b) d) None of the mentioned 2. Give a classic example of the concept of turing complete. a) lambda calculus b) C++ c) Lisp d) All of the mentioned …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-41

1. A language L is said to be Turing decidable if: a) recursive b) TM recognizes L c) TM accepts L d) None of the mentioned 2. State true or false: Statement: The operations of PDA never work on elements, other than the top. a) true b) false 3. Which …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-40

1. The use of variable dependency graph is in: a) Removal of useless variables b) Removal of null productions c) Removal of unit productions d) None of the mentioned 2. Given Grammar G: S->aA A->a| A B->B The number of productions to be removed immediately as Unit productions: a) 0 …

Read More »## Automata Theory Multiple Choice Quaestion & Answers (MCQs) set-39

1. Which of the following is called Bar-Hillel lemma? a) Pumping lemma for regular language b) Pumping lemma for context free languages c) Pumping lemma for context sensitive languages d) None of the mentioned 2. Which of the following does not have left recursions? a) Chomsky Normal Form b) Greibach …

Read More »