Study the code below:1. public_(MyLinkedList sList){2. if(this.head==null)||(sList.head3D%3Dnull))3.return false;4.5.boolean test = false;6.for(NodeptrsList=sList.head;ptrsList!=null;ptrsList=ptrsList.next)7.{8.test = false;9.for(Nodeptrthis=this.head;ptrthis!=null;ptrthis=ptrthis.next)10.{11.if(ptrsList.element.equals(ptrthis.element))12.{13.test = true;14.ptrthis=this.tail;15.16.}17.if(!test)18.return false;19.20.}21.return test;22.}Select the test program call for this method?O A. System.out.printin(myList1.split();O B. System.out.printin(myList1.reverseOrder();O C. System.out.printin(myList1.isSubList(myList2);O D. System.out.printin(myList1.sharedElements(myList2));O E. System.out.println(myList1.cquals(myList2);O F. System.out.printin(list.deiete()ssion(5);O G. System.out.println(myList1.delDuplicate();Add a caption..

A linked list is a linear collection of data elements whose order is not given by their physical…

Answered: Select the test program call for this…

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

Similar questions

Help
Write a class that would match a string. The class has method match with String as a return type. It accepts two inputs: the phrase/sentence string (text) and the pattern string (word). This method finds the first (or all) instances of the pattern in the text and changes that word in all uppercase and return the new phrase. Method countOccurence accepts a phrase/sentence and a pattern string and returns its number of occurrences. Add a main method that will allow the user to input the phrase/sentence and pattern. Call method match and countOccurence. See test case below. Sample Input: Text string: You will always have my love, my love, for the love I love is as lovely as love itself. Pattern string: love Output: New text: You will always have my LOVE, my LOVE, for the LOVE I LOVE is as lovely as LOVE itself. Number of occurrence: 5 For example: Input Result You will always have my love, my love, for the love I love is as lovely as love itself. love New text: You will…
4. Now examine the ArrayList methods in the above table, a) Which method retrieves elements from the ArrayList? b) Which method replaces the value of an element that already exists in the ArrayList? c) Which two methods initializes the value of an element? d) How do the two methods in (c) differ? Which method(s) would be appropriate in the above Java program (after we convert it to work with ArrayLists)?
The play method in the Player class of the craps game plays an entire game without interaction with the user. Revise the Player class so that its user can make individual rolls of the dice and view the results after each roll. The Player class no longer accumulates a list of rolls, but saves the string representation of each roll after it is made. Add new methods rollDice, getNumberOfRolls, isWinner, and isLoser to the Player class. The last three methods allow the user to obtain the number of rolls and to determine whether there is a winner or a loser. The last two methods are associated with new Boolean instance variables (winner and loser respectively). Two other instance variables track the number of rolls and the string representation of the most recent roll (rollsCount and roll). Another instance variable (atStartup) tracks whether or not the first roll has occurred. At instantiation, the roll, rollsCount, atStartup, winner, and loser variables are set to their appropriate…
Write the compareTo method for a class describing a person whose nameis stored as two Strings: first and last. A person is “less than” another if theyappear before the other in a list alphabetized by last name and then first name(as is typical).
Implement the 4 methods marked ''// Your Code' in the OurListSet class. public boolean addAll(OurSet<E> set) public boolean containsAll(OurSet<E> set) public boolean removeAll(OurSet<E> set) public boolean retainAll(OurSet<E> set) (note: this was written in BlueJ) Here is the full code for OutListSet.java: import java.util.Iterator; /** * Write a description of class OurListSet here. * * @author (your name) * @version (a version number or a date) */public class OurListSet<E> implements OurSet<E>{ private OurList<E> list; /** * Constructor for objects of class OurListSet */ public OurListSet() { this(new OurArrayList()); } // Designated Constructor public OurListSet(OurList<E> newList) { list = newList; } private class OurListIterator<E> implements Iterator<E> { private OurList<E> listToIterateOver; private int position; public…
In Java, please. Complete the Course class by implementing the findStudentHighestGpa() method, which returns the Student object with the highest GPA in the course. Assume that no two students have the same highest GPA. Given classes: Class LabProgram contains the main method for testing the program. Class Course represents a course, which contains an ArrayList of Student objects as a course roster. (Type your code in here.) Class Student represents a classroom student, which has three fields: first name, last name, and GPA. (Hint: getGPA() returns a student's GPA.) Note: For testing purposes, different student values will be used. Ex. For the following students: Henry Nguyen 3.5 Brenda Stern 2.0 Lynda Robison 3.2 Sonya King 3.9 the output is: Top student: Sonya King (GPA: 3.9) LabProgram.java import java.util.Scanner; public class LabProgram { public static void main(String args[]) { Scanner scnr = new Scanner(System.in); Course course = new Course(); int…
Implement a “To Do” list. Tasks have a priority between 1 and 9, and a description (which you can come up with on your own, say, “wash dishes”). The program is going to prompt the user to enter the tasks by running the method add_priority_description, the program adds a new task and prints the current list with priority 1 tasks on the top, and priority 9 tasks at the bottom. The program will continue to ask the user if they want to add another tasks, and repeat the add_priority_description method, or enters Q to run the quit method to quit the program. Sample output (not limited to) 1. Study for the final 1. Take the final 2. Watch Justice League with friends 3. Play ball 9. Wash Dishes 9. Clean room. There is a possibility of two tasks having the same priority. If so, the last task that was entered gets to be printed first. Use HEAP in your solution.
In Java: -Using a BST Interface (Binary Search Tree) -Create a class Disk. Disk contains four fields: model (String), size (int), measure (String, for GB or TB), and performance index (int). -Disk needs a constructor to initialize all fields, a toString method, and an equals. Make the class Comparable and write a compareTo method that compares Disks based on the size of the disk. Make sure your comparison accounts for the fact that some numbers are in GB and some are in TB. Write a method that will return true if the disk is the same size as the parms; parms are the size and measure("GB" or "TB"). Also write a method to create a Comparator which compares Disks based on the performance rating. -The client code should do the following: Write a function called build, which will open the disks.txt file, read in each disk and add it to the BST. For each disk the model is on the first line, and the second line contains the size, measure, and performance index. The BST is passed to build as…
Which of the above choices (A, B, C or D) prints the name of each animal in the animalList object created from a previous question?// Assume that these accessor and mutator methods exist in the Animal class: // public void setAnimalName(String newName) { ... } // public String getAnimalName() { ... } // A for(int i = 0; i < animalList.length(); i++) { Animal tempAnimal = animalList[i]; System.out.println( tempAnimal.getAnimalName()); } // B for(int i = 0; i < animalList.length; i++) { Animal tempAnimal = animalList[i]; System.out.println( tempAnimal.getAnimalName()); } // C for(int i = 0; i < animalList.length; i++) { Animal tempAnimal = animalList[i]; System.out.println( tempAnimal.setAnimalName()); } // D for(int i = 0; i < animalList.length; i++) { Animal tempAnimal = animalList[i]; System.out.println(tempAnimal.animalName); }

Recommended textbooks for you

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)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

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)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS