Determine if the following statement are true or falsescreen shot shows the text's SortedArrayCollection and ArrayCollectionWhen comparing two objects using the == operator, what is actually compared is the references to the objects.When comparing two objects using the equals method inherited from the Object class, what is actually compared is the references to the objects.The text's sorted array-based collection implementation stores elements in the lowest possible indices of the array.The text's array-based collection implementation stores elements in the lowest possible indices of the array. return found;}public class Arraysellectien implements Çollectionlatertaceprotected final int DEFCAP = 100; // default capacityprotected T] elements;protected int numElements = Q;// number of elements in this collection// array to hold collectionas elementspublic boolean contains (T target)// Returns true if this collection contains an element e such that// set by find methodprotected boolean found: // true if target found, otherwise falseprotected int location: // indicates location of target if found// eeguals(target); otherwise, returns false.{find(target);return found3;public ArraySelectien(){elements = (T[]) new Object[DEFCAP];public T get(T target)// Returns an element e from this collection such that e.eguals(target);// if no such element exists, returns null.}{public ArrayCelectienlint capacity){elements = (T) new Object[capacity];}find(target);if (found)return elements[location];elsereturn null;protected void find(T target)// Searches elements for an occurrence of an element e such that// eeguals(target). If successful, sets instance variables// found to true and location to the array index of e. If// not successful, sets found to false.{int location = 0;found = false;}public boolean isEullO// Returns true if this collection is full; otherwise, returns false.{return (nwmElements == slementslensth);}public boglean isEmrtx0// Returns true if this collection is empty; otherwise, returns false.while (location < nwmElements){if (elements[location] eguals(target)){found = true;{return (nymElements == 0);}public int sizel)// Returns the number of elements in this collection.return;}{return nymElenments;}elselocation++;}}}public boglean add(T element)// Attempts to add element to this collection.// Returns true if successful, false otherwise.{if (isEullO)return false;else{elements[nwmElements) =DwmElements++;= element;return true;}}public boglean remove (T target)// Removes an element e from this collection such that eeguals(target)// and returns true; if no such element exists, returns false.{find(target);if (found){elements[location] = elementsinwmElements- 1);elementslowmElements - 1] = null;DWMElements-} public class SortedArraxCollection implements CollectionInterface {public boolean add(T element)// Precondition: element is Comparable to previously added objects//protected final int DEFCAP = 100; // default capacityprotected int origCan; // original capacityprotected TI elements; // array to hold collection elementsprotected int nymĒlements = 0; // number of elements in this collection// Adds element to this collection.{if (nwmElements =slements.Jength)enlarge();// set by find methodprotected boolean found; // true if target found, otherwise falseprotected int location; // indicates location of target if found,find(element); // sets location to index where element belongsþublic SortedAraxCollection() {for (int index = pwmElements: index > location; index--)elements[index] = elements[index - l];elements = (TLI) new Object[DEFCAP];origCan = DEFCAP;%3D%3Delements[location] = element;nwmElements++;return true;}public SottedAraxCollection(int capacity) {elements = (TE) new Object[capacity];this.origCan = capacity;}}public boolean temaxe(T target)// Removes an element e from this collection such that e.eguals(target)// and returns true; if no such element exists, returns false.{protected void enlarge)// Increments the capacity of the collection by an amount// equal to the original capacity.{find(target);if (found) {// Create the larger array.TII larger = (T[]) new Object[elemEntsJength+ origarl;for (int i= location; i<= nwmElements - 2; i++)elements[i] = elementsli + 1];elementslowmElements - 1] = null;numElements-;// Copy the contents from the smaller array into the larger array.for (int i = 0; i< nwmElements: it+) {}return found;larger[i] = elements[i];}}// Reassign elements reference.elements = larger;public int size)// Returns the number of elements on this collection.{%3D}return numElements:protected void find(T target)// Searches elements for an occurrence of an element e such that// e.eguals(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//}public boolsan contains(T target)// Returns true if this collection contains an element e such that// Eeauals(target); otherwise, returns false.{arrayindex where target should be inserted.find(target);return found;{location = 0;found = false;if (LisEmpty())}reckind(target, 0, nwmElements - 1);public T get(T target)// Returns an element e from this collection such that eeguals(target);// if no such element exists, returns null.{}protected void recEind(T target, int first, int last)// Used by find.{find(target);if (found)int result; // result of the comparisonif (first > last) {return elements[location];elsefound = false;return null;result = ((Comparable) target),compars:Tolelements[location]);if (result > 0)}%3Dlocation++; // adjust location to indicate insert indexpublic boolean isEmpty()// Returns true if this collection is empty; otherwise, returns false.{} else {location = (first + last) / 2;result = ((Comparable) target).compareTolelements[location]);if (resultreturn (numElements == 0);0) // found targetfound = true;}else if (result > 0) // target too highpublic boolean isEullO)// This collection is unbounded so always returns false.{veckind(target, location + 1, last);else // target too lowreckind(target, first, location - 1);return false;}}

According to our rules, we should answer only the first question when many questions are posted.…

Determine if the following statement are true or false screen shot shows the text's SortedArrayCollection and ArrayCollection When comparing two objects using the == operator, what is actually compared is the references to the objects. When comparing two objects using the equals method inherited from the Object class, what is actually compared is the references to the objects.

Determine if the following statement are true or false screen shot shows the text's SortedArrayCollection and ArrayCollection When comparing two objects using the == operator, what is actually compared is the references to the objects. When comparing two objects using the equals method inherited from the Object class, what is actually compared is the references to the objects.

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter9: Using Classes And Objects

Section: Chapter Questions

Problem 9E

See similar textbooks

Similar questions

C# Create class IntegerSet. Each IntegerSet object can hold integers in the range 0–100. The set is represented by an array of bools. Array element a[i] is true if integer i is in the set. Array element a[j] is false if integer j is not in the set. The parameterless constructor initializes the array to the “empty set” (i.e., a set whose array representation contains all false values.) • Provide the following methods: a) Method Union creates a third set that’s the set-theoretic union of two existing sets (i.e., an element of the third set’s array is set to true if that element is true in either or both of the existing sets—otherwise, the element of the third set is set to false). b) Method Intersection creates a third set which is the set-theoretic intersection of two existing sets (i.e., an element of the third set’s array is set to false if that element is false in either or both of the existing sets—otherwise, the element of the third set is set to true). c) Method…
Create class IntegerSet. Each IntegerSet object can hold integers 0 though n, where n can be different for different sets. The set is represented by an array of booleans. Array element a[i] is true if integer i is in the set. Array element a[j] is false if integer j is not in the set. Provide the following methods. Constructor IntegerSet(int n) creates an object with an array of size n with all cells set to false. Method union(IntegerSet set) creates a set that is the set-theoretic union of two existing sets (i.e., an element of the new set’s array is set to true if that element is true in at least one of the existing sets – otherwise, the new set’s element is set to false). Method intersection(IntegerSet set) creates a set which is the set-theoretic intersection of two existing sets (i.e., an element of the new set’s array is set to false if that element is false in at least one of the existing sets – otherwise, the new set’s element is set to true). Method insertElement(int n)…
code: public class PasswordGeneratorAndStorage {/*** Adds an application to the applications ArrayList. If index is -1, add application* to the end of applications. Else is index is within the size of applications, add* application at that index in applications. Otherwise, return. However, if applications * or application is null, return.* * @param applications* @param application* @param index*/public static void addApplication(ArrayList<String> applications, String application, int index) {// TODO: FILL IN BODY}/*** Generates a random password of length passwordLength and adds it to the end of* passwords if index is -1, or adds it to the index of passwords if index is within the* size of passwords (similar to how the addApplication adds an application). To generate* the random password, use rand to generate a random int within the size of characters. You* can then use this int to grab the char at that index in characters and concatenate that* to your String password variable.…
TaskDeclare and implement 5 classes: FloatArray, SortedArray,FrontArray, PositiveArray & NegativeArray.1- The FloatArray class stores a dynamic array of floats and itssize. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the end of the array.- Overloading for the insertion operator << to write the array to afile (ofstream)- Overloading for the extraction operator >> to read the arrayelements from the file (ifstream) and add them to the array.- A destructor to deallocate the array2- The SortedArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the right place in the arraysuch that the array remains sorted with every add. Don’t add tothe array then sort but rather add in the right place.3- The FrontArray inherits from FloatArray. It has:- A parameterized constructor that takes the array size.- An add method that adds a float at the front of…
****************************Instructions***************************** Add a "copy constructor" to your dynamic-array student. Remember, the prototype looks like: Classname(const classname& otherObject); Update your test program to use the copy constructor. e.g., CourseTypeList list2(list1); ********************************************************************* Submit: Updated test program, implementation and header files (.cpp and .h) for CourseListType and CourseType zipped into a single file. //courseTypeList.h #ifndef COURSELISTTYPE_H_INCLUDED#define COURSELISTTYPE_H_INCLUDED #include <string>#include "courseType.h" class courseTypeList { public:void print() const;void addCourse(std::string);courseTypeList(int n);~courseTypeList(); private:int NUM_COURSES;int courseCount;courseType *courses;}; #endif // COURSELISTTYPE_H_INCLUDED =============================================== //courseTypeList.cpp #include <iostream>#include <string>#include…
getListRowIndices Method public static java.util.ArrayList<java.lang.Integer> getListRowIndices(int[][] array, int rowLength) This method returns an ArrayList with the indices of rows of the two-dimensional having a length that corresponds to rowLength. You may only use one auxiliary method. The method should create an ArrayList that is passed to the auxiliary in order to place the indices (if any). If no indices are found, an empty (size of 0) ArrayList will be returned. You can assume the array parameter will not be null and every row of the two-dimensional array has an array with a size of at least 0. Your implementation must be recursive and you may not use any loop construct. Do not use ++ or -- in any recursive call argument. It may lead to an infinite recursion. For example, use index + 1, instead of index++. Parameters: array - rowLength - Returns: ArrayList<Integer>
//Need help fixing some issues with a project. PLEASE read below Write a Java program that implements both Linear Search and Binary Search. The program will take a collection of objects (generic type data) as input and print the number of comparisons needed to find a target element within that collection. You will create the following two Java classes:1. SearchCombo.java : Code for both linearSearch and binarySearch will be in this class. You may take help from the textbook Chapter 9, Section 9.1. However, note that the design requirements are different from the textbook code.•Both search methods must use the Comparable<T> interface and the compareTo() method.•Your program must be able to handle different data types, i.e., use generics.•For binarySearch, if you decide to use a midpoint computation formula that is different from the textbook, explain that formula briefly as a comment within your code. 2. Tester.java : This class will contain the main() method. The user will be…
Exercise #2 Implement an instance method belonging to the IntArrayBag class that takes two input parameters, oldVal and newVal. The method replaces each oldVal element in the array with newVal. Make sure to include the method header.
Use the ArrayList class Add and remove objects from an ArrayList Protect from index errors when removing Practice with input loop Details: This homework is for you to get practice adding and removing objects from an ArrayList. The Voter class was used to create instances of Voters which held their name and a voter identification number as instance variables, and the number of instances created as a static variable. This was the class diagram: The constructor takes a string, passed to the parameter n, which is the name of the voter and which should be assigned to the name instance variable. Every time a new voter is created, the static variable nVoters should be incremented. Also, every time a new voter is created, a new voterID should be constructed by concatenating the string “HI” with the value of nVoters and the length of the name. For example, if the second voter is named “Clark Kent”, then the voterID should be “HI210” because 2 is the value of nVoters and 10 is the number…
Write a Java class Course for dealing with courses. Your class must have the following features: Course - name: String - lineNumber: int - symbol: String - sections: ArrayList + Course() + Course(name: String, lineNumber: int, symbol: String) + getName(): String + getLineNumber(): int + getSymbol(): String + getSections(): ArrayList + addSection(section: Section): void + Override toString() method: you have to return needed data Fields values. addSection(section: Section) method add a section (number and the teacher for this section) to the array list of sections. Note: sectionNumber will be generated automatically. Write a Java class Section for dealing. Your class must have the following features: Section - number: int - teacher: Teacher - students: ArrayList + Section() + Section(number: int, techer: Teacher) + getNumber(): int + getTeacher(): Teacher + getStudents(): ArrayList + addStudent(student: Student): void + Override toString() method: you have to return needed data…
Create java program reads words from a text file, creates a ItemNode instance for each word (use type String), adds each NodeItem instance to a SinglyLinkedList class instance, then traverses this list recursively to display the words in the reverse original (FIFO) order they were added in. For instance, if you added the Strings "one", "two", "three" in that order, code the SinglyLinkedList print() method to display "one two three". You can do this by recursively traversing the list, then displaying each item as you return from each activation record. For instance, data "one two" should be displayed as "two one".
package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ } // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…