LawMint Sign in

Telangana SET (TG SET) Theory of Computation and Compilers Previous Year Questions

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

Telangana SET (TG SET) practice pack

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.

Question 1

Let L be a language over the alphabet {0,1}. Which one of the following statements is necessarily true if L satisfies the Pumping Lemma for Regular Languages?

Select one answer

Question 2

Machine-independent optimization in a compiler is primarily performed on which of the following?

Select one answer

Question 3

Let X be a recursive language and Y be a recursively enumerable but not recursive Language. In addition, let W and Z be two languages such that Y reduces to W, and Z reduces to X (reduction means the standard many-one reduction). Which one of the following statements is TRUE?

Select one answer

Question 4

Which one of the following statements about the Halting Problem is correct?

Select one answer

Question 5

Which one of the following types of grammars can be parsed using a predictive parser without backtracking?

Select one answer

Question 6

Consider the computational models listed in List I and the corresponding classes of languages they recognize listed in List II.

List I(Computational Model)List II (Language Class Recognized)
a. Finite State Machine (FSM)i. Regular Expressions
b. Push Down Automaton (PDA)ii. Context-Sensitive Languages
c. Linear Bounded Automaton (LBA)iii. Context Free Language
d. Turing machine (TM)iv. Recursively Enumerable Languages

Which one of the following gives the correct matching?

Select one answer

Question 7

Which of the following statements is true about LR(k) grammars?

Select one answer

Question 8

Consider the language [LL =anbncm∣n,m= a^n b^n c^m \mid n, m ≥0\geq 0]
Which computational model is the simplest that can recognize this language?

Select one answer

Question 9

A compiler generates the following intermediate code:

t1 = a + b
t2 = a + b
c = t1 + t2

Which optimization technique should be applied?

Select one answer

Question 10

Which of the following correctly represents the Chomsky Hierarchy of formal grammars from lowest to highest computational power?

Select one answer

Continue practising

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.

Telangana SET (TG SET) practice pack

The practice pack for Telangana SET (TG SET) is coming soon to LawMint.