Question: 1. Black box test-Equivalence Partitioning Basic idea: consider input/output domains and partition them into equiv. classes Scenario: Search for a value in an array: A
1. Black box test-Equivalence Partitioning Basic idea: consider input/output domains and partition them into equiv. classes Scenario: Search for a value in an array: A returning value is the index of some occurrence of the value, or -1 if the value does not occur in the array. 1.1 Please list all possible partitions with examples to test if a "search" algorithm can work for all cases
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
