1,403 views
1 votes
1 votes
Consider the following code segment.

x = u – t;

y = x * v;

x = y + w;

y = t – z;

y = x * y;

2 Answers

Best answer
5 votes
5 votes

I think no optmization can be done

selected by
2 votes
2 votes
As per my knowledge DAG is a part of Code Optimization in Compiler Design which is no longer in Syllabus!

Related questions

3 votes
3 votes
1 answer
1
2 votes
2 votes
1 answer
2
6 votes
6 votes
0 answers
3
srestha asked Jan 4, 2018
1,147 views
Consider C program given belowmain() { a=a+b; c=a*c; d=c-d; a=c/d; printf("%d",a); }What will the minimum number of nodes and edge present in the DAG representation of th...
1 votes
1 votes
1 answer
4