9.Give a set of four test cases for the algorithm from question 9 that covers all branches.

10.In a scheduling program, we want to check whether two appointments overlap. For simplicity, appointments start at a full hour, and we use military time (with hours 024). The following pseudocode describes an algorithm that determines whether the appointment with start time start1 and end time end1 overlaps with the appointment with start time start2 and end time end2.

If start1 > start2: s = start1 Else: s = start2 If end1

Using the table described in question 8, trace this algorithm with each of the following:

an appointment from 1012 and one from 1113

an appointment from 1011 and one from 1213

11.Complete the following truth table by finding the truth values of the Boolean expressions for all combinations of the Boolean predicates (variables) p, q, and r.

12.True or false? A && B is the same as B && A for any boolean expressions A and B.

13.Suppose the value of the boolean variable b is false and the value of the int variable x is 0. What is the value of each of the following expressions?

a.b && x == 0

b.b || x == 0

c.!b && x == 0

d.!b || x == 0

e.b && x != 0

f.b || x != 0

g.!b && x != 0

h.!b || x != 0

14.Simplify the following expressions. Assume b is a variable of type boolean.

a.b == true

b.b == false

c.b != true

d.b != false

15.Simplify the following statements. Here, b is a variable of type boolean and n is a variable of type int.

a.if (n == 0) { b = true; } else { b = false; } (Hint: What is the value of n == 0?)

b.if (n == 0) { b = false; } else { b = true; }

c.b = false; if (n > 1) { if (n }

d.if (n else { b = n > 2; }