LawMint Sign in

UGC NET Computer Science and Applications Theory of Computation and Compilers Previous Year Questions

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

UGC NET Computer Science and Applications practice pack

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.

Question 1

Match the LIST-I with LIST-II

LIST-I
Language
LIST-II
Type of Language
A. L₁={aⁿbᵐ | n, m≥0}I. Unrestricted
B. L₂={aⁿbᵐ |(n=m)≥0}II. Context Sensitive
C. L₃={aⁿbⁿcⁿdⁿeⁿ | n≥1}III. Regular
D. L₄={aⁿbⁿcᵐdⁿe² | n, m≥0}IV. Context Free
Select one answer

Question 2

If L₁ is a regular language and L₂ is a context free language, which of the following statement is correct?

Select one answer

Question 3

Arrange the following families of languages from specialization to generalization, defined over alphabetΣ:

  • A. Family of all regular languages.
  • B. Family of all Turing acceptable languages.
  • C. Family of all Turing decidable languages.
  • D. Family of all context free languages.
Select one answer

Question 4

Which of the following statements is incorrect?

Select one answer

Question 5

The minimum state of DFA of the following would be the following:

Embedded diagram; all labels are within the figure
Select one answer

Question 6

Consider the Following Context Free Grammar(G):

S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | x

Variable={S, A, B, C, D}. Terminals={+,*,[,], x}.

In the LL(1)Parsing table of the given CFG, how many valid non blank entities will be there in the rows for variables B and D?

Select one answer

Question 7

Consider the Following Context Free Grammar(G):

S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | x

Variable={S, A, B, C, D}. Terminals={+,*,[,], x}.

Identify the correct statement from the following.

Select one answer

Question 8

Consider the Following Context Free Grammar(G):

S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | x

Variable={S, A, B, C, D}. Terminals={+,*,[,], x}.

The I₀ state of the canonical LR(0)set of the SLR(1)parser of this CFG has how many productions?

Select one answer

Question 9

Let P and Q be two regular expressions over Σ. If P does not contain ε, then the following equation in R namely, R=Q+RP has a unique solution given by,

Select one answer

Question 10

The phase of a compiler that produces the parse tree and enters syntactic declaration structures into the symbol table is

Select one answer

Continue practising

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.

UGC NET Computer Science and Applications practice pack

The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.