Compiler Design · Runtime Environments
Official IIT answer key · IIT Delhi · Audited Aug 2026
GATE CSE 2012 Q36 · MCQ · 2 marks
Program main;
Var ...
Procedure A1;
Var ...
Call A2;
End A1
Procedure A2;
Var ...
Procedure A21;
Var ...
Call A1;
End A21
Call A21;
End A2
Call A1;
End main.
Consider the calling chain: Main → A1 → A2 → A21 → A1
The correct set of activation records along with their access links is given byKey concept
No account needed
Sit 5 related Runtime EnvironmentsPYQs as a guest. We'll score the set and show which traps cost marks — sign in only if you want to save the run.
Topic notes
In Compiler Design, GATE tests Runtime Environments through conceptual and tracing questions on activation records, procedure activation trees, runtime memory allocation strategies (static vs. stack vs. heap), and scoping rules combined with parameter-passing mechanisms. Questions alternate between 1-mark theoretical concept validation (e.g., requirements for recursion, activation tree traversals) and 2-mark procedural traces (e.g., determining static access links, program output under dynamic scoping, and activation tree construction).
Full Runtime Environments guide →Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted. Program main; Var ... Procedure A1; Var ... Call A2; End A1 Procedure A2; Var ... Procedure A21; Var ... Call A1; End A21 Call A21; End A2 Call A1; End main. Consider the calling chain: Main A1 A2 A21 A1 The correct set of activation records along with their access links is given by
Topic-wise GATE CS PYQs with verified steps
Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.