UGC NET CSE | December 2018 | Part 2 | Question: 56

Question

Consider the following method:

int f(int m, int n, boolean x, boolean y)
{
    int res=0;
    if (m<0) {res=n-m;}
    else if (x || y)
    {
        res=-1;
        if(n==m){res=1;}
    }
    else {res=n;}
    return res;
} /*end of f */

If $P$ is the minimum number of tests to achieve full statement coverage for $f()$, and $Q$ is the minimum number of tests to achieve full branch coverage for $f()$, then $(P,Q)$ = 

• A. $(3, 4)$
• B. $(4,3)$
• C. $(2,3)$
• D. $(3,2)$

Answer 1

Ans is (3,4)

 Full statement coverage means execution of all the executable statements in the source code at least once. So here,

first time keep m<0 to cover statements of if block

second time keep (x>0 or  y>0) and (n==m) to cover all statements of else if block

third time make above 2 conditiions false so that else block is executed.

Thus P= 3

In the branch coverage, every outcome from a code should be tested.

Here there are 4 outcomes possible, res = n-m, res= -1, res= 1, res = n. Observe else if block has 2 outcomes and therefore both should be covered which will require 2 test cases. if block and else block will require only 1 -1 testcases.

thus Q= 4

Comments

caN  u show with flow_chart ,

Answer 2

Ans A

Comments

@mahesh13 sir can u plz explain how to solve this question.. i only know about flow diagram but dont know the correct approach to find full statement coverage.... Plz explain.

---

Hi Please explain the answer as well.

---

???

---

Statement coverage is said to make sure that every statement in the code is executed at least once.
 

Decision/branch coverage is said to ensure that each one of the possible branch from each decision point is executed at least once and thereby ensuring that all reachable code is executed.

So Number of Statement coverage = 3 and branch coverage =4 

Refer : https://academyera.com/ugc-net-cs-2018-dec-paper-2-programming-5