Question: Suppose a program contains N decision points, each of which has two branches. How many test cases are needed to perform path testing on such
Suppose a program contains N decision points, each of which has two branches. How many test cases are needed to perform path testing on such a program? If there are M choices at each decision point, how many test cases are needed for path testing? Can the program's structure reduce this number? Give an example to support your answer.
Step by Step Solution
3.53 Rating (160 Votes )
There are 3 Steps involved in it
To answer your question lets break it down into two main parts Part 1 When Each Decision Point has Two Branches Binary Decision Points 1 Understanding ... View full answer
Get step-by-step solutions from verified subject matter experts
