BCS CTFL4 Exam - Topic 4 Question 41 Discussion

Actual exam question for BCS's CTFL4 exam

Question #: 41
Topic #: 4

Consider the following simplified version of a state transition diagram that specifies the behavior of a video poker game:

What Is the minimum number of test cases needed to cover every unique sequence of up to 3 states/2 transitions starting In the "Start" state and ending In the "End" state?

Show Suggested Answer

Suggested Answer: D

The minimum number of test cases needed to cover every unique sequence of up to 3 states/2 transitions starting in the ''Start'' state and ending in the ''End'' state is 4. This is because there are 4 unique sequences of up to 3 states/2 transitions starting in the ''Start'' state and ending in the ''End'' state:

Start -> Bet -> End

Start -> Deal -> End

Start -> 1st Deal -> End

Start -> 2nd Deal -> EndReference: ISTQB Certified Tester Foundation Level (CTFL) v4.0 sources and documents.

by Lavelle at May 16, 2026, 06:03 AM

Limited Time Offer

25%

Off

Get Premium CTFL4 Questions as Interactive Web-Based Practice Test or PDF

Contribute your Thoughts:

Submit Cancel

Clorinda

I remember we practiced a similar question about state transitions, but I’m not sure how to count the unique sequences here.

upvoted 0 times

...