3 votes 3 votes Given a flow graph with 10 nodes, 13 edges and one connected components, the number of regions and the number of predicate (decision) nodes in the flow graph will be 4, 5 5, 4 3, 1 13, 8 Compiler Design ugcnetcse-dec2013-paper3 compiler-design control-flow-graph + – go_editor asked Jul 27, 2016 • recategorized May 25, 2020 by Arjun go_editor 11.0k views answer comment Share Follow See 1 comment See all 1 1 comment reply Imarati Gupta commented Jul 27, 2016 reply Follow Share one shortcut from choice no of regions=no of predicate+1= cyclomatic complexity so choice B 5=(4)+1 1 votes 1 votes Please log in or register to add a comment.
5 votes 5 votes Predicate (decision) nodes are those nodes which has out degree atleast 2. Region =13-10+2 = 5 [i.e. edges - vertex + (p+1)] since p= 1] predicate nodes(P)= = region = P+1 = 5 P = 4 so (B) is ans. Prashant. answered Jul 27, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.
