Question: Consider the following code snippet: a) Write the test cases using Equivalence Class Portioning (ECP). b) Generate mutants using relational operator replacement, arithmetic operator replacement
Consider the following code snippet:
![void merge(int arr[], int 1, int m, int r) { int n1](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2021/06/60c9659a90950_Screenshot20210616072848.png)
a) Write the test cases using Equivalence Class Portioning (ECP).
b) Generate mutants using relational operator replacement, arithmetic operator replacement and variable replacement operator.
c) Calculate the mutation score for the test case generated using ECP.
void merge(int arr[], int 1, int m, int r) { int n1 = m - 1 + 1; int n2 = r- m; int L[n1], R[n2]; for (int i = 0; i < n1; i++) L[i] = arr[1 + i]; for (int j = 0; j < n2; j++) R[j] = arr[m + 1 + j]; int j = 0; int k 1; %3D while (i < n1 && j < n2) { if (L[i]
Step by Step Solution
3.51 Rating (158 Votes )
There are 3 Steps involved in it
The way to solve the iterative merge sort problem is given below with the code itself and how to solve it to understand the class proportioning in a b... View full answer
Get step-by-step solutions from verified subject matter experts
