Learn
One unit at a time by default. Reach Level 2+ on every card in a unit before the next unlocks. Prompts step from multiple choice → typing → flashcard.
Up to 10 cards per round. Practice any cards ignores the due schedule.
Quiz
Shuffled multiple-choice from the guide. Calculation questions use new numbers each time. You can retry missed questions at the end.
Labs
Interactive examples from the guide. Not scored.
Pairwise coverage
Each row is one configuration of binary factors A, B, C. Toggle rows to build a suite.
Goal: all 12 pairwise items with four rows. Pair coverage ≠ triple coverage.
Study guide · pages 13–15
Boundary values
Exam and coursework must be integers. Validate each input before adding them.
Presets:
Watch the source-table trap: 15 + 15 is a valid total of 30, so its grade is C. The slide's FM cell conflicts with the stated rule.
Study guide · page 9
Data-flow paths
1 input x, y; a = 0; b = 0
I if x > 10:
2 w = a + 1; b = 4
else:
3 w = b + 1; a = 4
II if y > 10:
4 z = a + w
else:
5 z = b + wEach path label gives the outcomes of I, then II. A pair such as a: 1 → 4 connects a definition to its use without an intervening redefinition.
Study guide · pages 22–23. This example contains 12 definition–use pairs.
Symbolic paths
P: if x ≤ 0 or y ≤ 0:
x = x²; y = y²
else:
x = x + 1; y = y + 1
Q: if x < 1 or y < 1:
x = x + 1; y = y + 1
else:
x = x - 1; y = y - 1Examples:
Why is FT impossible?
P=false requires x>0 and y>0. Incrementing both makes each updated value greater than 1. Therefore Q (x<1 or y<1) must be false.
Writing algebra for a path does not prove the path is feasible. Its constraints must also be satisfiable.
Study guide · page 26. These numeric traces illustrate the symbolic path constraints.
Reference
Formulas, lookalike pairs, and glossary. Not a study round.
Formulas & scoring
Watch denominator traps on coverage and mutation score.
Verification vs validation
- Verification
- Built the product right — conformance to a specification.
- Validation
- Built the right product — fitness for user needs.
Retest vs regression
- Retesting
- Checks that a specific defect was fixed.
- Regression
- Checks that a change did not break previously working behavior.
Statement vs branch
- Statement coverage
- Execute statements. Need not hit every branch.
- Branch coverage
- Exercise each decision outcome.
Condition vs decision
- Condition coverage
- Each atomic condition true and false.
- Decision coverage
- Each overall decision outcome. Neither implies the other.
Items vs suite size
- Pairwise items
- How many value-pairs must appear (e.g. 12 for 3 binary factors).
- Suite size
- How many test rows you run. Different denominator.
Error → defect → failure
- Error
- Human mistake.
- Defect
- Fault in an artifact. May not fail on every run.
- Failure
- Observable incorrect behavior.