What is the theoretical maximum level of switch coverage that can be achieved for the state diagram above? 1 credit [K2]

Question

Options

• A4
• B5
• C6
• D7

• B
  93% (38)
• C
  5% (2)
• D
  2% (1)

Explanation

Switch coverage level N tests every unique sequence of N consecutive transitions through a state machine. Option B (5) is correct because the longest valid path through the given state diagram traverses exactly 5 consecutive transitions - meaning 5-switch is the highest coverage level the structure can support.

Option A (4) is wrong because it falls short: a path of 5 consecutive transitions exists in the diagram, so stopping at 4-switch leaves sequences untested that are actually achievable. Options C (6) and D (7) are structurally impossible - they would require paths of 6 or 7 consecutive transitions, but no such paths exist in this diagram without repeating a transition or exceeding the available states/edges.

Memory tip: Count the transitions along the longest non-repeating path in the state diagram - that count equals your maximum switch coverage level. If the longest path visits 6 states, it crosses 5 transitions, giving a maximum of 5-switch coverage.

No community discussion yet for this question.