Given the following state transition diagram where SS is the start state:
Which of the following answers describes a test case that only uses valid transitions to exercise all states, using the minimum number of transitions?
Given the following state transition diagram where SS is the start state:
Which of the following answers describes a test case that only uses valid transitions to exercise all states, using the minimum number of transitions?
To exercise all states, we start at SS and follow the transitions SS-S1, S1-S3, and S3-S2. This sequence of transitions ensures that every state (SS, S1, S3, and S2) is visited using the minimum possible number of transitions, which is three. Therefore, the correct answer is D, as it covers all the states with the minimum number of transitions.
i think it should be 'a' because there are 5 valid transitions.
but you have to find 'the minimum number of transitions' -> Answer D