Loading previous year questions
Compiler Design · Local Optimisation
Official IIT answer key · IIT Kharagpur · Audited Aug 2026
GATE CSE 2014 Set 3 Q34 · MCQ · 2 marks
a = b + c
c = a + d
d = b + c
e = d - b
a = e + b
The minimum number of nodes and edges present in the DAG representation of the above basic block respectively areKey concept
No account needed
Sit 4 related Local OptimisationPYQs 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 GATE Compiler Design, the Code Optimization topic focuses on evaluating code transformations such as Common Sub-expression Elimination (CSE), Loop-Invariant Code Motion (LICM), and statement reordering under hardware constraints. Questions test the candidate's ability to analyze variable liveness, register pressure, and the dynamic operation count of optimized code segments.
Full Local Optimisation guide →Consider the basic block given below. a = b + c c = a + d d = b + c e = d - b a = e + b The minimum number of nodes and edges present in the DAG representation of the above basic block respectively are
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.