Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

If Java does not have class: Vector. Implement the following method of vector by

ID: 674520 • Letter: I

Question

If Java does not have class: Vector. Implement the following method of vector by of the implementations of ArrayQueue listed below: Just need to complete the method add.

Answer:

public class MyVector<E> {

Queue<E> q;

public MyVector(){

    q = new ArrayQueue<E>();

}

   

public void add(int index, E item) throws QueueException{

    //Complete this method

}

public String toString(){

    return q.toString();

}

}

public class ArrayQueue<E>implements Queue<E> {

public static final int DEFAULT_CAPACITY = 1000;

private int f, numElem;

private int capacity;

private E s[];

public ArrayQueue(){

    this(DEFAULT_CAPACITY);

}

public ArrayQueue(int capacity){

    this.capacity = capacity;

    f = 0;

    numElem = 0;

    s = (E[]) new Object[capacity];

}

// Returns the number of elements in the queue

public int size(){

    return numElem;

}

// Returns true if queue is empty.

public boolean isEmpty(){

    return numElem == 0;

}

// Returns true if queue is full.

public boolean isFull(){

    return numElem == s.length;

}

//Returns the front item from the queue.

//But does not remove it.

public E front() throws QueueException{

    if(isEmpty())

      throw new QueueException("Queue is full");

    return s[f];

}

// Inserts item at the rear of the queue.

public void enqueue(E item)throws QueueException{

    if(isFull())

      throw new QueueException("Queue is full");

    int freeIndex = (f + numElem) % s.length;

    s[freeIndex] = item;

    numElem++;

}

// Inserts item at the rear of the queue.

public E dequeue()throws QueueException{

    if(isEmpty())

      throw new QueueException("Queue is empty");

    E item = s[f];

    s[f] = null;

    f = (f+1)%s.length;

    numElem--;

    return item;

}

//To use to display the content of the queue.

public String toString(){

    int ff = f, r = (f + numElem) % s.length;

    String str = "[";

    if(size() > 0)

      str += s[ff];

    ff = (ff + 1)%s.length;

    while(ff != r){

      str += ", " + s[ff];

      ff = (ff + 1)%s.length;

    }

    return str + "]";

}

}

Explanation / Answer

public void add(int index, E item) throws QueueException{
Vector vect = new Vector(4);
   vect.add(0,4);
   vect.add(1,3);
   vect.add(2,2);
   vect.add(3,1);
System.out.println("Added vector numbers are- ");

for (Integer number : vect) {       
   System.out.println("Index :"+vect.indexOf(number) +" Number: " + number);
   }
    
   vect.add(3,10);
   System.out.println("Added vector numbers after insertion are :- ");
   for (Integer number : vect) {       
   System.out.println("Index :"+vect.indexOf(number) +" Number: " + number);
   }

}

Hire Me For All Your Tutoring Needs
Integrity-first tutoring: clear explanations, guidance, and feedback.
Drop an Email at
drjack9650@gmail.com
Chat Now And Get Quote