I have a linked list named mylist.mylist has a pointer named head which has the address of the first node in the list. head is null if the list is empty. Each node in the list is of type mynode. mynode has a pointer named next which holds the address of the next node in the list. mylist has a method called addatfront with one parameter of type mynode named input. The pointer in input is null. This method will place the new input node at the front of the list. Which of the following code segments does that correctly? O void addatfront(mynode input){ if(head == null) { head = input; } head.next input; } O void addatfront(mynode input){ if(head != null) { input.next head; } head = input; } O void addatfront(mynode input){ head = input: head.next input; } O void addatfront(mynode input){ head.next input; head = input; }

I have a linked list named mylist.mylist has a pointer named head which has the address of the first node in the list. head is null if the list is empty. Each node in the list is of type mynode. mynode has a pointer named next which holds the address of the next node in the list. mylist has a method called addatfront with one parameter of type mynode named input. The pointer in input is null. This method will place the new input node at the front of the list. Which of the following code segments does that correctly? O void addatfront(mynode input){ if(head == null) { head = input; } head.next input; } O void addatfront(mynode input){ if(head != null) { input.next head; } head = input; } O void addatfront(mynode input){ head = input: head.next input; } O void addatfront(mynode input){ head.next input; head = input; }

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

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
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() !=…
only the method in java data structures
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…
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 after This, 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 after This as an information. public void removeFirst() Removes the first node in the linked list. Hint: be aware of empty lists. public void removeLast() Removes…
Java
4. For a singly linked list, each node has data attribute as well as next. head is given as a reference to the head Node. Write a method void deleteNotes(int k) in the Linkedlist class that deletes the first k nodes from the linkedlist. You may assume that k-1 corresponds to removing the head node. The method must throw an exception if k exceeds the size of the list.
You are the manager of the train depot. One of your tasks is to efficiently order the train cars so that it is easy to attach and detach them. In this assignment, you will implement Train Cars program that reads car details from the file called car.txt (given) and stores them in a LinkedList data structure. Cars in the train are linked in a specific order. Each car in the train contains various materials that must be attached and detached in the most efficient manner possible. Each car ( node of type Car) has a stop number, factory name, material name. Stop number – determines which stop the car must be detached, use this to order the train cars. They should be ordered either in increasing or decreasing stop numbers. Factory Name – name of the factory at which the car must be detached Material Name – name of the material being transported in the car. For example, the Jiffy Mix plant at stop 2 needs sugar, flour, cornmeal, etc. Write the program to perform each operation…
You are going to 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 homework. 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 1. create an empty unsorted list 2. 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(). 3. 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().. 4. 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…
Write a method called swapItems to be considered within the SingleLinkedList class that takes two parameters, index1 and index2 of type integer. The method swaps the data of the nodes at the given indexes. If any of the parameters indexes is invalid throw IndexOutOfBoundsException. Do not call any method of class SingleLinkedList in your method. Method heading: public void swapItems(int index1, int index2) Example: index1 = 2 index2 = 4 Before method call: list: 5 10 12 9 11 7 After method call: list: 5 10 11 9 12 7
Write a function, to be included in an unsorted linked list class, called replace_item, that will receive two parameters, one called olditem, the other called newitem. The function will replace all occurrences of olditem with newitem ( if olditem exists !! ) and it will return the number of replacements done.
Write the implementation of a class called Shape (square, triangle, parallelogram.etc), that consists of a linked list of Points. > Class shape has the following private attributes: String variable to store the name of the shape. Two pointer variables of type node Type to point to the first and last nodes. Integer variable to store the length of the list of points. Integer variable to store the maximum size of the list of points according to the shape. - For this class you should provide the following public member functions: A constructor that takes the shape name and the maximum number of points in the shape as parameters. A copy constructor. A function to overload assignment (=) operator. A destructor that frees all dynamically allocated memory when the object is destroyed. A function to calculate the circumference of a shape. A function to print the existing points in the shape. A function to overload the [] operator to return a reference to the point in the specified index passed…