UGC-NET | UGC NET CS 2018 Dec – II | Question 86

Consider the following method :

int f(int m, int n, boolean x, boolean y) {
  int res = 0;
  if (m 
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) (3,2)
(C) (2,3)
(D) (4,3)

Answer: (A) 
Explanation: 
Quiz of this Question
Please comment below if you find anything wrong in the above post

Article Tags :

UGC-NET

Recommended Articles

1. UGC-NET | UGC NET CS 2018 Dec – II | Question 27

2. UGC-NET | UGC NET CS 2018 Dec – II | Question 1

3. UGC-NET | UGC NET CS 2018 Dec – II | Question 2

4. UGC-NET | UGC NET CS 2018 Dec – II | Question 3

5. UGC-NET | UGC NET CS 2018 Dec – II | Question 4

6. UGC-NET | UGC NET CS 2018 Dec – II | Question 5

7. UGC-NET | UGC NET CS 2018 Dec – II | Question 6

8. UGC-NET | UGC NET CS 2018 Dec – II | Question 7

9. UGC-NET | UGC NET CS 2018 Dec – II | Question 8

10. UGC-NET | UGC NET CS 2018 Dec – II | Question 9

11. UGC-NET | UGC NET CS 2018 Dec – II | Question 10

12. UGC-NET | UGC NET CS 2018 Dec – II | Question 11

13. UGC-NET | UGC NET CS 2018 Dec – II | Question 12

14. UGC-NET | UGC NET CS 2018 Dec – II | Question 13

15. UGC-NET | UGC NET CS 2018 Dec – II | Question 14

16. UGC-NET | UGC NET CS 2018 Dec – II | Question 15

17. UGC-NET | UGC NET CS 2018 Dec – II | Question 16

18. UGC-NET | UGC NET CS 2018 Dec – II | Question 17

19. UGC-NET | UGC NET CS 2018 Dec – II | Question 18

20. UGC-NET | UGC NET CS 2018 Dec – II | Question 19

21. UGC-NET | UGC NET CS 2018 Dec – II | Question 20

22. UGC-NET | UGC NET CS 2018 Dec – II | Question 21

23. UGC-NET | UGC NET CS 2018 Dec – II | Question 22

24. UGC-NET | UGC NET CS 2018 Dec – II | Question 23

25. UGC-NET | UGC NET CS 2018 Dec – II | Question 24