Question
Implement MyQueue and MyStack classes that inherit from MyArrayList. Implement a MyHeap class that uses a MyArrayList to store the data. Note the distinction between
Implement MyQueue and MyStack classes that inherit from MyArrayList. Implement a MyHeap class that uses a MyArrayList to store the data. Note the distinction between inherit and uses. Write a static test() method (in Solution in package problem1) that measures how long it takes to add and then remove 50,000, 100,000, 200,000, and 500,000 items to/from MyQueue, MyStack, and MyHeap. The items are non-negative integer values that are read from the file data.txt located in the anonymous. The file contains one million items only read as much data as needed, starting from the beginning of the file, for the test being run. The output should be a table showing the average time to add and remove a single item.
.
//MyQueue
public class MyQueue
public void enqueue(E e) { list.addLast(e); }
public E dequeue() { return list.removeFirst(); }
public int getSize() { return list.size(); }
@Override public String toString() { return "Queue: " + list.toString(); } }
.
//MyStack
import java.util.ArrayList;
public class MyStack { private ArrayList
public boolean isEmpty() { return list.isEmpty(); }
public int getSize() { return list.size(); }
public Object peek() { return list.get(getSize() - 1); }
public Object pop() { Object o = list.get(getSize() - 1); list.remove(getSize() - 1); return o; }
.
package MyListInterface.MyAbstractList;
public class MyArrayList
/** Create a default list */ public MyArrayList() { }
/** Create a list from an array of objects */ public MyArrayList(E[] objects) { for (int i = 0; i < objects.length; i++) add(objects[i]); // Warning: dont use super(objects)! }
@Override /** Add a new element at the specified index */ public void add(int index, E e) { ensureCapacity();
// Move the elements to the right after the specified index for (int i = size - 1; i >= index; i--) data[i + 1] = data[i];
// Insert new element to data[index] data[index] = e;
// Increase size by 1 size++; }
/** Create a new larger array, double the current size + 1 */ private void ensureCapacity() { if (size >= data.length) { E[] newData = (E[])(new Object[size * 2 + 1]); System.arraycopy(data, 0, newData, 0, size); data = newData; } }
@Override /** Clear the list */ public void clear() { data = (E[])new Object[INITIAL_CAPACITY]; size = 0; }
@Override /** Return true if this list contains the element */ public boolean contains(E e) { for (int i = 0; i < size; i++) if (e.equals(data[i])) return true;
return false; }
@Override /** Return the element at the specified index */ public E get(int index) { checkIndex(index); return data[index]; }
private void checkIndex(int index) { if (index < 0 || index >= size) throw new IndexOutOfBoundsException ("Index: " + index + ", Size: " + size); } @Override /** Return the index of the first matching element * in this list. Return -1 if no match. */ public int indexOf(E e) { for (int i = 0; i < size; i++) if (e.equals(data[i])) return i;
return -1; }
@Override /** Return the index of the last matching element * in this list. Return -1 if no match. */ public int lastIndexOf(E e) { for (int i = size - 1; i >= 0; i--) if (e.equals(data[i])) return i;
return -1; }
@Override /** Remove the element at the specified position * in this list. Shift any subsequent elements to the left. * Return the element that was removed from the list. */ public E remove(int index) { checkIndex(index); E e = data[index];
// Shift data to the left for (int j = index; j < size - 1; j++) data[j] = data[j + 1];
data[size - 1] = null; // This element is now null
// Decrement size size--;
return e; }
@Override /** Replace the element at the specified position * in this list with the specified element. */ public E set(int index, E e) { checkIndex(index); E old = data[index]; data[index] = e; return old; }
@Override public String toString() { StringBuilder result = new StringBuilder("[");
for (int i = 0; i < size; i++) { result.append(data[i]); if (i < size - 1) result.append(", "); }
return result.toString() + "]"; }
/** Trims the capacity to current size */ public void trimToSize() { if (size != data.length) { E[] newData = (E[])(new Object[size]); System.arraycopy(data, 0, newData, 0, size); data = newData; } // If size == capacity, no need to trim }
@Override /** Override iterator() defined in Iterable */ public java.util.Iterator
@Override public boolean hasNext() { return (current < size); }
@Override public E next() { return data[current++]; }
@Override public void remove() { MyArrayList.this.remove(current); } } }
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started
Concepts of Database Management
Authors: Philip J. Pratt, Mary Z. Last
8th edition
1285427106, 978-1285427102
