Theory of Computation and Compilers – Previous Year Questions
250 questions from past UGC NET Paper 2 – Computer Science papers, each with the correct answer. Open any question for its explanation.
Topic-wise mock tests
- Match the following based on the lengths of strings in the language accepted (using the brute-force method of parsing). Choose the correct answer from the options given below:List I List II a. S → aSa | aa I. ((2n × 3)…
- What is the safest order for simplifying a context-free grammar?
- What is the move in the cell numbered M1 of the table?
- What is the move in the cell numbered M2 of the table?
- What is the move in the cell numbered M3 of the table?
- What is the move in the cell numbered M4 of the table?
- What is the move in the cell numbered M5 of the table?
- The reduced grammar equivalent to the grammar whose production rules are given below is S → AB | CA B → BC | AB A → a C → aB | b
- Consider the production rules of grammar G: S → AbB A → aAb | λ B → bB | λ Which language L is generated by G?
- Consider the language L = {anbm : n ≥ 4, m ≤ 3}. Which regular expression represents L?
- Consider L = {ab, aa, baa}. Which of the following strings is NOT in L*?
- Consider the NPDA M = ({q0, q1, qf}, {a, b}, {1, z}, δ, q0, z, {qf}) with δ(q0, λ, z) = {(qf, z)} δ(q0, a, z) = {(q1, 11z)} δ(q1, a, 1) = {(q1, 111)} δ(q1, b, 1) = {(q1, λ)} δ(q1, λ, z) = {(qf, z)} Which language L is a…
- Consider two instances X and Y of the Post Correspondence Problem, each with lists A and B of three strings over {0, 1}. Which of the following is true?X i List A List B 1 1 111 2 10111 10 3 10 0 Y i List A List B 1 10…
- Consider the following properties of recursively enumerable sets: (A) Finiteness (B) Context-freedom (C) Emptiness Which of the following is true?
- Consider the grammar S → SbS | a and the string abababa. Consider the statements: the string has (A) two parse trees (B) two leftmost derivations (C) two rightmost derivations Which of the following is correct?
- Match List I with List II. Choose the correct answer from the options given below:List I List II A. Type 0 I. Finite automata B. Type 1 II. Turing machine C. Type 2 III. Linear bounded automata D. Type 3 IV. Pushdown au…
- Consider the following statements: Statement I: An LALR parser is more powerful than a canonical LR parser. Statement II: An SLR parser is more powerful than LALR. Which of the following is correct?
- Consider the following statements about context-free languages (CFL): Statement I: CFLs are closed under homomorphism. Statement II: CFLs are closed under complement. Which of the following is correct?
- Match List – I with List – II. List – I (Propositions) (A) P ∧ (P → Q) (B) ¬(P ∨ Q) → (P ∧ Q) (C) P → Q (D) P ∨ (Q ∧ R) List – II (Disjunctive Normal Form) (I) P ∨ Q (II) (P ∧ ¬P) ∨ (P ∧ Q) (III) (¬P) ∨ Q (IV) (P ∧ P) ∨…
- Overfitting is expected when we observe that?
- Mr X designed open source software which must comply with some criteria. Choose the false statement in respect of above. (A) No restriction on redistribution of the software as part or whole (B) The integrity of the aut…
- Match List (I) with List (II): List I A. Product Complexity B. Structured System Analysis C. Coupling & cohesion D. Symbolic Execution List II I. System Requirements Design II. Software design III. Validation techniques…
- Suppose a cloud contains software stack such as Operating System, Application software, etc. This model is referred as _____ model.
- Which one of the following is not typically provided by Source Code Management Software?
- Which of the following super computers is the fastest?
- Which of the following statements about ERP system is true?
- Which of the following is not a Clustering method?
- Which of the given wireless technologies used in IoT, consumes the least amount of power?
- The distributed system is a collection of (P) and communication is achieved in a distributed system by (Q), where (P) and (Q) are:
- Which of the following statements is incorrect for Parallel Virtual Machine (PVM)?