(a) Draw a control-flow graph for the following program: int search (string A[], int N, string...

 

Transcribed Image Text:

(a) Draw a control-flow graph for the following program: int search (string A[], int N, string what) { int index = 0; if ((N == 1) && (A[0] what)) { return 0; } else if (N = 0) } { return -1; } else if (N> 1) { == while (index < N) } return -1; { if (A[index] } == else index++; what) { return index; } (b) Write test suits (i.e., sets of test cases) that provide statement and branch coverage over the code respectively. For each coverage criterion, please argue why your test suit meets the criterion. [Hint: for each test suite, you need to give at least one test case. Here for the test cases you only need to provide test inputs, but not test oracles, i.e., the expected outputs] (a) Draw a control-flow graph for the following program: int search (string A[], int N, string what) { int index = 0; if ((N == 1) && (A[0] what)) { return 0; } else if (N = 0) } { return -1; } else if (N> 1) { == while (index < N) } return -1; { if (A[index] } == else index++; what) { return index; } (b) Write test suits (i.e., sets of test cases) that provide statement and branch coverage over the code respectively. For each coverage criterion, please argue why your test suit meets the criterion. [Hint: for each test suite, you need to give at least one test case. Here for the test cases you only need to provide test inputs, but not test oracles, i.e., the expected outputs]

Answer rating: 100% (QA)

Answer a Controlflow graph CFG for the given program index 0 V N 1 A0 what V return 0 V N 0 ... View the full answer