Consider the following C code segment: a = b + c; e = a + 1; d = b + c; f = d…

GATE · 2021 · CS · Set 1 · Computer Science & IT

Consider the following C code segment:
    a = b + c;
    e = a + 1;
    d = b + c;
    f = d + 1;
    g = e + f;

In a compiler, this code segment is represented internally as a directed acyclic graph (DAG). The number of nodes in the DAG is _____________ .

Attempted by 46 students.