ExamGecko
Question list
Search
Search

List of questions

Search

Related questions











Question 170 - CTFL4 discussion

Report
Export

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
Answers
A.
1
B.
2
Answers
B.
2
C.
3
Answers
C.
3
D.
4
Answers
D.
4
Suggested 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 -> EndReference: ISTQB Certified Tester Foundation Level (CTFL) v4.0 sources and documents.

asked 18/09/2024
Michaelj Lauth
36 questions
User
Your answer:
0 comments
Sorted by

Leave a comment first