LawMint Sign in

Rajasthan SET (RSET) Theory of Computation and Compilers Previous Year Questions

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

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Question 1

During the compilation process, which stage is responsible for grouping characters into meaningful sequences called tokens ?

Select one answer

Question 2

The class of computational problems that can be solved in polynomial time by a deterministic Turing machine is designated as :

Select one answer

Question 3

The set of all strings over an alphabet Σ is represented by :

Select one answer

Question 4

A Grammar is classified as ambiguous if it can produce which structural anomaly for a Single String ?

Select one answer

Question 5

Assertion (A) : Every context-free language over {a, b} can be accepted by a PDA with three states. Reason (R) : A standard PDA construction uses one initialization state, one processing state and one accepting state.

Select one answer

Question 6

When are two machines considered equivalent in power ?

Select one answer

Question 7

If an NDFA has N states, what is the maximum possible number of states in the equivalent DFA after applying the subset construction algorithm ?

Select one answer

Question 8

Which of the following statements is FALSE regarding the computational power of DFAs and NDFAs ?

Select one answer

Question 9

What does the term “data-flow analysis” refer to ?

Select one answer

Question 10

What is the primary goal of peephole optimization ?

Select one answer

Continue practising

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.

Rajasthan SET (RSET) practice pack

The practice pack for Rajasthan SET (RSET) is coming soon to LawMint.