Question: public BoundedQueue (int capacity); // The maximum number of elements public void enQueue (Object X); public Object deQueue (); public boolean isEmpty (); public boolean
-
public BoundedQueue (int capacity); // The maximum number of elements
-
public void enQueue (Object X);
-
public Object deQueue ();
-
public boolean isEmpty ();
-
public boolean isFull ();
Assume the usual semantics for a queue with a fixed, maximal capacity
Generate test cases for the class BoundedQueue using the Input Space Partitioning method.
As a suggestion, try to keep your partitioning simplechoose a small number of partitions and blocks.
(a) List of all the input variables, including the state variables.
(b) Characteristics of the input variables (Make sure you cover all input variables)
(c) Blocks that partition the characteristics.
(d) One block in each partition designated as the Base block.
(e) Values for each block.
(f) Test suite that satisfies Base Choice Coverage (BCC)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
