0 votes 0 votes b = b + c d = b + d b = b – d e = d + b The minimum number of nodes and edges present in the DAG representation of above basic block respectively are ? 4 and 5 5 and 4 6 and 6 6 and 7 Compiler Design compiler-design code-optimization directed-acyclic-graph made-easy-test-series + – balraj_allam asked Jan 27, 2019 balraj_allam 2.3k views answer comment Share Follow See all 43 Comments See all 43 43 Comments reply Show 40 previous comments Shubhanshu commented Jan 25, 2019 reply Follow Share @Abhisek Tiwari 4 plz send the solution provided by them. 0 votes 0 votes Abhisek Tiwari 4 commented Jan 25, 2019 reply Follow Share Sol 0 votes 0 votes Shubhanshu commented Jan 27, 2019 reply Follow Share Refer - https://gateoverflow.in/299421/me_flt_cd#c299486 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes b = b + c d= b + d b= b - d e = d + b = d + b - d = b therefore, 6 nodes and 6 edges $ruthi answered Jan 30, 2018 $ruthi comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes by using first three equations make dag contains (6V,6E) and just reduce the last equation and get the final answer arun yadav answered Oct 9, 2020 arun yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
