Testing Fundamentals - Functional Testing Techniques
You have a system with three conditions: C1, C2, and C3, each can be Yes or No. How many unique rules (rows) should a complete decision table have to cover all combinations?
You have a system with three conditions: C1, C2, and C3, each can be Yes or No. How many unique rules (rows) should a complete decision table have to cover all combinations?
hard📝 Application Q15 of 15
Step-by-Step Solution
Solution:
Step 1: Calculate total combinations for three binary conditions
Each condition has 2 states (Yes/No). Total combinations = 2 * 2 * 2 = 8.Step 2: Understand decision table rows
Each unique combination corresponds to one rule (row) in the decision table.Final Answer:
8 -> Option AQuick Check:
2^3 = 8 rules needed [OK]
Quick Trick: Use 2^number_of_conditions for total rules [OK]
Common Mistakes:
- Adding conditions instead of multiplying
- Using wrong powers (like 3^2)
- Confusing rules with actions
Master "Functional Testing Techniques" in Testing Fundamentals
Want More Practice?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All QuestionsMore Testing Fundamentals Quizzes