The GATE Grind

GATE Compiler Design: Runtime Environments – Previous Year Questions

9 GATE previous year questions on Runtime Environments (Compiler Design, Computer Science) with answers and explanations, from every paper.

9 questions worth 12 marks in all (6 1-mark, 3 2-mark). Asked between 2008 and 2023, so you can see how the topic has been tested over time.

  1. GATE 2008 CS Q54 (2 marks, Multiple choice) – Which are true? I. A language without globals or nested procedures, but permitting recursion, can use static storage allocation. II. Multilevel access…
  2. GATE 2010 CS Q24 (1 mark, Multiple choice) – Which languages necessarily need heap allocation in their runtime environment?
  3. GATE 2012 CS Q46 (2 marks, Multiple choice) – In a lexically scoped block-structured language, main contains sibling procedures A1 and A2; A2 contains A21. A1 calls A2; A2 calls A21; A21 calls A1;…
  4. GATE 2014 CS (CS3) Q28 (1 mark, Multiple choice) – Which statements are correct? 1. Static allocation of all data areas by a compiler makes recursion impossible. 2. Automatic garbage collection is…
  5. GATE 2014 CS (CS2) Q28 (1 mark, Multiple choice) – Which is NOT performed during compilation?
  6. GATE 2018 CS Q18 (1 mark, Multiple choice) – Which one of the following statements is FALSE?
  7. GATE 2023 CS Q36 (2 marks, Multiple choice) – Consider the following program: Which one of the following options represents the activation tree corresponding to the main function?
  8. GATE 2021 CS (CS1) Q14 (1 mark, Multiple choice) – Consider the following statements. S 1: The sequence of procedure calls corresponds to a preorder traversal of the activation tree. S 2: The sequence…
  9. GATE 2020 CS Q19 (1 mark, Multiple choice) – Consider the following statements. I. Symbol table is accessed only during lexical analysis and syntax analysis. II. Compilers for programming…