Design path-complete test cases for each of the programs below. (a) (b) int max(int x, int...

 

Transcribed Image Text:

Design path-complete test cases for each of the programs below. (a) (b) int max(int x, int y, int z) { if (x>y) if (x>2) return x; else return z; if (y>z) return y; else return z; } while(x>0){ if (y<0) {do something and then break; } do something; X--; y--; Design path-complete test cases for each of the programs below. (a) (b) int max(int x, int y, int z) { if (x>y) if (x>2) return x; else return z; if (y>z) return y; else return z; } while(x>0){ if (y<0) {do something and then break; } do something; X--; y--;

Answer rating: 100% (QA)

Creating pathcomplete test cases involves covering all the ... View the full answer