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 -SingleLinkedNode next -T element SingleinkedNode) +SingleLinkedNode(T elem) +SingleLinkedNode getNext) Yold setNext(SingleLinkedNode first SingleLinkedNode last int numNodes SingleLinkedist) O+void addFirst(T element)

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 -SingleLinkedNode next -T element SingleinkedNode) +SingleLinkedNode(T elem) +SingleLinkedNode getNext) Yold setNext(SingleLinkedNode first SingleLinkedNode last int numNodes SingleLinkedist) O+void addFirst(T 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

Assignment1: Analyse the case study given in chapter 3 Linked listAnswer the following questions from Library.java1. Write the different class names with class keyword chapter 3 Linked list : https://drive.google.com/file/d/1NRN_3Fx3smkjwv1jgG8hzaiGfnNfeeDb/view?usp=sharing
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) { }
The two classes you will create will implement the operations defined in the interface as shown in the UML class diagram above. In addition, BinarySearchArray will implement a static method testBinarySearchArray() that populates the lists, and lets the user interactively test the two classes by adding and removing elements. The parameter BinarySearch can represent either class and tells testBinarySearchArray which class to test. Steps to Implement: 1) To get started create a new project in IntelliJ called BinarySearch. Add a class to your project called BinarySearchArray. Then add another class BinarySearchArrayList and an interface called BinarySearch. The interface BinarySearch includes public method stubs as shown in the diagram. You are allowed to add BinarySearchArrayList to the same file as BinarySearch but don't add an access modifier to this class, or for easier reading, you can declare the classes in separate files with public access modifiers. Only the class…
public class PokerAnalysis implements PokerAnalyzer { privateList<Card>cards; privateint[]rankCounts; privateint[]suitCounts; /** * The constructor has been partially implemented for you. cards is the * ArrayList where you'll be adding all the cards you're given. In addition, * there are two arrays. You don't necessarily need to use them, but using them * will be extremely helpful. * * The rankCounts array is of the same length as the number of Ranks. At * position i of the array, keep a count of the number of cards whose * rank.ordinal() equals i. Repeat the same with Suits for suitCounts. For * example, if your Cards are (Clubs 4, Clubs 10, Spades 2), your suitCounts * array would be {2, 0, 0, 1}. * * @param cards * the list of cards to be added */ publicPokerAnalysis(List<Card>cards){ this.cards=newArrayList<Card>(); this.rankCounts=newint[Rank.values().length]; this.suitCounts=newint[Suit.values().length];…
Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers: 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?* 31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 17 -> 34 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 57 ->91 31 -> 32 -> 43 -> 17 -> 34 -> 57 31 -> 32 -> 43 -> 57 ->91 31 -> 32 -> 43 -> 34 -> 57 ->91
Java
CODE IN JAVA METHOD TO FIND PAIRS IN AN ARRAY LIST THAT CAN BE MULTIPLIED TOGETHER TO GET PARAMETER Complete the method findPairs which receives an array of integers and an intand returns an ArrayList of instances of Pair (this class is available in theQuestion.java file). You should search the array for any two ints whose product(i.e. when multiplied) is equal to the int parameter. When you find a pair, createan instance of Pair and add it to the ArrayList to be returned. The order of thevariables in the constructor is irrelevant. Do not modify the Pair class. Example 1:Array contains (1, 1, 1, 2, 2, 1, 1, 1)int parameter = 4The ArrayList should contain one instance of Pair with the values (2, 2). Example 2:Array contains (1, 2, 3, 4, 5, 6, 7, 8)int parameter = 12The ArrayList should contain two instances of Pair with the values (2, 6) and(3, 4) Example 3:Array contains (1, 1, 1, 1, 1, 1)int parameter = 3The ArrayList should be empty as there are no ways to compute the product of…
Question 5 Assume that the following method is in a class called DLL (not same as KWLinkedList). What does this method do? public void method_LI( ) { KWLinkedList<Integer> list = new KWLinkedList<Integer>( ); list.add(2); list.add(-1); list.add(0); list.add(1); list.add(0); ListIterator<integer> iter = list.listIterator(); while(iter.hasNext()) { if (iter.next() == 0) iter.remove(); } if( iter.hasPrevious() ) System.out.println("END"); else while(iter.hasNext()) System.out.print(iter.next() + " "); } Removes the nodes having 0 as its data and prints END. Removes the nodes having 0 as its data and prints 2 -1 1 Removes the nodes having 0 as its data and prints 1 -1 2 Prints 2 -1 0 1 0 without removing anything.
Writing a program that helps to enter patients information:● Write a class patientInfo which contains the following data and methods:• Data:PatientName (String).PatientID (int).• Methods:Getter and Setter for each data item.toString method.● Display this menu:1:Merging two Single Linked List structure type2:Merging two Stacks data structure type3:Merging two Queses data structure type4:Merging Single Linked List with Stack to Linked List5:Merging Single Linked List with Queue to Linked List6:Merging Singly Linked List with Stack only Patient’s name that start with S to Queue● Ask the user to choose the data structure type from a given list to be merged.If you choose any of the above options:1.You must request [the size of data structures and patient information] from the user.2. Print the data structure before the merge.3. Print data structure after the merge.
In Java please help with the following: Sees whether this list is empty.@return True if the list is empty, or false if not. */ public boolean isEmpty(); } // end ListInterface Hint:Node class definition should look something like: public class Node<T> { T element; Node next; Node prev; public Node(T element, Node next, Node prev) { this.element = element;this.next = next;this.prev = prev; } }
java Create a static method that: is called repeatAll returns ArrayList of Booleans takes in a single parameter - an ArrayList of Booleans This method should modify its ArrayList parameter by repeating its ArrayList values. For example, if the parameter is (true, false, false) The modified ArrayList should be (true, false, false, true, false, false) public static void main(String[] args) { Scanner in = new Scanner(System.in); int size = in.nextInt(); ArrayList<Boolean> list = new ArrayList<>(); for(int i=0; i < size; i++) { list.add(in.nextBoolean()); } System.out.println(repeatAll(list)); } }
Implement a LinkedList class that stores integers using dynamic memory and a proper main program to test it. The following member functions need to be properly implemented and tested: 1. Default constructor. 2. Parmetrized Constructor. 3. Sum. 4. Average. 5. InsertAtHead. 6. InsertAtTail. 7. Delete. 8. Pop. 9. Circular. 10. Display. Sample answer is also provided.