LawMint Sign in

RPSC Assistant Professor (College Education) Theory of Computation and Compilers Previous Year Questions

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

RPSC Assistant Professor (College Education) practice pack

The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.

Question 1

The logic of pumping lemma is a good example of :
Select one answer

Question 2

Match the following :

(i) Regular Grammar(a) Pushdown automaton
(ii) Context free Grammar(b) Linear bounded automaton
(iii) Unrestricted Grammar(c) Deterministic finite automaton
(iv) Context Sensitive Grammar(d) Turing machine
Select one answer

Question 3

The number of states in a minimal deterministic finite automaton corresponding to the language L = {an | n ≥ 4} is

Select one answer

Question 4

One of the purposes of using intermediate code in compilers is to :

Select one answer

Question 5

A regular expression that denotes a language comprising all possible strings of even length over the alphabet (0,1) is :-

Select one answer

Question 6

Choose the statement that best defines the relationship among type-0 Language (Lo), context free language (Lcf) , regular languages(Lr) and context-sensitive language(Lcs):-

Select one answer

Question 7

Given the language L = { ab, aa, baa} which of the following strings is not in L* ?

Select one answer

Question 8

If L1 is context free language and L2 is regular language than L1 ∩ L2 is :-

Select one answer

Question 9

In context of problem classes, which of following statement is not valid :-

Select one answer

Question 10

Let L1 is an NP - complete problem, another problem L2 will also be an NP-complete problem if :-

Select one answer

Continue practising

The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.

RPSC Assistant Professor (College Education) practice pack

The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.