nerdexam
ISTQB

CTFL_001 · Question #189

CTFL_001 Question #189: Real Exam Question with Answer & Explanation

Sign in or unlock CTFL_001 to reveal the answer and full explanation for question #189. The question stem and answer options stay visible for context.

Question

How many test cases are necessary to cover all the possible sequences of statements (paths) for the following program fragment? Assume that the two conditions are independent of each other : -if (Condition 1)then statement 1else statement 2if (Condition 2)then statement 3

Options

  • A2 Test Cases
  • B3 Test Cases
  • C4 Test Cases
  • DNot achievable

Unlock CTFL_001 to see the answer

You've previewed enough free CTFL_001 questions. Unlock CTFL_001 for full answers, explanations, the timed quiz mode, progress tracking, and the master PDF. Question stem and options stay visible so you can still see what's on the exam.

Full CTFL_001 Practice