8:04 4. Complete the method public ArrayList 5. 6. 7. minToFront (ArrayList list), that adds a copy of the smallest value in list at index 0 (shifting the rest "down" one position) and returns the modified list. Be sure to remember the Integer class constants we learned for min and max values! Complete the method public ArrayList addOne (ArrayList list), that adds one to every element in list and returns the modified list. Complete the method public ArrayList 5G+ 22 removeDupes (ArrayList list), that removes the (back-to-back) duplicate value from list, only one value of the duplicate should remain in the list. Complete the method public ArrayList swapPairs (ArrayList list), that swaps every pair of numbers in list with the element immediately after it. So the first and second elements swap, the third and fourth elements swap, etc. If the ArrayList has an odd number of elements, the last element is ignored (remains the same). 8. Complete the method public ArrayList removeLenN (ArrayList list, int n), that removes all Strings with a length of n. Remember, the size of an ArrayList is dynamic – if you remove an element.

8:04 4. Complete the method public ArrayList 5. 6. 7. minToFront (ArrayList list), that adds a copy of the smallest value in list at index 0 (shifting the rest "down" one position) and returns the modified list. Be sure to remember the Integer class constants we learned for min and max values! Complete the method public ArrayList addOne (ArrayList list), that adds one to every element in list and returns the modified list. Complete the method public ArrayList 5G+ 22 removeDupes (ArrayList list), that removes the (back-to-back) duplicate value from list, only one value of the duplicate should remain in the list. Complete the method public ArrayList swapPairs (ArrayList list), that swaps every pair of numbers in list with the element immediately after it. So the first and second elements swap, the third and fourth elements swap, etc. If the ArrayList has an odd number of elements, the last element is ignored (remains the same). 8. Complete the method public ArrayList removeLenN (ArrayList list, int n), that removes all Strings with a length of n. Remember, the size of an ArrayList is dynamic – if you remove an element.

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

Import the ArrayList and List classes from the java.util package to create a list of phone numbers and also import the HashSet and Set classes from the java.util package to create a set of unique prefixes. Create a class called PhoneNumberPrefix with a main method that will contain the code to find the unique prefixes. Create a List called phoneNumbers and use the add method to add several phone numbers to the list. List<String> phoneNumbers = new ArrayList<>(); phoneNumbers.add("555-555-1234"); phoneNumbers.add("555-555-2345"); phoneNumbers.add("555-555-3456"); phoneNumbers.add("444-444-1234"); phoneNumbers.add("333-333-1234"); Create a Set called prefixes and use a for-each loop to iterate over the phoneNumbers list. For each phone number, we use the substring method to extract the first 7 characters, which represent the prefix, and add it to the prefixes set using the add method. Finally, use the println method to print the prefixes set, which will contain all of…
Create a class called MyArrayList and implement the methods below, in addition to a main method to testyour code. Focus on the special cases.1. Write a method intersect that accepts two sorted array lists of integers as parameters and returns anew list that contains only the elements that are found in both lists. Example: if lists named list1 andlist2 initially store:[1, 4, 8, 9, 11, 15, 17, 28, 41, 59][4, 7, 11, 17, 19, 20, 23, 28, 37, 59, 81]Then the call of intersect(list1, list2) returns the list:[4, 11, 17, 28, 59]Write a main method to test your code. Focus on the special cases2. Write a method reverse that reverses the order of the elements in an ArrayList of strings.3. Write a method capitalizePlurals that accepts an ArrayList of strings and replaces every word endingwith an "s" with its uppercased version.4. Write a method removePlurals that accepts an ArrayList of strings and removes every word in the listending with an "s", case-insensitively.5. Write a method called…
Create a DeleteDuplicatesclass which consists of a deleteDuplicates method which takes the nums list as its parameter. Implement the deleteDuplicates method: Check if the input list is null or empty, and return an empty list if so. Initialize a pointer i to keep track of the unique elements. Use a for loop to Iterate through the list using another pointer j which starts at j=1 and goes until j=nums.size(); If the current element at j is not equal to the previous element at i using !nums.get(i).equals(nums.get(j), increment i and set the current element at j to the new position at i using nums.set(i, nums.get(j)). After the for loop ends, return the sublist from the beginning to i + 1, as this will contain all unique elements. Call the deleteDuplicates method with the sample list as argument: Call the deleteDuplicates method and pass the nums list as argument Store the result in a variable result Print the result to the console. Input: [1, 1, 2, 3, 3,…
Provide a different implementation of ChoiceQuestion. Instead of storing the choices in an array list, the addChoice method should add the choice to the question text. For this purpose, an addLine method has been added to the Question class. Use the following files: Question.java /** A question with a text and an answer.*/public class Question{ private String text; private String answer; /** Constructs a question with empty text and empty answer. */ public Question() { text = ""; answer = ""; } /** Sets the answer for this question. @param correctResponse the answer */ public void setAnswer(String correctResponse) { answer = correctResponse; } /** Checks a given response for correctness. @param response the response to check @return true if the response was correct, false otherwise */ public boolean checkAnswer(String response) { return response.equals(answer); } /** Add a line of text to…
Write a method max() which take a generic singly linked list as an argument and returns the maximum element reference in the list. If the list is empty, please throw an empty collection exception. The method prototype is defined as follows. public static > T max(SingleLinkedList list) throws EmptyCollectionException You can use any of public methods in these following three classes: 1. The SingleLinkedList class diagram is as follows: SingleLinkedNode 1-SingleLinkedNodenext -T element O• SingleLinkedNodeg 9+SinglelinkedNode(T elem) +SingleLinkedlNode first SingleLinkedNode last int numNodes +SingleLinkedList) +void addFirst(T element)
Exercise 3: Provide a static method that checks whether a generic array list is a palindrome; that is, whether the values at index i and n- 1- i are equal to each other, where n is the size of the array list. Write a tester class to check your method.
Suppose that a list contains Comparable objects. Implement a method that returns a new list of items that are less than some given item. The header of the method could be as follows: public LListgetAllLess Than( Comparable anObject) Write an implementation of this method for the class LList. Make sure that your method does not affect the state of the original list.
Given the doubly linked list data structure discussed in the lecture, implement a subclass “DuplicateManipuationList” that has a new function for removing duplicates froma list.- Add a new method to your DuplicateManipuationList called removeDuplicates(…). Themethod takes as an argument called ListToRemove that is a singly linked list thatcontains some values. The method should scan the linked list for each member of theListToRemove, and remove all occurrences (not only the duplicates) of that member.Besides updating the DuplicateManipulationList, the removeDuplicates(…) functionshould return a new list that shows the number of duplicates for each deleted member.Note: That with inheritance:- You have a parent class called “Node” that contain [data, *next, *prev] and a sub classcalled “DuplicateManipuationList”
Write a method replace to be included in the class KWLinkedList (for doubly linked list) that accepts two parameters, searchItem and repItem of type E. The method searches for searchItem in the doubly linked list, if found then replace it with repItem and return true. If the searchItem is not found in the doubly linked list, then insert repItem at the end of the linked list and return false. Assume that the list is not empty. You can use ListIterator and its methods to search the searchItem in the list and replace it with repItem if found. Do not call any method of class KWLinkedList to add a new node at the end of the list. Method Heading: public boolean replace(E searchItem, E repItem) Example: searchItem: 15 repItem: 17 List (before method call): 9 10 15 20 4 5 6 List (after method call) : 9 10 17 20 4 5 6
Complete the method void addFirst(T item). It adds an item of type T to the front of the deque. It must not use any loops or recursion. Each operation must take constant time, that is, it does not depend on the deque's size. Additionally, if the item is null, instead of adding it into the deque, reject and throw an illegal argument exception. Here's the skeleton code // EXERCISE 6.2 ADD NOT NULL TO FRONT /** * Adds an non-null item of type T to the front of the deque. * @param item is a type T object. @throws IllegalArgumentException if the item is null. */ public void addFirst(T item) { }
1. Write a method called doubleListthat takes an ArrayList of strings as a parameter and replaces every string with two of that same string. For example, if the list stores the values ["how", "are", "you?"] before the method is called, it should store the values ["how", "how", "are", "are", "you?", "you?"] after the method finishes executing.In your program1, you also need to create a class namedProgram1.java, where you are going to construct some arralylists to test the doubleList within the static void main method. In the output, it will print out the original list and the new list after calling the doubleList method. 2.Write a method called filterRange that accepts an ArrayList of integers and two integer values min and max as parameters and removes all elements whose values are in the range min through max (inclusive). For example, if a variable calledlist stores the values [4, 7, 9, 2, 7, 7, 5, 3, 5, 1, 7, 8, 6, 7], the call of filterRange(list, 5, 7);should remove all values…
Java programming Do the same question with List Array Write a method with the name "eraser" that will get two arguments: “maparr_plants" (Map array of objects of a kind of class Plant), and "eraselist" (One dimensional array of integers). That method should erase the elements of the maparr_plants which their keys are matching the elements of the eraselist. (Hint: Check all elements of eraselist, and erase the matching (key) elements of the maparr_plants.) Solution: public static void eraser(Map maparr_plants, int [] eraselist) { for (i=0; i