My last question for now!

Question

Hello there, its me again, I managed to do the next two questions on my own!! :-) I'm on the last one now, I have a solution but I feel like I'm missing the point with my code as I have had to retype similar code 3 or more times and some lines aren't even used...but if I follow the instructions they should be there. See what you think....
The aim of this question is to develop the code for a queue which holds int
values. The queue is based on an array and is extensible in that if an item is
added to the queue and the queue is full and an item is added then further space is created within the queue
for the new item. There are 6 methods which need to be provided: head() gives
the int that is the first item in the queue without removing it, tail() gives the int that is the last
item in the queue, add(int) adds an item to the queue, remove() removes the first item
from the queue and returns it, queueLength() gives the number of items in the queue and
display() displays the contents of the queue in order on System.out.
Two constructors are also required, the first IntQueue() sets up a default
queue with 30 elements which, when it becomes full and an item added, adds 5 extra locations to the
end of the queue; the other constructor IntQueue(int,int) sets up a queue
with a length given by its first argument and will add the number of locations
given by its second argument when it is full and an item is added.
The queue should be based on an array with the first element of the array
holding the head of the queue. When an item is removed from the queue the
remainder of the array should be copied forward.
Do not worry about programming errors such as an item being removed from
an empty queue.
We also want you to provide a class Tester for you to test your methods.
public class IntQueue {
private int[] queue;
// Remainder of instance variables
int added =0;
int added2=0;
public IntQueue() {
// Code for default constructor
queue = new int [30];
if (added >= queue.length) {
int[] newArray = new int[queue.length + 5];
System.arraycopy(queue, 0, newArray, 0, queue.length);
queue = newArray;
public IntQueue(int size, int increment){
// Code for two argument constructor
queue = new int [size];
if (added2 >= queue.length) {
int[] newArray2 = new int [queue.length + increment];
System.arraycopy(queue, 0, newArray2, 0, queue.length);
queue = newArray2;
public int head(){
// Code for head
return queue[0];
public int tail(){
// Code for tail
return queue[queue.length];
public int queueLength(){
// Code for queuelength
return queue.length; //String.valueOf(queue.length);
public void add(int item){
// Code for add
if (added >= queue.length) {
int[] newArray = new int[queue.length + 5];
System.arraycopy(queue, 0, newArray, 0, queue.length);
queue = newArray;
queue[added] = item;
added++;
public int remove(){
// Code for remove
int removed = 0;
removed = queue[0];
int[] newArray3 = new int[queue.length - 1];
System.arraycopy(queue, 1, newArray3, 0, newArray3.length);
queue = newArray3;
return removed;
public void display(){
// Code for display
for (int i = 0;i < queue.length;i++){
System.out.println("Array queue["+
String.valueOf(i) + "] = " + String.valueOf(queue));
}

Answer 1

int added =0;
int added2=0;
One error I see straight off is with your instance variables. You haven't made them instance variables! What you have above is what u do when declaring a local variable not an instance.
Try making them instance variables! Same way you made an instance of queue!