Gujarat SET (GSET) Theory of Computation and Compilers Previous Year Questions
Try the preview and open any solution for a worked explanation.
Gujarat SET (GSET) practice pack
The practice pack for Gujarat SET (GSET) is coming soon to LawMint.
Question 1
Which one of the following grammars generates a regular language ?
Question 2
Which one of the following statements is false about NFAs ?
Question 3
Which statement accurately reflects the limitations of the Pumping Lemma in identifying regular languages ?
Question 4
Which of the following languages can NOT be recognized by any DFA, due to a structural requirement that exceeds finite memory ?
Question 5
Which of the following correctly classifies L = {aibj | i ≠ j} ∪ {anbncn | n ≥ 0} ?
Question 6
A PDA is designed to accept the language { anbncm | n, m ≥ 0 }. What type of stack operations are necessary ?
Question 7
For the statement a = b + c * d, which of the following is a valid three-address code representation ?
Question 8
A single-tape Turing Machine is given a string of the form w#w, where w ∈ {0, 1}*. What must the TM do to verify whether both parts are identical ?
Question 9
Which of the following illustrates a transformation of a known undecidable problem into another, thereby proving the new problem undecidable ?
Question 10
Suppose a grammar contains left recursion and common prefixes. Which parsing strategy would most likely fail without grammar transformation ?
Previous papers with Theory of Computation and Compilers questions
Gujarat SET (GSET) practice pack
The practice pack for Gujarat SET (GSET) is coming soon to LawMint.