Determine if the following statement are true or false Screen shot shows the text's arraycollection When comparing two objects using the == operator, what is actually compared is the contents of the objects.

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
icon
Related questions
Question

Determine if the following statement are true or false

Screen shot shows the text's arraycollection

When comparing two objects using the == operator, what is actually compared is the contents of the objects.

The equals method of the Object class returns true only if the two objects being compared have identical attributes.

A collection allows retrieval of information based on the size of the information.

With the text's array-based collection implementation, the set of stored elements is scattered about the array.

 
```java
public class ArrayCollection<T> implements CollectionInterface<T> {
    protected final int DEFCAP = 100; // default capacity
    protected T[] elements; // array to hold collection’s 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 ArrayCollection() {
        elements = (T[]) new Object[DEFCAP];
    }
    
    public ArrayCollection(int capacity) {
        elements = (T[]) new Object[capacity];
    }

    protected void find(T target) {
        // Searches elements for an occurrence of an element e such that
        // e.equals(target). If successful, sets instance variables
        // found to true and location to the array index of e. If
        // not successful, sets found to false.
        location = 0;
        found = false;

        while (location < numElements) {
            if (elements[location].equals(target)) {
                found = true;
                return;
            } else {
                location++;
            }
        }
    }

    public boolean add(T element) {
        // Attempts to add element to this collection.
        // Returns true if successful, false otherwise.
        if (isFull()) 
            return false;
        else {
            elements[numElements] = element;
            numElements++;
            return true;
        }
    }

    public boolean remove(T target) {
        // Removes an element e from this collection such that e.equals(target)
        // and returns true; if no such element exists, returns false.
        find(target);
        if (found) {
            elements[location] = elements[numElements - 1];
            elements[numElements - 1] = null;
            numElements--;
        }
        return found;
    }

    public boolean contains (T target) {
        // Returns true if this collection contains an element e such that
        // e.equals(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;
Transcribed Image Text:```java public class ArrayCollection<T> implements CollectionInterface<T> { protected final int DEFCAP = 100; // default capacity protected T[] elements; // array to hold collection’s 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 ArrayCollection() { elements = (T[]) new Object[DEFCAP]; } public ArrayCollection(int capacity) { elements = (T[]) new Object[capacity]; } protected void find(T target) { // Searches elements for an occurrence of an element e such that // e.equals(target). If successful, sets instance variables // found to true and location to the array index of e. If // not successful, sets found to false. location = 0; found = false; while (location < numElements) { if (elements[location].equals(target)) { found = true; return; } else { location++; } } } public boolean add(T element) { // Attempts to add element to this collection. // Returns true if successful, false otherwise. if (isFull()) return false; else { elements[numElements] = element; numElements++; return true; } } public boolean remove(T target) { // Removes an element e from this collection such that e.equals(target) // and returns true; if no such element exists, returns false. find(target); if (found) { elements[location] = elements[numElements - 1]; elements[numElements - 1] = null; numElements--; } return found; } public boolean contains (T target) { // Returns true if this collection contains an element e such that // e.equals(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;
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Array
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.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education