Question

[Verification and Validation]

The function
maxOf Min(int[]] arr)
is supposed to find the maximum of the row-wise minimum values of the integers in the given 2D-array , i.e.

$maxOfMin(arr)=\underset{0\: \leq\: j\: <\: arr.length}{Max} \left ( \underset{0\: \leq\: i\: <\: arr[j].length}{Min} \; \; \; arr[j][i] \right )$

The function should return -1 if the given array is empty or in case all rows in the array are empty. The program below contains an implementation of this function.

1) Draw a control flow graph for the program above.

2) Find a test suite which satisfies a highest degree of edge coverage on the graph given in 1).

Answer 1

import java.lang.*;

import java.util.*;

class MaxProg

{

int maxOfMin(int[][] arr)

{

int max,min;

max=-1;

for(int j=0;j<arr.length;j++)

{

if(arr[j].length==0)

{

continue;

}

else

{

min=arr[j][0];

}

int i=1;

while(i<arr[j].length)

{

if(min<=max)

break;

if(arr[j][i]<min)

{

min=arr[j][i];

}

i++;

}

if(min>max)

max=min;

}

return max;

}

}

class max_min

{

public static void main(String args[])

{

int arr[][]={{3,2,1},{},{5,6,4},{1,2,3}};

MaxProg d=new MaxProg();

System.out.println("max of min value is "+d.maxOfMin(arr));

}

}

  control flow graph is:

CWindows System321cmd.exe D20javac max_min-java D20 java max_min ax of min value is 4

eng tt y es yes Min max yes min anjJL min m ax Max : min

the best test suit was

{{3,2,1},{},{-1,2,3},{5,6,4}}

in the above test suit we are giving last elements as small element,so loop will continue until the last element in every row.

we are using an empty row ,so continue will work in the above flow graph.

in the third row we are using -1, so min value is equal to default max value so break statement will work.

and finally max element in the all minimum elements is place in last row. it will check for all the pridicates in the flow graph.