Java programming: For the following 3 questions, refer to the following code if
ID: 3909097 • Letter: J
Question
Java programming:
For the following 3 questions, refer to the following code if (month>0 && month 0 && day 32) if (month-2 &&day; >28) System.out.println("A valid day"); System.out.println("Not a valid day"); System.out.println ("No good"); else (1) 42. What smallest set of test cases will achieve statement coverage? A. (month is 2, day is 31), (month is 14, day is 1), (month is 3, day is 32), B. (month is 2, day is 31), (month is 3, day is 3), (month is 14, day is 0), C. (month is 2, day is 31), (month is 14, day is 0), D. there is no smallest, E. none of the above (1) 43. What smallest set of test cases will achieve branch coverage? A. (month is 2, day is 31), (month is 14, day is 1), (month is 3, day is 32), B. (month is 2, day is 31), (month is 3, day is 3), (month is 14, day is 0), C. (month is 2, day is 31), (month is 14, day is 0), D. there is no smallest, E. none of the above (1) 44. What set test cases will achieve path coverage? A. (month is 2, day is 31), (month is 14, day is 1), (month is 3, day is 32), B. (month is 2, day is 31), (month is 3, day is 3), (month is 14, day is 0), C. (month is 2, day is 31), (month is 14, day is 0), D. there is no smallest, E. none of the aboveExplanation / Answer
The smallest statement that achieve all coverages is Option C 42. Option C 43. Option C 44. Option C