# Recent posts tagged kvs-pgt

1
A normal DAG construction will give $8$ nodes and $10$ edges as shown below. Since, this question asks for minimum possible, we can assume algebraic simplification is allowed. So, $d = b + c, e = d - b$; can be simplified to $d = b + c$; $e = c$; ... $6$ edges. https://cs.nyu.edu/~gottlieb/courses/2000s/2006-07-fall/compilers/lectures/lecture-14.html [working link] Correct Answer: $A$
2
you got it rt?
To see more, click for the full list of questions or popular tags.