add the following methods listed below to the SortedArrayCollection class shown in screen shotpublic String toString()// Creates and returns a string that correctly represents the current collection.public T smallest()// Returns null if the collection is empty, otherwise returns the smallest element of the collection.public int greater(T element) // Returns a count of the number of elements e in the collection that are greater then element, that is such that e.compareTo(element) is > 0public MySortedArrayCollection <T> combine (MySortedArrayCollection<T>other) // Creates and returns a new SortedArrayCollection object that is a combination of this object and the argument object.public T []toArray()// Returns an array containing all of the elements of the collection.public void clear()// Removes all elements.public boolean equals(Object o)// Takes an Object argument, returning true if it is equal to the current collection and false otherwisepublic boolean addAll(MySortedArrayCollection<T>c)// Takes a MySortedArrayCollection argument and adds its contents to the current collection; returns a boolean indicating success or failure.public boolean retainAll(MySortedArrayCollection<T>c)// Takes a MySortedArrayCollection argument and removes any elements from the current collection that are not in the argument collection; returns a boolean indicating success or failure.public void removeAll(MySortedArrayCollection<T>c){// Takes a MySortedArrayCollection argument and removes any elements from the current collection that are also in the argument collection.then write a driver program to test that the methods listed above were implemented correctly public class SortedArrayCollection implements CollectionInterface {protected final int DEFCAP = 100; // default capacityprotected int origCap; // original capacityprotected T[] elements; // array to hold collection elementsprotected int numElements = 0; // number of elements in this collection// set by find methodprotected boolean found; // true if target found, otherwise falseprotected int location; // indicates location of target if found,public SortedArraxCellection) {elements = (TLI) new Object[DEFCAP];origCap = DEFCAP;}public SortedArrayCollection (int capacity) {elements = (TLI) new Object[capacity];this.origCar = capacity;}protected void enlarge(// Increments the capacity of the collection by an amount// equal to the original capacity.{// Create the larger array.TLI larger = (T[]) new Object[elements.length + origCap];// Copy the contents from the smaller array into the larger array.for (int i = 0; i last) {found = false;result = ((Comparable) target),compareTo(elements[location]);if (result > 0)location++; // adjust location to indicate insert index} else {location = (first + last) / 2;result = ((Comparable) target).compareTo(elements[location]);if (result == 0) // found targetfound = true;else if (result > 0) // target too highrecEind(target, location + 1, last);else // target too lowrecEind(target, first, location - 1);}} "pagopublic boolean add(T element)// Precondition: element is Comparable to previously added objects//// Adds element to this collection.{if (numElementsenlarge();elements.length)find(element); // sets location to index where element belongsfor (int index = numElements; index > location; index--)elements[index]= elementslindex - 1];elements[location] = element;numElements+t;return true;}public boolean remove(T target)// Removes an element e from this collection such that e.eguals(target)// and returns true; if no such element exists, returns false.{find(target);if (found) {for (int i = location; i <= numElements - 2; i++)elements[i] = elements[i + 1];elementsInumElements - 1] = null;numElements--;}return found;}public int size)// Returns the number of elements on this collection.{return numElements;}public boolean contains(T target)// Returns true if this collection contains an element e such that// eeguals(target); otherwise, returns false.{find(target);return found;}public T get(T target)// Returns an element e from this collection such that e equals(target);// if no such element exists, returns null.{find(target);if (found)return elements[location];elsereturn null;}public boolean isEmpty)// Returns true if this collection is empty; otherwise, returns false.{return (numElements0);}public boolean isFullO// This collection is unbounded so always returns false.{return false;}}

add the following methods listed below to the SortedArrayCollection class shown in screen shot public String toString() // Creates and returns a string that correctly represents the current collection. public T smallest() // Returns null if the collection is empty, otherwise returns the smallest element of the collection. public int greater(T element) // Returns a count of the number of elements e in the collection that are greater then element, that is such that e.compareTo(element) is > 0 public MySortedArrayCollection combine (MySortedArrayCollectionother) // Creates and returns a new SortedArrayCollection object that is a combination of this object and the argument object. public T []toArray() // Returns an array containing all of the elements of the collection. public void clear() // Removes all elements. public boolean equals(Object o) // Takes an Object argument, returning true if it is equal to the current collection and false otherwise public boolean addAll(MySortedArrayCollectionc) // Takes a MySortedArrayCollection argument and adds its contents to the current collection; returns a boolean indicating success or failure. public boolean retainAll(MySortedArrayCollectionc) // Takes a MySortedArrayCollection argument and removes any elements from the current collection that are not in the argument collection; returns a boolean indicating success or failure. public void removeAll(MySortedArrayCollectionc){ // Takes a MySortedArrayCollection argument and removes any elements from the current collection that are also in the argument collection. then write a driver program to test that the methods listed above were implemented corre

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

100%

add the following methods listed below to the SortedArrayCollection class shown in screen shot

public String toString()

// Creates and returns a string that correctly represents the current collection.

public T smallest()

// Returns null if the collection is empty, otherwise returns the smallest element of the collection.

public int greater(T element)

// Returns a count of the number of elements e in the collection that are greater then element, that is such that e.compareTo(element) is > 0

public MySortedArrayCollection <T> combine (MySortedArrayCollection<T>other)

// Creates and returns a new SortedArrayCollection object that is a combination of this object and the argument object.

public T []toArray()

// Returns an array containing all of the elements of the collection.

public void clear()

// Removes all elements.

public boolean equals(Object o)

// Takes an Object argument, returning true if it is equal to the current collection and false otherwise

public boolean addAll(MySortedArrayCollection<T>c)

// Takes a MySortedArrayCollection argument and adds its contents to the current collection; returns a boolean indicating success or failure.

public boolean retainAll(MySortedArrayCollection<T>c)

// Takes a MySortedArrayCollection argument and removes any elements from the current collection that are not in the argument collection; returns a boolean indicating success or failure.

public void removeAll(MySortedArrayCollection<T>c){

// Takes a MySortedArrayCollection argument and removes any elements from the current collection that are also in the argument collection.

then write a driver program to test that the methods listed above were implemented correctly

public class SortedArrayCollection<T> implements CollectionInterface<T> {
protected final int DEFCAP = 100; // default capacity
protected int origCap; // original capacity
protected T[] elements; // array to hold collection elements
protected int numElements = 0; // number of elements in this collection
// set by find method
protected boolean found; // true if target found, otherwise false
protected int location; // indicates location of target if found,
public SortedArraxCellection) {
elements = (TLI) new Object[DEFCAP];
origCap = DEFCAP;
}
public SortedArrayCollection (int capacity) {
elements = (TLI) new Object[capacity];
this.origCar = capacity;
}
protected void enlarge(
// Increments the capacity of the collection by an amount
// equal to the original capacity.
{
// Create the larger array.
TLI larger = (T[]) new Object[elements.length + origCap];
// Copy the contents from the smaller array into the larger array.
for (int i = 0; i<numElements; i++) {
larger[i] = elements[i];
}
// Reassign elements reference.
elements = larger;
}
protected void find(T target)
// Searches elements for an occurrence of an element e such that
// e.egyals(target). If successful, sets instance variables
// found to true and location to the array index of e. If
// not successful, sets found to false and location to the
// array index where target should be inserted.
{
location = 0;
found =
false;
if CisEmpty0)
recEind(target, 0, numElements - 1);
}
protected void recFind(T target, int first, int last)
// Used by find.
{
int result; // result of the comparison
if (first > last) {
found = false;
result = ((Comparable) target),compareTo(elements[location]);
if (result > 0)
location++; // adjust location to indicate insert index
} else {
location = (first + last) / 2;
result = ((Comparable) target).compareTo(elements[location]);
if (result == 0) // found target
found = true;
else if (result > 0) // target too high
recEind(target, location + 1, last);
else // target too low
recEind(target, first, location - 1);
}
}

"pago
public boolean add(T element)
// Precondition: element is Comparable to previously added objects
//
// Adds element to this collection.
{
if (numElements
enlarge();
elements.length)
find(element); // sets location to index where element belongs
for (int index = numElements; index > location; index--)
elements[index]= elementslindex - 1];
elements[location] = element;
numElements+t;
return true;
}
public boolean remove(T target)
// Removes an element e from this collection such that e.eguals(target)
// and returns true; if no such element exists, returns false.
{
find(target);
if (found) {
for (int i = location; i <= numElements - 2; i++)
elements[i] = elements[i + 1];
elementsInumElements - 1] = null;
numElements--;
}
return found;
}
public int size)
// Returns the number of elements on this collection.
{
return numElements;
}
public boolean contains(T target)
// Returns true if this collection contains an element e such that
// eeguals(target); otherwise, returns false.
{
find(target);
return found;
}
public T get(T target)
// Returns an element e from this collection such that e equals(target);
// if no such element exists, returns null.
{
find(target);
if (found)
return elements[location];
else
return null;
}
public boolean isEmpty)
// Returns true if this collection is empty; otherwise, returns false.
{
return (numElements
0);
}
public boolean isFullO
// This collection is unbounded so always returns false.
{
return false;
}
}

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 3 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.