Q: There is a series of numbers, two queues, put the first element into queue A, the second into queue B, the third into queue A... So on and so forth,

Here is the code for the single queue

public class Queue { private int maxSize; private int[] queueArray; private int front; private int rear; private int currentSize; public Queue(int size){ this.maxSize = size; this.queueArray = new int[size]; front = 0; rear = -1; currentSize = 0; } public void insert(int item){ //check if queue is already full if(isQueueFull()){ System.out.println("Queue is full!"); return; } // for wrapping the queue in case // max size has reached if(rear == maxSize - 1){ rear = -1; } // increment rear then insert item queueArray[++rear] = item; currentSize++; System.out.println("Added to queue" + item); } public int remove(){ //check if queue is empty if(isQueueEmpty()){ throw new RuntimeException("Queue is empty"); } //System.out.println("front= " + front + " maxSize= "+maxSize); // retrieve item then increment int temp = queueArray[front++]; if(front == maxSize){ front = 0; } currentSize--; return temp; } public int peek(){ return queueArray[front]; } public boolean isQueueFull(){ return (maxSize == currentSize); } public boolean isQueueEmpty(){ return (currentSize == 0); } public static void main(String[] args) { Queue queue = new Queue(10); queue.insert(2); queue.insert(3); System.out.println("Item removed- " + queue.remove()); System.out.println("Item removed- " + queue.remove()); queue.insert(5); System.out.println("Item removed- " + queue.remove()); } }