(A) The number of regions – 1
(B) E – N + 1, where E is the number
of flow graph edges and N is the number of flow graph nodes.
(C) P – 1, where P is the number of
predicate nodes in the flow graph G.
(D) P + 1, where P is the number of
predicate nodes in the flow graph G.
Answer D
No comments:
Post a Comment
Note: only a member of this blog may post a comment.