Study the code below carefully to answer the following questions: a) Draw the CFG? b) Calculate...

 

Transcribed Image Text:

Study the code below carefully to answer the following questions: a) Draw the CFG? b) Calculate the total number of candidate paths? C) Name all the candidate paths. d) Is T adequate using the path coverage criterion? Show full analysis T={t1: x=50, EO="it is even", t2: x=23, EO="it is odd", t3: x="", EO="unexpected error"} int x; input(x); while(x<100) {if(x%2==0) { int p=0; } else {p=1; } Switch (p) { case 0: println("it is even"); case 1: println("it is odd"); default: println("unexpected error"); ( } x++; } Study the code below carefully to answer the following questions: a) Draw the CFG? b) Calculate the total number of candidate paths? C) Name all the candidate paths. d) Is T adequate using the path coverage criterion? Show full analysis T={t1: x=50, EO="it is even", t2: x=23, EO="it is odd", t3: x="", EO="unexpected error"} int x; input(x); while(x<100) {if(x%2==0) { int p=0; } else {p=1; } Switch (p) { case 0: println("it is even"); case 1: println("it is odd"); default: println("unexpected error"); ( } x++; }

Answer rating: 100% (QA)

Based on the image youve provided which contains a snippet of pseudocode lets step through each of the questions asked a Draw the Control Flow Graph CFG A CFG for this code would look something like t... View the full answer