Free Preparation Discussions
MENU
BCS CTFL4 Exam - Topic 4 Question 41 Discussion
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?
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.
Ligia
1 day agoMargret
7 days agoHerman
12 days agoCristen
17 days agoMozelle
22 days agoNoelia
27 days agoScot
1 month agoYolando
1 month agoCyril
1 month agoMireya
2 months agoAlexia
2 months agoJoye
2 months agoAngelica
2 months agoVeta
2 months agoAriel
2 months agoEdelmira
3 months agoJerry
3 months agoIsreal
3 months agoClorinda
5 months ago