LawMint Sign in

Maharashtra and Goa SET (MH SET) Theory of Computation and Compilers Previous Year Questions

Try the preview and open any solution for a worked explanation.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Question 1

In peephole optimization, constant folding involves :

Select one answer

Question 2

Which of the following best describes the relationship between activation records and the call stack ?

Select one answer

Question 3

In an L-attributed grammar, synthesized attributes are calculated using attributes from :

Select one answer

Question 4

If A is a top-down parser and B is a bottom-up parser, which of the following statements is false ?

Select one answer

Question 5

The language LL ={anbncn:n= \{a^n b^n c^n : n ≥1}\ge 1\} is a context-sensitive language. Give a context-sensitive grammar for L :

Select one answer

Question 6

Let F be a family of recursively enumerable languages and let LFL_F ={⟨M⟩:L(M)∈F}=\{\langle M\rangle:L(M)\in F\}, where M is a Turing machine. LFL_F is recursively enumerable iff F satisfies which of the following conditions ?
(1) If L is in F and L ⊆ L' for some recursively enumerable language L', then L' is in F (containment property).
(2) If L is an infinite language in F, then there is a finite subset of L which is in F.
(3) The set of finite languages in F is enumerable.

Select one answer

Question 7

Let P1 be the problem of finding a Hamiltonian cycle in a graph G and P2 be the problem of determining if a Hamiltonian cycle exists in a graph. Which one of the following is true ?

Select one answer

Question 8

Determine the language accepted by the following FA:
Finite automaton, no accepting states marked. Start state q0. Transitions q0 on 1 to q0 and on 0 to q1; q1 on 1 to q0 and on 0 to q2; q2 on 0 to q3 and on 1 to q4; q3 on 0 or 1 to q3; q4 on 1 to q4 and on 0 to q1.

Select one answer

Question 9

Give regular expression for the language that contains all strings with at least one occurrence of each symbol in Σ = {a, b, c} in that order.

Select one answer

Question 10

Let L1 and L2 be languages on the same alphabet. Then the right quotient of L1 with L2 is defined as :

Select one answer

Continue practising

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.

Maharashtra and Goa SET (MH SET) practice pack

The practice pack for Maharashtra and Goa SET (MH SET) is coming soon to LawMint.