Write a getMatching() method for the MyLinked List class. The method receives a linked list as parameter and must return a linked listwith all elements that are present in both lists. Example calling list:[5,2,7,3,1,4] parameter list: [8,9,2,1,4,2] returned list: [2,1,4]. Notethe uniqueness of items in the returned list.Write a test program to test the method thoroughly.Additional resources for assignmentpublic class MyLinkedList {private Node head, tail;public MyLinkedList ()head = null;}}/** Return the head element in the list */public E getFirst() {if (head == null) {return null;}}}/** Return the last element in the list */public E getLast () {if (head==null) {}}else {}}/** Add an element to the beginning of the list */public void prepend (E e) {Node newNode}}}else {}/** Add an element to the end of the list */public void append (E item) {Node newNode = new Node<> (item); // Create a new for elementif (head == null) {head = tail = newNode; // The new node is the only node in list}tail = null;return head.element;new Node<> (e) ; // Create a new nodenewNode.next = head; // link the new node with the headhead = newNode; // head points to the new nodethe new node is the only node in list}return null;if (tail == null)tail = head;/** Remove the head node andreturn the object that is contained in the removed node.public E removeFirst () {if (head == null) {return null;return tail.element;}else {tail.next = newNode; // Link the new with the last nodetail = newNode; // tail now points to the last node}{}else {E temp = head.element;}public boolean delete (E item)head = head.next;if (head == null) {tail = null;}return temp;}Node ptr = head;Node prvptr = null;while (ptr! = null && ( (Comparable) ptr.element) .compareTo (item) != 0){}}if (ptr == null) //item not foundreturn false;if (ptr=-head) // item is first elementhead- head.next;general caseelsepublic String tostring() {string result = " [";prvptr=ptr;ptr=ptr.next;if (ptr==tail) //tail-prvPtr;prvPtr.next-ptr.next;last elementreturn true;Node ptr = head;for (ptr= head; ptr !=null; ptr ptr.next){result += "]";return result;public void clear () {head = tail = null;result = result + ptr.element.tostring();if (ptr.next != null)result = result + ","; // add commas but not to the final 1Insert the closing ] in the stringprivate static class Node {E element;Node next;public Node (E element) {this.element = element;next = null;// end myLinkedList class

Linked List which refers to the part of the collection framework and it is present in utility…

Write a getMatching() method for the MyLinkedList class. The method receives a linked list as parameter and must return a linked list with all elements that are present in both lists. Example calling list:[5.2.7,3,1,4] parameter list: [8,9,2,1,4,2] returned list: [2,1,4]. Note the uniqueness of items in the returned list. Weit test the mothed the

Write a getMatching() method for the MyLinkedList class. The method receives a linked list as parameter and must return a linked list with all elements that are present in both lists. Example calling list:[5.2.7,3,1,4] parameter list: [8,9,2,1,4,2] returned list: [2,1,4]. Note the uniqueness of items in the returned list. Weit test the mothed the

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

Trying this again since part of my question keeps disappearing Given main() in the ShoppingList class, define an insertAtEnd() method in the ItemNode class that adds an element to the end of a linked list. DO NOT print the dummy head node. Ex. if the input is: 4 Kale Lettuce Carrots Peanuts where 4 is the number of items to be inserted; Kale, Lettuce, Carrots, Peanuts are the names of the items to be added at the end of the list. The output is: Kale Lettuce Carrots Peanuts public class ItemNode { private String item; private ItemNode nextNodeRef; // Reference to the next node public ItemNode() { item = ""; nextNodeRef = null; } // Constructor public ItemNode(String itemInit) { this.item = itemInit; this.nextNodeRef = null; } // Constructor…
Write a method max() that takes a reference to the first node in a linked list asargument and returns the value of the maximum key in the list. Assume that all keys arepositive integers, and return 0 if the list is empty
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
Given the MileageTrackerNode class, complete main() in the MileageTrackerLinkedList class to insert nodes into a linked list (using the insertAfter() method). The first user-input value is the number of nodes in the linked list. Use the printNodeData() method to print the entire linked list. DO NOT print the dummy head node. Ex. If the input is: 3 2.2 7/2/18 3.2 7/7/18 4.5 7/16/18 the output is: 2.2, 7/2/18 3.2, 7/7/18 4.5, 7/16/18 public class MileageTrackerNode { private double miles; // Node data private String date; // Node data private MileageTrackerNode nextNodeRef; // Reference to the next node public MileageTrackerNode() { miles = 0.0; date = ""; nextNodeRef = null; } // Constructor public MileageTrackerNode(double milesInit, String dateInit) { this.miles =…
Implement an instance method, called getFirstHalf, that belongs to yourThingLinkedBag. The method returns as output a linked list that includes allvalues in the first half of the bag's linked list. For example, for the following bag3-->5-->8-->9. the method returns 3-->5.If the bag includes an odd number of nodes, then the middle element belongs tothe first half and is included in the output.Make sure to include the methodheader. The bag should remain unchanged (i.e., do not remove the returnedvalues from the bag).
Write a method for the Linked Based List class which returns the largest item in the list. If the list is empty return null. Assume that class T is Comparable.DO NOT USE ANY OTHER METHODS OF THE LINKED BASED LIST CLASS. What is the worst case and best case complexity of the code in the previous problem? Explain your answer.
Write a Method Called makePalindrome() that will return a linked list with a palindrome of the calling list. Example [1,2,3] must return [1,2,3,3,2,1] and [8,9,1,4] must return [8,9,1,4,4,1,9,8].
Implement a method to remove a node in the middle of a singly linked list (i.e., any node except the first and last node, not necessarily the exact middle), given only access to that node.EXAMPLElnput:the node c from the linked list a->b->c->d->e->fResult: nothing is returned, but the new linked list looks like a ->b->d->e->f
Given two linked lists sorted in increasing order, write a method intersection( ) to return a new list representing the intersection of the two lists. The new list should be made with its own memory — the original lists should not be changed. Example: if list1 contains {3,4,7,9,11} and list contains {2,3,8,9,12,15} so the intersection list3 is {3,9}.
Implement unique method that takes an ArrayList as input and returns an ArrayList withexactly a single occurrence of each element from the input list. For example, if the input listcontains 5, 6, 7, 6, 3, 5, 5, 4 then the output list should have 5, 6, 7, 3, 4.Note: (1) You may assume that the ArrayList has a specific type of elements in it. In the class, we assumedit to have String type values. (2) You may only work with ArrayList(s).
Build doubly-linked lists using a nested class called DoubleNode, where each node includes a reference to the item before it and the item after it in the list (null if there is no such item). Then put in place static methods for inserting at the start, inserting at the end, removing from the start, removing from the finish, inserting before a given node, inserting after a given node, and removing a given node.
Java: Write a method/programme that will take a generic linked list and make a palindrome of the list. In a seperate test programme the user can add any elements to the generic list and then this list must be made a palindrome. The output should be the original list with the palindrome list added to this list.