I am not understanding question 34 on the GRE CS Practice Test Form GR0329. The question asks "What is the expected number of times that U executes?" where U is the entry node in the CFG in the question. The options are (A) 0.5, (B) 1, © 1.5, (D) 2, and (E) More than 10.
I remember covering CFGs when learning about cyclomatic complexity but I don't remember studying about CFGs having edges with execution-probabilities. Options (A) and © don't make any sense so I can ignore those. Since U is the first statement at the beginning of a "do...while" loop, it executes at least once. However, I don't know how to use the probabilities given to find the number of times U executes. How can I know the number times U executes without knowing the number of times the "do...while" loop executes?