Write a method called copyConditional to be included in the class SingleLinkedList that accepts a parameter listl of type SingleLinkedList and item oftype E. If "this" list is empty, it will return false, otherwise, it will copy the elements of "this" list to listl which are smaller than item. Assume that list1 isinitially empty. Do not call any method of class SingleLinkedList.Method heading:public boolean copyConditional (SingleLinkedList listl, E item)Note: Copy here means creating and adding new nodes in list1.Example : item = 10Before method call: "this" list: 17 8 6 512 9 16list1:( empty )After method call: "this" list: 176 55 9812 9 16list1:86

Method Definition: public boolean copyConditional(SinglyLinkedList<E> list1, E item) {if…

Write a method called copyConditional to be included in the class SingleLinkedList that accepts a parameter listi of type SingleLinkedList and item of type E. If "this" list is empty, it will return false, otherwise, it will copy the elements of "this" list to listi which are smaller than item. Assume that listl is initially empty. Do not call any method of class SingleLinkedList. Method heading: public boolean copyConditional (SingleLinkedList listi, E item) Note: Copy here means creating and adding new nodes in list1. Example : item = 10 Before method call: "this" list: 17 8 6 5 ( empty ) 12 9 16 list1: After method call: "this" list: 17 6 5 5 9 8 12 9 16 list1: 6

Write a method called copyConditional to be included in the class SingleLinkedList that accepts a parameter listi of type SingleLinkedList and item of type E. If "this" list is empty, it will return false, otherwise, it will copy the elements of "this" list to listi which are smaller than item. Assume that listl is initially empty. Do not call any method of class SingleLinkedList. Method heading: public boolean copyConditional (SingleLinkedList listi, E item) Note: Copy here means creating and adding new nodes in list1. Example : item = 10 Before method call: "this" list: 17 8 6 5 ( empty ) 12 9 16 list1: After method call: "this" list: 17 6 5 5 9 8 12 9 16 list1: 6

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

Write a method called insertSorted to be included in class SingleLinkedList that accepts a parameter item of type E. Assume that the list is sorted in ascending order. The method will insert a new node in the list containing item as data in such a way that after insertion also the list remains sorted. Consider all possible cases in your method, including empty list. Do not call any method of class SingleLinkedList in your method.       Example : Before run:                     head                                       list:     5    10     20    30     35     50    item =   25       After run:                     head                     list:     5    10     20    25   30     35     50    Method heading: public boolean insertSorted(E item) {
Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run:    front                  rear “this” queue: 10 29   2   2 5 10 Item1: 100 After run:                               front                                   rear “this” queue: 100   29    100     100   5    100
Write a static method called "removeDuplicates" that takes an ArrayList of Strings as a parameter. It should first sort the ArrayList using the sort function of the Containers helper class and then remove any duplicates so that only one of any series of duplicates remains in the ArrayList. For example, suppose that the parameter is an ArrayList named a containing:     ["clam", "squid", "squid", "squid", "clam", "octopus", "octopus", "shrimp"] Then after calling “removeDuplicates(list)” the ArrayList a should contain:            ["clam", "octopus", "shrimp", "squid"] Please note: quotation marks would not appear in the actual output of the ArrayList, they are only included here for clarity. The actual ArrayList output would be:     [clam, octopus, shrimp, squid] You may use the following code to test your program: Expected output is listed to the right of the print statement. import java.util.*;public class RemoveDuplicates {  public static void main(String[] args) {…
Write a static method called "flip4" that takes an ArrayList of integer values as a parameter and that rewrites successive sequences of four values in the list. For each sequence of four values, the method will swap the first element and the fourth element and then swap the second element with the third element. For example, suppose that a variable called list stores the following sequence of values: [3, 8, 19, 42, 7, 26, 19, -8, 193, 204, 6, -4] and we make the following call: flip4(list); Afterwards the list should store the following sequence of values: [42, 19, 8, 3, -8, 19, 26, 7, -4, 6, 204, 193] Each sequence of three elements will be rotated so that the 3rd value becomes the 1st value and the other two are moved to the next higher index; ie. the 1st becomes the 2nd and the 2nd becomes the 3rd. If the list has extra values that are not part of a sequence of three, those values are unchanged. For example, if the list had instead stored: [3, 8, 19, 42, 7, 26, 19,…
Write a method called clump that accepts an ArrayList of strings as a parameter and replaces each pair of strings with a single string that consists of the two original strings in parentheses separated by a space. If the list is of odd length, the final element is unchanged. For example, suppose that a list contains ["four", "score", "and", "seven", "years", "ago", "our"]. Your method should change the list to store [" (four score)", ("and seven"), ("years ago"), "our"].
Write a class in python that can store the date and place information (as strings) and can produce a string that represents all of the information that is hold in a list. For example: the following list my have len 3 or len 2 or 1. It should have a method that print the output like: "Birth 01 Aug 1990" Date =["1", "Aug", "1990"] Date2 = ["11", "22", "2003"] Date3= ["2017"] It should have a method that does the same for a place, so if you had to call the methods for a list that has: place= ["Miami"] place2 =["Portland", "Oregon"] It should print like "Place: Miami" or "Place: Portland, Oregon"
Write a static method named "bigBeforeSmall" that accepts an array of Strings as a parameter and rearranges its elements so that longer Strings appear before shorter Strings. For example, if the following array is passed to your method: String[] numbers = { "one", "twelve", "three", "four", "fourteen", "six" }; Then after the method has been called, one acceptable ordering of the elements would be: ["fourteen", "twelve", "three", "four", "one", "six" ] The exact order of the elements does not matter, so long as all longer Strings appear before all shorter Strings. Another acceptable order would be: ["fourteen", "twelve", "three", "four", "six", "one" ] Do not make any assumptions about the length of the array or the range of values it might contain. For example, the array might contain empty Strings (length zero), or all Strings could have the same length. You may assume that the array is not null (empty). Hint: This is actually a sorting problem. In BubbleSort you tested pairs…
Assume that the following is a method in class LinkedListExample and class KWLinkedList as explained in the lectures is available for use. What does the following non-member method do? public static<E> void uknownMethod( KWLinkedList<E> list1, E value1, E value2) { ListIterator<E> iter = list1.listIterator(); int i; while (iter.hasNext()) { if (iter.next().equals(value1)) i = iter.nextIndex(); list1.add(i-1, value2); } } If value1 exists in list1, then it adds value2 before one node from value1 in list1. If value1 exists in list1, then it adds value2 before value1 in list1. If value1 exists in list1, then it adds value2 after value1 in list1. If value1 exists in list1, then it adds value2 after one node from value1 in list1.
Write a method markLength4 that takes an ArrayList of Strings as a parameter and that places a String of four asterisks ("****") in front of every String of length 4. For example, suppose that an ArrayList called "list" contains the following values: (this, is, lots, of, fun, for, every, Java, programmer) And you make the following call: markLength4(list); Then list should store the following values after the call: (****, this, is, ****, lots, of, fun, for, every, ****, Java, programmer) Notice that you leave the original Strings in the list (this, lots, Java) but include the four-asterisk String in front of each to mark it. You may assume that the ArrayList contains only String values, but it might be empty.
Write a method called swapltems to be considered within the SingleLinkedList class that takes two parameters, index1 and index2 of type integer. The method swaps the data of the nodes at the given indexes. If any of the parameters indexes is invalid throw IndexOutOfBoundsException. Do not call any method of class SingleLinkedList in your method. Method heading: public void swapltems(int index1, int index2) Example: index1 = 2 index2 = 4 Before method call: list: 5 10 12 9 11 7 After method call: list: 5 10 11 9 12 7
. For the TimeSpan class described below, add a compareTo method that takes another TimeSpan object as a parameter & returns: -1 if this TimeSpan is SMALLER than to the TimeSpan object passed in as a parameter 0 if both TimeSpans are the same 1 if this TimeSpan is GREATER than the TimeSpan object passed in as a parameter Add code, as needed, to allow the Collections class to sort the ArrayList of TimeSpan objects import java.util.*; public class TimeSpan implements { private int hours; private int minutes; public TimeSpan(int hours1, int minutes1) { hours = 0; minutes = 0; add(hours1, minutes1); } public void add(int hours1, int minutes1) { hours += hours1; minutes += minutes1; while (minutes > 60) { minutes -= 60; // convert 60 min --> 1 hour hours++; } } public void add(TimeSpan time) { add(time.hours, time.minutes); }…
Implement a new class that implements Comparatorof GregorianCalendar class to be able sort the calendar in increasingorder based on day, month, and year, in that order. Write a method to displaythe GregorianCalendar instance in “dd-MMM-yyyy” format usingSimpleDateFormatclass. Write a test program with 10 GregorianCalendarinstances and display the results after the sort.