. Derive input space partitioning tests for the BoundedQueue class with the following signature:

public BoundedQueue (int capacity);

public void Enqueue (Object X);

public Object Dequeue ();

public boolean IsEmpty ();

public boolean IsFull ();

Assume the usual semantics for a queue with a ?xed, maximal capacity. Try to keep your partitioning simple–choose a small number of partitions and blocks.

(a) Identify all of the variables. Don’t forget the state variables.

(b) Identify several characteristics that suggest partitions.

(c) Identify the blocks in the partition for each characteristic. Designate one block in each partition as the “Base” block.

(d) De?ne values for the blocks.

(e) De?ne a test set that satis?es base choice coverage (BCC).