int binsearch (int X , int V [] , int n ) { int low , high , mid , i ; low = 0; high = n - 1; for ( i = 0; i < high ; i ++) { if( V[ i ] > V [ i +1]) return -2; } while ( low <= high ) { mid = ( low + high )/2; if ( X < V [ mid ]) high = mid - 1; else if ( X > V [ mid ]) low = mid + 1; else return mid ; } return -1; } This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1. 1. Draw a CFG for binsearch(). 2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion. 3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. 4. For each path identified above, derive their path predicate expressions.

int binsearch (int X , int V [] , int n ) { int low , high , mid , i ; low = 0; high = n - 1; for ( i = 0; i < high ; i ++) { if( V[ i ] > V [ i +1]) return -2; } while ( low <= high ) { mid = ( low + high )/2; if ( X < V [ mid ]) high = mid - 1; else if ( X > V [ mid ]) low = mid + 1; else return mid ; } return -1; } This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1. 1. Draw a CFG for binsearch(). 2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion. 3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion. 4. For each path identified above, derive their path predicate expressions.

Related questions

Q: int nums[] = {7,2,5,6,7,2,3,4,6}; int target = 12; int loc = 0; int iterations = 0; boolean found =…

A: Value of loc = 9 when print the value of loc

Q: Multiples(): Takes an int (n) as parameter and prints first 10 multiples n in a single line using…

A: Introduction of Program: The Java program takes a number as input from the user and then the program…

Q: class TenNums { private: int *p; public: TenNums

A: Dear Student, The answer to your question is given below -

Q: - B.width; } { t = B.type; w = { T.type = C.type; T.width = C.width; } T → B C В — int { B.type =…

A: Only values are given. what exactly needs to be done here?

Q: C++ Code /////// #include class BTNode { public: int item; BTNode *left; BTNode *right;…

A: CODE: // Function to create a new binary tree node having given key BTNode* newBTNode(int key) {…

Q: Counting the number of 1 bits in a bit string s can be accomplished in Java by first initializing an…

A: The answer is given below.

Q: fun

A: Coded using Javascript.

Q: // Assume all libraries are included void QQ(int n); // int main () { // Random questions QQ (5) ; 3…

A: this program in c++ it bascially call function QQ(5); QQ ( int n ) this function checks if…

Q: Why does little-endian vs. big-endian matter here in this code

A: *In case of multiple questions, only the first will be answered. For other questions, put separate…

Q: using System; class Program { publicstaticvoid Main(string[] args) { int number = 1,i; while…

A: Required: how can this program be fixed to choose three random numbers in C# between 1-88…

Q: typedef struct { short data[4];} MatrixElement; void copy_matrix(MatrixElement m1[],…

A: To solve these problems, we need to understand how the data is laid out in memory and how the cache…

Q: for (i = 0; i < 2; ++i) { a = i* 20; ecrire (a); } lire (b);

A: we have the given functions of which the definitions are not provided in the given code above:…

Q: extern "C" int f(int *,int,int); int a[2][2] = {{11,12},{21,22}}; void setup() {…

A: This code is an example of an Arduino sketch written in C/C++ language, which makes use of assembly…

Q: 2. Modify the method in Question 1 so that the item with the highest key is not only returned by the…

A: I think the given code is correct, the problem with the code is that it is not displaying the output…

Q: f : {1, 2, 3} ® {a, b, c, d} f(1) = c f(2) = b f(3) = a g : {a, b, c, d} ® {x, y, z} g(a) = y g(b) =…

A: The answer is given below:-

Q: What Is printed when the code Is executed? Note that the println method takes multiple arguments…

A: mystery(arrA, arrB) - It uses the call by value approach which means any changes on the formal…

Concept explainers

Concept of memory addresses in pointers

The concept of pointers in high-level languages was introduced in C programming. Pointers are simply the variables that are used to store memory addresses of another variable. These special variables are generally used in the languages such as C Programming and C++ Programming, where it allows the programmer to work more deeply with memory and its addresses.

Question

int binsearch (int X , int V [] , int n )

{

int low , high , mid , i ;

low = 0;

high = n - 1;

for ( i = 0; i < high ; i ++)

{

if( V[ i ] > V [ i +1])

return -2;

}

while ( low <= high )

{

mid = ( low + high )/2;

if ( X < V [ mid ])

high = mid - 1;

else

if ( X > V [ mid ])

low = mid + 1;

else

return mid ;

}

return -1;

}

This code takes as input a sorted array V of size n, and an integer X, if X exists in the array it will return the index of X, else it will return -1.

1. Draw a CFG for binsearch().

2. From the CFG, identify a set of entry–exit paths to satisfy the complete statement coverage criterion.

3. Identify additional paths, if necessary, to satisfy the complete branch coverage criterion.

4. For each path identified above, derive their path predicate expressions.

5. Solve the path predicate expressions to generate test input and compute the corresponding expected outcomes.

6. Are all the selected paths feasible? If not, select and show that a path is infeasible, if it exists.

7. Can you introduce two faults in the routine so that these go undetected by your test cases designed for complete branch coverage?

8. Suggest a general way to detect the kinds of faults introduced in the previous step.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1: Diagram for CFG :

VIEW

Step 2: identify a set of entry–exit path:

VIEW

Solution

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 1 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, data-structures-and-algorithms and related others by exploring similar questions and additional content below.

Similar questions

mkfifo("mypipe"); if (!fork()) { fp = popen("echo 37 > mypipe", "w"); %D status = pclose(fp); } else { printf("14"); sleep(1); fp = popen("cat mypipe", "r"); fgets(buffer, buffer_size, fp); printf("%s", buffer); status = pclose(fp); %3D } Consider the above code fragment, what's the output to stdout?
#include <stdio.h> int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key); int *joinArray(int arrA[], int arrB[]) { int j = 0; if ((arrB[0] + arrB[4]) % 5 == 0) { arrB[0] = 0; arrB[4] = 0; } for (int i = 0; i < 5; i++) { arrC[j++] = arrA[i]; if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1)) { continue; } else arrC[j++] = arrB[i]; } for (int i = 0; i < j; i++) { int temp; for (int k = i + 1; k < j; k++) { if (arrC[i] > arrC[k]) { temp = arrC[i]; arrC[i] = arrC[k]; arrC[k] = temp; } } } for (int i = 0; i < j; i++) { printf("%d ", arrC[i]); } return arrC; } int bSearch(int arr[], int l, int h, int key) { if (h >= l) { int mid = l + (h - l) / 2; if…
int sum = 0; for (int i 0; i < 5; i++){ sum += i; } cout << sum;
int X[10]={2,0,6,11,4,5,9,11,-2,-1); From the code above, what is the value of X[8] ?
rewite usung for loop
Rooks on a rampage def safe_squares_rooks(n, rooks): A generalized n-by-n chessboard has been invaded by a parliament of rooks, each rook represented as a two-tuple (row, column) of the row and the column of the square that the rook is in. Since we are again computer programmers instead of chess players and other normal folks, our rows and columns are numbered from 0 to n - 1. A chess rook covers all squares that are in the same row or in the same column. Given the board size n and the list of rooks on that board, count the number of empty squares that are safe, that is, are not covered by any rook. To achieve this in reasonable time and memory, you should count separately how many rows and columns on the board are safe from any rook. Because permuting the rows and columns does not change the answer to this question, you can imagine all these safe rows and columns to have been permuted to form an empty rectangle at the top left corner of the board. The area of that safe rectangle is…
#include <stdio.h> struct Single { int num; }; void printSingle(int f) { int binaryNum[33]; int i = 0; while(f>0) { binaryNum[i] = f % 2; f = f/2; i++; } for (int j=i-1; j>= 0; j--) { printf("%d",binaryNum[j]); } } int main() { struct Single single; single.num = 33; printf("Number: %d\n",single.num); printSingle(single.num); return 0; }
public class arrayOutput { public static void main (String [] args) { final int NUM_ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; int sumVal; userVals [0] = 3; userVals [1] = 5; userVals [2] = 8; Type the program's output sumVal = 0; for (i = 0; i < userVals.length; ++i) { sumVal= sumVal + userVals [i]; System.out.println (sumVal); } ? ? ??
int machineCompare1(struct machine* mac1, struct machine* mac2){ struct mac1; struct mac2; char make1[21], make2[21]; char model1[51], model2[21]; if((lap1 -> make1 == lap2 -> make2) && (lap1 -> model1 == lap2 -> model2)) return 0; else return 1;} have to create function to compare make and model of 2 machines - it's using structures - not sure if this is correct/ on the right track?
#include <stdio.h> struct Single { int num; }; void printSingle(int f) { int binaryNum[33]; int i = 0; while(f>0) { binaryNum[i] = f % 2; f = f/2; i++; } for (int j=i-1; j>= 0; j--) { printf("%d",binaryNum[j]); } } int main() { struct Single single; single.num = 33; printf("Number: %d\n",single.num); printSingle(single.num); return 0; }
using System; class main { publicstaticvoid Main(string[] args) { int number = 1; while (number <= 88) { int i; Random r = new Random(); int[] randNo=newint[3]; for(i=0;i<3;i++) { randNo[i]= r.Next(1,88); Console.WriteLine("Random Number between 1 and 88 is "+randNo[i]); } } } } This code is supposed to count from 1-88 and then select three random numbers from the list but instead it generates an infinite loop of random numers between 1-88. how can it be fixed?
Q1 #include <stdio.h> int arrC[10] = {0}; int bSearch(int arr[], int l, int h, int key); int *joinArray(int arrA[], int arrB[]) { int j = 0; if ((arrB[0] + arrB[4]) % 5 == 0) { arrB[0] = 0; arrB[4] = 0; } for (int i = 0; i < 5; i++) { arrC[j++] = arrA[i]; if (arrB[i] == 0 || (bSearch(arrA, 0, 5, arrB[i]) != -1)) { continue; } else arrC[j++] = arrB[i]; } for (int i = 0; i < j; i++) { int temp; for (int k = i + 1; k < j; k++) { if (arrC[i] > arrC[k]) { temp = arrC[i]; arrC[i] = arrC[k]; arrC[k] = temp; } } } for (int i = 0; i < j; i++) { printf("%d ", arrC[i]); } return arrC; } int bSearch(int arr[], int l, int h, int key) { if (h >= l) { int mid = l + (h - l) / 2; if…