Implement Class IntQueue, a class that contains a queue of integers using an Array.

the members are as follows:

Attributes
1)Data structure 

2) Variable to keep where we are (the index to insert and remove the next value)

Methods

1)boolean isEmpty()

2)int dequeue();

3)void enqueue(int x);

4) bool isFull()

Third, using stack and queue classes in everyday problems 

Task 2 - Let Q be a non-empty queue, and let S be an empty stack. Using only the stack and queue Abstract data type methods and a single element variable X, write an algorithm to reverse the order of the elements in Q. The result would be that Q has the same elements but in reverse order.

Note: You can use the Stack and Queue implementation classes implemented in previous tasks or Java Collections Stack and Queue classes. 

Task 3  Design a method that converts an input integer N into a link list of its digits. The link list would start with the least significant digit up until the most significant digit. You may use the LinkedList class in JCF (Java collection framework). 

Example: if the input was 2349, the link list would look like this  (head) 9->4->3->2

Task 4) write a Test class to test your previous CASES