You are testing web application software that allows a person to use their travel points to make flight and hotel reservations. When the user logs into the software (username/password) they are…

Question

Options

• APoints > Reservation
• BLogin > Points, Points > Flight, Points > Hotel
• CLogin > Login, Login > Points, Login > Flight, Login > Hotel, Points > Flight, Points > Hotel
• DLogin > Login, Login > Points, Login > Flight, Login > Hotel, Flight > Hotel, Hotel > Flight, Flight >

• A
  6% (1)
• B
  6% (1)
• C
  71% (12)
• D
  18% (3)

Explanation

Option C is correct because it captures every valid transition in the system while respecting the constraint that testing stops once a reservation state (Flight or Hotel) is reached. The Login state can loop back to itself (failed attempt), or lead to Points, Flight, or Hotel on success. The Points state can lead to either reservation page - giving exactly the six transitions listed in C.

Why the distractors fail:

• A is far too incomplete - it ignores the Login state entirely and collapses both reservation types into a vague "Reservation" label.
• B is missing three transitions: Login→Login (failed login), Login→Flight, and Login→Hotel; it only tests the path through Points, not the direct paths.
• D adds transitions that originate from reservation states (Flight→Hotel, Hotel→Flight), which directly violates the rule that the test ends when a reservation state is reached - those states are terminal in this test.

Memory tip: Think of Flight and Hotel as "exit doors" - once you walk through one, the test is over, so you never draw an arrow out of them. Count only the arrows that lead into those doors, plus every arrow from Login (including the self-loop for failure) and every arrow out of Points.

No community discussion yet for this question.