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…

The correct answer is D. 4. 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…

Test Analysis and Design

Question

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?

Exhibit

Options

How the community answered

(51 responses)

A
6% (3)
B
10% (5)
C
24% (12)
D
61% (31)

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 Start -> Bet -> End Start -> Deal -> End Start -> 1st Deal -> End Start -> 2nd Deal -> End

Topics

#state transition testing#test case calculation#coverage criteria#test design

Community Discussion

No community discussion yet for this question.

Full CTFL_SYLL_4.0 Practice