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?

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?
A . 1
B . 2
C . 3
D . 4

View Answer

Answer: D

Explanation:

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 -> End

References: ISTQB Certified Tester Foundation Level (CTFL) v4.0 sources and documents.