Computer science question class SLNode {private E myElement;private SLNodecE> myNext;public SLNode() {myElement = null;myNext = null;public SLNode( final E theElement, final SLNodecE> theNext) {myElement = theElement;myNext = theNext;public E getElement () {return myElement;public void setElement (final E theElement) {myElement = theElement;public SLNodecE> getNext () {return myNext;public void setNext (final SLNodecE> theNext) {myNext = theNext;}class DLNodecE> extends SLNodecE> {private DLNode myPrevious;public DLNode() {super();myPrevious = null;public DLNode(final E theElement, final DLNode thePrevious,final DLNode theNext) {super(theElement, theNext);myPrevious = thePrevious;public DLNodecE> getPrevious () {return myPrevious;public void setPrevious(final DLNode thePrevious) {myPrevious = thePrevious;}}front.getNext ()- getNext ().setNext(rear.getPrevious ());rear.getPrevious ().setPrevious (DLNodecString>) front.getNext().getNext ());front.getNext().getNext ().setNext(rear.getPrevious ().getPrevious();rear.getPrevious ().getPrevious ().setPrevious ( (DLNode) front.getNext (). getNext());front.getNext ().setNext (rear.getPrevious ());rear.getPrevious ((). setPrevious( (DLNodecstring>) front.getNext ());front.setNext (rear.getPrevious ());rear.getPrevious (). setPrevious ( (DLNodecString>) front); Which choice below represents code to change this linked list:FrontRearRARBZC anullnullnullInto this:FrontRearnullRARCZEnullnull(The definition of the SLNode and DLNode classes appears below as a reference.)Here is the code that produces the linked list of nodes shown in the upper diagram:DLNode front = new DLNode (nul1, null, null);DLNodecString> rear = new DLNodecString> (null, null, null);DLNode templ = new DLNode("A", front, null);front.setNext (temp1);DLNodecString> temp2 = new DLNode ("B", templ, null);templ.setNext (temp2);templ = new DLNodecString> ("C", temp2, rear);temp2.setNext (temp1);rear.setPrevious (templ);Here are the Node classes:

In the diagram, prev part is not included and that might bring some confusion. Assume prev part same…

Answered: Which choice below represents code to…

Which choice below represents code to change this linked list: Front Rear null null B null null Into this: Front Rear "RARCRI null null null null

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

You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add(must be completed) to add nodes to this linked list. Your job is to complete the empty methods. For every method you have to complete, you are provided with a header, Do not modify those headers(method name, return type or parameters). You have to complete the body of the method. package chapter02;  public class LinkedList {  protected LLNode list;   public LinkedList()  {  list = null;  }   public void addFirst(T info)  {  LLNode node = new LLNode(info);  node.setLink(list);  list = node;  }   public void addLast(T info)  {  LLNode curr = list;   LLNode newNode = new LLNode(info);  if(curr == null)  {  list = newNode;  }  else  {  while(curr.getLink() !=…
You are required to complete the LinkedList class. This class is used as a linked list that has many methods to perform operations on the linked list. To create a linked list, create an object of this class and use the addFirst or addLast or add (must be completed) to add nodes to this linked list(I created one linked list in TestLinkedList). I’ve already created the class for you and have some completed method in there, your job is to complete the empty methods.For every method you have to complete, you are provided with a header, Do not modify those headers( method name, return type or parameters). You have to complete the body of the method. public void add(T afterThis, T info) The parameter info will be the information the new node should contain, and the new node will be added after the node that contains the parameter afterThis as an information public void removeFirst() Removes the first node in the linked list. Hint: be aware of empty lists. public void removeLast() Removes…
Consider the LinkedList in the given figure. Assume that the nodes are objects of the ListNode class given below. Assume further that list, ptr1 and ptr2 are reference variables of the ListNode type. Write a Java statement (one statement only) to make ptr2 point to the node containing the info 44. * list 18 32 23 16 43 25 44 . null ptri ptr2 public class ListNode<T> { private T info; private ListNode<T> link; public ListNode(T info, ListNode<T> link) { this. info = info; this.link = link; public void setInfo(T info) { this. info = info; public void settink(ListNode<T> link) { this.link = link; public T getInfo() { return info; public ListNode<T> getlink() { return link;
Make a doubly linked list and apply all the insertion, deletion and search cases. The node willhave an int variable in the data part. Your LinkedList will have a head and a tail pointer.Your LinkedList class must have the following functions: 1) insert a node1. void insertNodeAtBeginning(int data);2. void insertNodeInMiddle(int key, int data); //will search for keyand insert node after the node where a node’s data==key3. void insertNodeAtEnd(int data);2) delete a node1. bool deleteFirstNode(); //will delete the first node of the LL2. bool deleteNode(int key); //search for the node where its data==keyand delete that particular node3. bool deleteLastNode(); //will delete the last node of the LL3) Search a node1. Node* searchNodeRef(int key); //will search for the key in the datapart of the node2. bool searchNode(int key); The program must be completely generic, especially for deleting/inserting the middle nodes. Implement all the functions from the ABOVE STATEMENTS and make a login and…
Please written by computer source Using C++, use a linked list to create an alphabetical Contact Book to store the names, addresses, and phone numbers of our contacts. The data structure used contain contacts should be a linked list and each time a new contact is added the contact will be inserted into the correct alphabetical location by last name. Assume there are no contacts that have the same last name. There will be two classes. One named LinkedList and the other named PersonNode. The LinkedList class will be used to create a single LinkedList object. - The class will have two PersonNode pointer fields *headPtr that will maintain the head of the linked list *tailPtr that will maintain the tail of the linked list - The class will have the following functions:: *a constructor that initialized the headPtr and tailPtr to NULL *addLink that will take a PersonNode reference or pointer and add the node to the linked list *findInsertSpot that will return a PersonNode pointer that points…
C# Assume you have a LinkedList of Node objects. Both classes have all the normal operations shown below. Your job is to program the DeleteTail method of the LinkedList class. This method locates and deletes the last element of the linked list. You may not change its signature line. Keep your code clean, but no documentation is necessary. A good solution will be between 5 and 10 lines of code, not counting whitespace.
Lab 19 Building a linked list Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order:1. Create a new Node object.2. Make the data variable in the new Node object reference the object that was passed to addFirst.3. Make the next variable in the new Node object reference the object that is currently referenced in variable first.4. Make variable first reference the new Node.Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? public class LinkedList{ private Node first; public LinkedList() {…
Lab 19 Building a linked list Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order:1. Create a new Node object.2. Make the data variable in the new Node object reference the object that was passed to addFirst.3. Make the next variable in the new Node object reference the object that is currently referenced in variable first.4. Make variable first reference the new Node.Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? Java language
Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Node objects. You will first complete the code for its addFirst method. This method is passed an object that is to be added to the beginning of the list. Write code that links the passed object to the list by completing the following tasks in order:1. Create a new Node object.2. Make the data variable in the new Node object reference the object that was passed to addFirst.3. Make the next variable in the new Node object reference the object that is currently referenced in variable first.4. Make variable first reference the new Node.Test your code by running the main method in the LinkedListRunner class below. Explain, step by step, why each of the above operations is necessary. Why are the string objects in the reverse order from the way they were added? public class LinkedList{ private Node first; public LinkedList() { first = null; } public Object…
Lab 20 Removing the first element in a list Start this lab with the code listed below. The LinkedList class defines the rudiments of the code needed to build a linked list of Nodes. Complete the code for the removeFirst method, which should remove and return the first element in the linked list. Throw a NoSuchElementException if the method is invoked on an empty list. Use the LinkedListRunner class’s main method to test your code. import java.util.NoSuchElementException;public class LinkedList{ private Node first; public LinkedList() { first = null; } public Object getFirst() { if (first == null) { throw new NoSuchElementException(); } return first.data; } public void addFirst(Object element) { Node aNode = new Node(); aNode.data = element; aNode.next = first; first = aNode; } public Object removeFirst() { // put your code here } public String toString() { String temp = ""; Node current = first;…
Implement the function below void swap(int pos1, int pos2) {} For LinkedList, to maintain integrity of data in the structure, you are not to swap directly the element, nor remove a node. Instead, you are to only change the nodes' next pointers. Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } }…
Given the IntNode class, define the getCount() method in the CustomLinkedList class that returns the number of items in the list not including the head node. Ex: If the list contains: head -> 14 -> 19 -> 4 getCount(headObj) returns 3. Ex: If the list contains: head -> getCount(headObj) returns 0. public class IntNode { private int dataVal; // Node data private IntNode nextNodePtr; // Reference to the next node // Default constructor public IntNode() { dataVal = 0; nextNodePtr = null; } // Constructor public IntNode(int dataInit) { this.dataVal = dataInit; this.nextNodePtr = null; } // Constructor public IntNode(int dataInit, IntNode nextLoc) { this.dataVal = dataInit; this.nextNodePtr = nextLoc; } /* Insert node after this node. Before: this -- next After: this -- node -- next */ public void insertAfter(IntNode nodeLoc) { IntNode tmpNext; tmpNext = this.nextNodePtr;…