ISTQB Test Technique Practice

Unlimited practice for the ISTQB Foundation Level test techniques: equivalence partitioning, boundary value analysis, decision tables, state transitions, and statement and branch coverage. Pick an answer and Check my answer names the slip, such as an invalid partition left out or a neighbour counted twice.

Check your answer to see the working.

Rules follow the ISTQB CTFL Syllabus v4.0.1 and the official sample exams.

ISTQB practice

The Foundation Level syllabus sets these black-box techniques at K3, apply, and the Advanced Level Test Analyst exam expands on them. Start with the free real exam questions, then get the full pack.

ISTQB CTFL v4.0
278 real exam questionsUS$39
Free: 70 questionsGet the full pack
ISTQB CTAL-TA
87 real exam questionsUS$39
Free: 25 questionsGet the full pack

Technique FAQ

How each count works
  • EP: one test per partition, invalid ones included. Coverage = partitions reached ÷ all partitions.
  • 2-value BVA: the minimum and maximum of every partition. A field limit with no partition beyond it has no neighbour there.
  • 3-value BVA: each boundary value plus both neighbours, each value counted once, only values the field takes.
  • Decision tables: full table = product of the values of each condition; coverage items = feasible columns.
  • State tables: filled cells are valid transitions, empty cells are invalid; all transitions = states × events.
  • Statement coverage: statements run ÷ executable statements. Branch coverage: branches taken ÷ all branches.
How many test cases does equivalence partitioning need?

One for each partition, valid and invalid. The syllabus measures EP coverage as the partitions exercised by at least one test, divided by all identified partitions. With several inputs, the simplest criterion is Each Choice coverage: every partition of every input at least once, without combining them.

What is the difference between 2-value and 3-value BVA?

Boundary values are the minimum and maximum of each ordered partition. In 2-value BVA each boundary value has two coverage items: the value and its closest neighbour in the next partition. In 3-value BVA it has three: the value and both its neighbours, so some items are not boundary values. A value is counted once even when two boundaries share it.

How many columns does a decision table need?

A full table has a column for every combination of conditions, so 3 yes or no conditions give 2 × 2 × 2 = 8. Columns with infeasible combinations can be deleted, and the coverage items are the feasible columns. The syllabus leaves minimization algorithms out of scope.

What do all states, valid transitions and all transitions coverage mean?

All states coverage visits every state. Valid transitions coverage, also called 0-switch coverage, takes every valid transition. All transitions coverage also attempts every invalid transition, the empty cells of the state table, ideally one invalid transition per test case so one defect does not hide another.

Why do the state problems start in S1 and end in the final state?

That is how the official sample exams frame these questions: in sample exams A and C each test case runs from the start state to the end state. A minimum test count depends on that rule, so the drill says it on every problem.

Does 100% statement coverage mean 100% branch coverage?

No. Branch coverage subsumes statement coverage, but not the other way round. An IF without ELSE is the classic case: one test that takes the true outcome runs every statement but never takes the false branch.

Which exams test these techniques?

The CTFL v4.0 syllabus (v4.0.1 is current) sets equivalence partitioning, boundary value analysis, decision tables and state transitions at K3, apply, and statement and branch testing at K2. The Advanced Level Test Analyst certification expands on black-box test techniques.

Sources

Checked 20 November 2026 against the ISTQB CTFL Syllabus v4.0.1, the CTFL v4.0 sample exams A to D and the ISTQB Glossary.

More free tools

All free tools