. Draw a data flow graph for the binsearch() function given below. . Assuming that the...

Transcribed Image Text:

. Draw a data flow graph for the binsearch() function given below. . Assuming that the input array V [] has at least one element in it, find an infeasible path in the data flow graph for the binsearch() function. ⚫Find a set of complete paths satisfying the all-defs selection criterion with respect to variable mid. ⚫ Find a set of complete paths satisfying the all-defs selection criterion with respect to variable high. Implement your test cases using JUnit. int binsearch (int x, int V[], int n) { int low, high, mid; low 0; high n 1; while (low <- high) { mid (low + high)/2; if (XV[mid]) } high mid 1; else if (x > V[mid]) low mid 1; else return mid; return -1; Figure 1: binarySearch Method . Draw a data flow graph for the binsearch() function given below. . Assuming that the input array V [] has at least one element in it, find an infeasible path in the data flow graph for the binsearch() function. ⚫Find a set of complete paths satisfying the all-defs selection criterion with respect to variable mid. ⚫ Find a set of complete paths satisfying the all-defs selection criterion with respect to variable high. Implement your test cases using JUnit. int binsearch (int x, int V[], int n) { int low, high, mid; low 0; high n 1; while (low <- high) { mid (low + high)/2; if (XV[mid]) } high mid 1; else if (x > V[mid]) low mid 1; else return mid; return -1; Figure 1: binarySearch Method

Answer rating: 100% (QA)

Data Flow Diagram A dataflow diagram DFD is a graphicalrepresenta... View the full answer