Could somebody assist me with me? I'd very much appreciate it *24.3 (IMPLEMENT A DOUBLY LINKED LIST) The MyLinkedList class used in Listing24.5 is a one-way directional linked list that enables one-way traversal of the list.Modify the Node class to add the new data field name previous to refer to the previousnode in the list, as follows:public class Node {E element;}Node next;Node previous;public Node (E e) {element = e;} Implement a new class named TwoWayLinkedList that uses a doubly linked list tostore elements. Define TwoWayLinkedList to implements MyList. You need toimplement all the methods defined in MyLinkedList as well as the methodslistIterator () and listIterator (int index). Both return an instance ofjava.util.ListIterator (see Figure 20.40). The former sets the cursor to thehead of the list and the latter to the element at the specified index. Test your new classusing this code from https://liveexample.pearsoncmg.com/test/Exercise24_03.txt.

Linked list The most popular data structure for processing elements of dynamic data is a linked…

*24.3 (IMPLEMENT A DOUBLY LINKED LIST) The MyLinkedList class used in Listing 24.5 is a one-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field name previous to refer to the previous node in the list, as follows: public class Node { E element; Node next; Node previous; public Node (E e) { element = e; }

*24.3 (IMPLEMENT A DOUBLY LINKED LIST) The MyLinkedList class used in Listing 24.5 is a one-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field name previous to refer to the previous node in the list, as follows: public class Node { E element; Node next; Node previous; public Node (E e) { element = e; }

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

9.5 Write a method of SinglyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive—it shouldmodify the list upon which it acts.9.6 Write a method of DoublyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive.
9.5 Write a method of SinglyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive—it shouldmodify the list upon which it acts.9.6 Write a method of DoublyLinkedList, called reverse, that reverses theorder of the elements in the list. This method should be destructive.9.7 Write a method of CircularList, called reverse, that reverses theorder of the element in the list. This method should be destructive.9.8 Each of the n references in a singly linked list are needed if we wishto remove the final element. In a doubly linked list, are each of the additional n previous references necessary if we want to remove the tail of thelist in constant time? (Hint: What would happen if we mixed Nodes andDoublyLinkedNodes?)
9.9 Design a method that inserts an object into the middle of a CircularList.9.10 Which implementation of the size and isEmpty methods would you use if you had the potential for a million-element list. (Consider the problem of keeping track of the alumni for the University of Michigan.) How would you choose if you had the potential for a million small lists. (Consider the problem of keeping track of the dependents for each of a million income-tax returns.)
7.4 LAB: Find student with highest GPA Complete the Course class by implementing the findStudent Highest Gpa() 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)
python 8.7 LAB: Writing append and search methods (singly-linked list)Given main.py and a Node class in Node.py, complete the LinkedList class in LinkedList.py by writing the append() and search() methods. The search() method should return the Node whose data value matches a given key, and None if the key is not found. The search() method should also set the position of each Node searched in the LinkedList, starting with 1. Ex: If the input is: 12 23 59 37 923 212the output is: 12 found in list at position 1.If the input is: 12 23 59 37 923 268the output is: 68 not found in list.
9.7 Write a method of CircularList, called reverse, that reverses the order of the element in the list. This method should be destructive.9.8 Each of the n references in a singly linked list are needed if we wish to remove the final element. In a doubly linked list, are each of the additional n previous references necessary if we want to remove the tail of the list in constant time? (Hint: What would happen if we mixed Nodes and DoublyLinkedNodes?)
(Implement a doubly linked list) The MyLinkedList class used in Listing 24.6 is a one-way directional linked list that enables one-way traversal of the list. Modify the Node class to add the new data field name previous to refer to the previous node in the list, as follows:public class Node<E> { E element; Node<E> next; Node<E> previous;public Node(E e) { element = e; } }Implement a new class named TwoWayLinkedList that uses a doubly linked list to store elements. The MyLinkedList class in the text extends MyAbstractList. Define TwoWayLinkedList to extend the java.util.AbstractSequentialList class. You need to implement all the methods defined in MyLinkedList as well as the methods listIterator() and listIterator(int index). Both return an instance of java.util. ListIterator<E>. The former sets the cursor to the head of the list and the latter to the element at the specified index.
13.2 (Suffle ArrayList) Write the following method that suffle an ArrayList of the numbers: public static void suffle(ArrayList<Number> list)
sohe g Jaua *11.13 (Remove duplicates) Write a method that removes the duplicate elements from an array list of integers using the following header: public static void removeDuplicate(ArrayList list) Write a test program that prompts the user to enter 10 integers to a list and dis- plays the distinct integers in their input order and separated by exactly one space. Here is a sample run: Enter 10 integers: 34 5 3 5 6 4 33 22 4 tnter The distinct integers are 34 5 3 6 4 33 2
11.10 Write the compareTo method for a class that is to be ordered by a field,key, which is a double. Be careful: The result of compareTo must be an int.11.11 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).
9.5.1: Use the addChoice method to add any needed instance variables. 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. ChoiceQuestion.java: /** A question with multiple choices.*/public class ChoiceQuestion extends Question{ // Add any needed instance variables, but don't store the choices // The choices should be added to the text of the superclass /* Your code goes here */ /** Constructs a choice question with a given text and no choices. @param questionText the text of this question */ public ChoiceQuestion(String questionText) { /* Your code goes here */ } /** Adds an answer choice to this question. @param choice the choice to add @param correct true if this is the correct choice, false otherwise */ public void…
8.14 LAB: Mileage tracker for a runner Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the InsertAfter() function). The first user-input value is the number of nodes in the linked list. Use the PrintNodeData() function 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 Main.cpp: #include "MileageTrackerNode.h"#include <string>#include <iostream>using namespace std; int main (int argc, char* argv[]) {// References for MileageTrackerNode objectsMileageTrackerNode* headNode;MileageTrackerNode* currNode;MileageTrackerNode* lastNode; double miles;string date;int i; // Front of nodes listheadNode = new MileageTrackerNode();lastNode = headNode; // TODO: Read in the number of nodes // TODO: For the read in number of nodes, read// in data and insert into the linked list // TODO: Call the PrintNodeData()…