Design a class named Queue for storing integers Like a stack

Design a class named Queue for storing integers. Like a stack, a queue holds elements. In a stack, the elements are retrieved in a last-in first-out fashion. In a queue, the elements are retrieved in a first-in first-out fashion. The class contains:

An int[] data field named elements that stores the int values in the queue.

A data field named size that stores the number of elements in the queue.

A constructor that creates a Queue object with a default capacity of 8.

The method enqueue(int v) that adds v into the queue.

The method dequeue() that removes and returns the element from the queue.

The method empty() that returns true if the queue is empty.

The method getSize() that returns the size of the queue.

How to draw the UML diagram for the class.

Solution

public class Test

{

    public static void main(String[] args) {

        Queue queue = new Queue();

        for (int i = 0; i < 20; i++) {

            queue.enqueue(i);

        }

        for (int i = 0; i < 20; i++) {

            System.out.printf(\"%2d \", queue.dequeue());

            if ((i + 1) % 5 == 0) System.out.printf(\"\ \");

        }

    }

}