I have a doubly linked list named mylist. mylist has a pointer named head which has the address of the first node in the list. mylist has a pointer named tail which hasthe address of the last node in the list. head and tail are both null if the list is empty.Each node in the list is of type mynode. mynode has a pointer named forward which holds the address of the next node in the list. mynode has a pointer named backwhich holds the address of the prior node in the list. The first node in the list has a null back pointer. The last node in the list has a null forward pointer.mylist has a method called addatend with one parameter of type mynode named input. This method will place the new input node at the end of the list. The pointer ininput is null.Which of the following code segments does that correctly?O void addatend(mynode input){tail.forward input;tail = input;}O void addatend(mynode input){tail.forward input;tail = input;}O void addatend(mynode input){if(tail == null) {head = input;tail = input;}else {}tail = input;input.back = tail;tail.forward input;O void addatend(mynode input){if(tail == null) {head = input;}else {input.back = tail;tail.forward input;}tail = input;}

The correct answer is C. void addatend(mynode input)[ if(tail == null) head = input: tail = input:…

Answered: I have a doubly linked list named…

Engineering

Computer Science

I have a doubly linked list named mylist. mylist has a pointer named head whi

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

Provide an explanation for the primary distinction that exists here between collection and an arraylist.
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
Has to be done in Java. Import ArrayList.
Implement a program that creates an unsorted list by using a linked list implemented by yourself. NOT allowed to use LinkedList class or any other classes that offers list functions. It is REQUIRED to use an ItemType class and a NodeType struct to solve this. Use C++! The “data.txt” file has three lines of data 100, 110, 120, 130, 140, 150, 160 100, 130, 160 1@0, 2@3, 3@END You need to create an empty unsorted list add the numbers from the first line to list using putItem() function. Then print all the current keys to command line in one line using printAll(). delete the numbers given by the second line in the list by using deleteItem() function. Then print all the current keys to command line in one line using printAll().. putItem () the numbers in the third line of the data file to the corresponding location in The list. For example, 1@0 means adding number 1 at position 0 of the list. Then print all the current keys to command line in one line…
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
This one in c++.
Wap java code to ArrayList represents an array implementation of a list. The front of the list is kept at array index 0. This class will be extended to create a specific kind of list.
QUESTION 1 Write a Java Program to do the following: Create an LinkedList object and store 5 different Integer objects. • Using a Listiterator do the following: o Compute sum of all even numbers only.
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.
1- A new static method with one parameter which is a head node for a linked list of integers, the method should create a new linked list which is equivalent to the original list of integers but with all repetitions removed, the method's return value is a head reference for the new list. this is what I have but it's not removing repetitions. public static IntLinkedBag removeRepetition (IntLinkedBag b1) { IntNode next; IntNode head = null; LinkedList<Integer> s = new LinkedList<>(); IntNode new_list = new IntNode(0, null); IntNode now = head; IntNode prev = new_list; while (now!= null) { int x = now.data; if (s.contains(x)) { new_list = new_list.next; } else { s.add(x); new_list.next = new IntNode(x, now); new_list = new_list.next; } now = now.next; } return b1; } }…
Assume that NamesList is an object of class type SingleLinkedList of Java and it has the following values: "Ahmed" "Mona" "Noor" the instruction NamesList.add (1, "Eman"); NamesList.set (0, "Abdulla"); will change the list to : A "Eman" "Ahmed" "Mona" "Noor" B) "Abdulla" "Eman" "Ahmed" "Noor" "Abdulla" "Eman" "Mona" "Noor"
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.