Look at the following Java method:

public void greeting(int time) {   

    String result;

    result = (time > 11) ? "Good day." : "Good morning.";

   System.out.println(result);

}

What set of test cases is correct and would achieve 100% decision coverage in the corresponding control-flow graph?

How does White-Box Testing (WBT) complement Black-Box Testing?

Which statement about linearly independent path coverage is correct?

Assume you have three input variables x1, x2, and x3. The valid input value spaces of each of x1, x2, and x3 are split into 3 equivalence classes. What is the minimum set of test cases (input side) to cover all possible combinations of valid input equivalence classes?

Assume you have 3 boolean input variables b1, b2, b3, represented by buttons that can be “on” or “off”. How many different pairs of variables do you have?

Assume you have 3 boolean input variables b1, b2, b3, represented by buttons that can be “on” (1) or “off” (0). What is the lower bound for the minimum number of test cases to cover all 2-way interactions?

Assume you have a specification of a program that allows users to search for a character in an existing string. The specification states that the user must input the length of the string and the character to search for. If the string length is out-of-range an error message “Integer out of range” will appear. If the character appears in the string, its position will be reported. If the character is not in the string the message “Character not found” will be output.

The input conditions (= causes) are as follows:

C1: Positive integer from 1 to 80

C2: Character to search for is in string

The output conditions (= effects) are:

E1: Integer out of range

E2: Position of character in string

E3: Character not found

Using the information given in the specification, how would you define the rules (= cause-effect relationships)?

Assume you have two input variables x1 and x2. The valid value spaces of each input variable are split into three equivalence classes as shown below:

x1: EC1=(min-int, 0); EC2={0}; EC3=(0, max-int)

x2: EC4=(min-int, 0); EC5={0}; EC6=(0, max-int)

What set of test cases (input side) covers all possible combinations of valid input equivalence classes?

Assume you have three input variables x1, x2, and x3. The value spaces of each input variable are split into two equivalence classes as shown below:

x1: EC1=(min-int, 0) - invalid; EC2=[0, max-int) - valid

x2: EC3=(min-int, 0) - invalid; EC2=[0, max-int) - valid

x3: EC3=(min-int, 0) - invalid; EC2=[0, max-int) - valid

What set of test cases (input side) covers all possible combinations of input equivalence classes?

Assume that you have defined the valid Equivalence Class (EC) for an input parameter X as follows: “X is a positive integer”. What is the best set of Boundary Values (BVs)? “Best” means that the boundary values are correct and most complete (among all offered choices).