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 |
Question 2
If L₁ is a regular language and L₂ is a context free language, which of the following statement is correct?
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.
Question 4
Which of the following statements is incorrect?
Question 5
The minimum state of DFA of the following would be the following:
Question 6
Consider the Following Context Free Grammar(G):
S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | xVariable={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?
Question 7
Consider the Following Context Free Grammar(G):
S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | xVariable={S, A, B, C, D}. Terminals={+,*,[,], x}.
Identify the correct statement from the following.
Question 8
Consider the Following Context Free Grammar(G):
S → A B
B → + A B | ε
A → C D
D → * C D | ε
C → [S] | xVariable={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?
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,
Question 10
The phase of a compiler that produces the parse tree and enters syntactic declaration structures into the symbol table is
Previous papers with Theory of Computation and Compilers questions
- UGC NET Computer Science 2026 06 22 Evening
- UGC NET Computer Science 2026 01 02 Morning
- UGC NET Computer Science 2025 06 26 Morning
- UGC NET Computer Science 2025 01 06
- UGC NET Computer Science 2024 08 23 Morning
- UGC NET Computer Science 2024 06 18
- UGC NET Computer Science 2023 12 07 Evening
- UGC NET Computer Science 2023 06 17 Morning
- UGC NET Computer Science 2023 03 15 Morning
- UGC NET Computer Science 2023 03 11 Evening
- UGC NET Computer Science 2022 10 08 Morning
- UGC NET Computer Science 2021 11 26 Evening
- UGC NET Computer Science 2020 11 11 Evening
- UGC NET Computer Science 2019 12 04 Morning
- UGC NET Computer Science 2019 06 24 Morning
- UGC NET Computer Science 2018 12 20 Morning
- UGC NET Computer Science 2018 07 Paper 2
- UGC NET Computer Science 2017 11 Paper 3
- UGC NET Computer Science 2017 11 Paper 2
- UGC NET Computer Science 2017 01 Paper 3
- UGC NET Computer Science 2017 01 Paper 2
- UGC NET Computer Science 2016 08 Paper 3
- UGC NET Computer Science 2016 08 Paper 2
- UGC NET Computer Science 2016 07 Paper 3
- UGC NET Computer Science 2016 07 Paper 2
- UGC NET Computer Science 2015 12 Paper 3
- UGC NET Computer Science 2015 12 Paper 2
- UGC NET Computer Science 2015 06 Paper 3
- UGC NET Computer Science 2015 06 Paper 2
- UGC NET Computer Science 2014 12 Paper 3
- UGC NET Computer Science 2014 12 Paper 2
- UGC NET Computer Science 2014 06 Paper 3
- UGC NET Computer Science 2014 06 Paper 2
- UGC NET Computer Science 2013 12 Paper 3
- UGC NET Computer Science 2013 12 Paper 2
- UGC NET Computer Science 2013 09 Paper 3
- UGC NET Computer Science 2013 09 Paper 2
- UGC NET Computer Science 2013 06 Paper 3
- UGC NET Computer Science 2013 06 Paper 2
- UGC NET Computer Science 2012 12 Paper 3
- UGC NET Computer Science 2012 12 Paper 2
- UGC NET Computer Science 2012 06 Paper 3
- UGC NET Computer Science 2012 06 Paper 2
- UGC NET Computer Science 2011 12 Paper 2
- UGC NET Computer Science 2010 12 Paper 2
- UGC NET Computer Science 2010 06 Paper 2
- UGC NET Computer Science 2009 12 Paper 2
- UGC NET Computer Science 2009 06 Paper 2
- UGC NET Computer Science 2008 06 Paper 2
- UGC NET Computer Science 2007 12 Paper 2
- UGC NET Computer Science 2007 06 Paper 2
- UGC NET Computer Science 2006 12 Paper 2
- UGC NET Computer Science 2006 06 Paper 2
- UGC NET Computer Science 2005 12 Paper 2
- UGC NET Computer Science 2005 06 Paper 2
- UGC NET Computer Science 2004 12 Paper 2
UGC NET Computer Science and Applications practice pack
The practice pack for UGC NET Computer Science and Applications is coming soon to LawMint.