2013 June UGC NET Paper 1
November 18, 2023Question 8559 – Operating-Systems
November 18, 2023Compiler-Design
| Question 4 |
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 _______
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 _______
| 6 |
Correct Answer: A
Subscribe
Login
0 Comments