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
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 |
Question 3
The number of states in a minimal deterministic finite automaton corresponding to the language L = {an | n ≥ 4} is
Question 4
One of the purposes of using intermediate code in compilers is to :
Question 5
A regular expression that denotes a language comprising all possible strings of even length over the alphabet (0,1) is :-
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):-
Question 7
Given the language L = { ab, aa, baa} which of the following strings is not in L* ?
Question 8
If L1 is context free language and L2 is regular language than L1 ∩ L2 is :-
Question 9
In context of problem classes, which of following statement is not valid :-
Question 10
Let L1 is an NP - complete problem, another problem L2 will also be an NP-complete problem if :-
Previous papers with Theory of Computation and Compilers questions
RPSC Assistant Professor (College Education) practice pack
The practice pack for RPSC Assistant Professor (College Education) is coming soon to LawMint.