Java public int deleteBack () {ListNode current-front;int rdata=0;if (front.next==null){rdata=front.data;front=null;return rdata;else {while(current.next.next!=null)current=current.next;rdata=current.next.data;current.next=null;return rdata;public int deleteBack () {ListNode current=front;if (front==null) throw new NoSuchElementException ();else {while(current.next!=null)current=current.next;current.next=null;return current.data;public int deleteBack () {ListNode current=front;int rdata=0;if (front==null) throw new NoSuchElementException();if (front.next==null){rdata=front.data;front=null;return rdata;else {while(current.next!=null)current=current.next;rdata=current.data;current.next=null;return rdata; Select the correct version of the method deleteBack that deletes the last value (the value at the backof the list) and returns the deleted value. If the list is empty, your method should throwa NoSuchElementException.Assume the LinkedIntList class as defined below:public class LinkedIntlist {private ListNode front; // null for an empty listpublic int deleteBack () {ListNode current=front;int rdata=0;if (front==null) throw new NoSuchElementException ();if (front.next==nul1){rdata=front.data;front-null;return rdata;else {while(current.next.next!=null)current=current.next;rdata=current.next.data;current.next=null;return rdata;

public int deleteBack() { //if root is null throw the exception…

Select the correct version of the method deleteBack that deletes the last value (the value at the back of the list) and returns the deleted value. If the list is empty, your method should throw a NosuchElementException). Assume the LinkedIntlist class as defined below: public class LinkedIntlist { private ListNode front; // null for an empty list ...

Select the correct version of the method deleteBack that deletes the last value (the value at the back of the list) and returns the deleted value. If the list is empty, your method should throw a NosuchElementException). Assume the LinkedIntlist class as defined below: public class LinkedIntlist { private ListNode front; // null for an empty list ...

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

Pythong help!
Given the IntNode class, define the findMax() method in the CustomLinkedList class that returns the largest value in the list or returns -99 if the list is empty. Assume all values in the list are non-negative. Ex: If the list contains: head -> 14 -> 191 -> 186 -> 181 findMax(headObj) returns 191. Ex: If the list contains: head -> findMax(headObj) returns -99. public class CustomLinkedList { public static int findMax(IntNode headObj) { if (headObj.getNext() == null) { return -99; // List is empty } int max = headObj.getNext().getData(); IntNode current = headObj.getNext().getNext(); // Traverse the linked list to find the maximum value while (current != null) { int data = current.getData(); if (data > max) { max = data; } current = current.getNext(); } return max; } public static void main(String[] args) { IntNode headObj;…
6. Suppose that we have defined a singly linked list class that contains a list of unique integers in ascending order. Create a method that merges the integers into a new list. Note the additional requirements listed below. Notes: ● . Neither this list nor other list should change. The input lists will contain id's in sorted order. However, they may contain duplicate values. For example, other list might contain id's . You should not create duplicate id's in the list. Important: this list may contain duplicate id's, and other list may also contain duplicate id's. You must ensure that the resulting list does not contain duplicates, even if the input lists do contain duplicates.
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;…
Question 2: Linked List Implementation You are going to create and implement a new Linked List class. The Java Class name is "StringLinkedList". The Linked List class only stores 'string' data type. You should not change the name of your Java Class. Your program has to implement the following methods for the StringLinked List Class: 1. push(String e) - adds a string to the beginning of the list (discussed in class) 2. printList() prints the linked list starting from the head (discussed in class) 3. deleteAfter(String e) - deletes the string present after the given string input 'e'. 4. updateToLower() - changes the stored string values in the list to lowercase. 5. concatStr(int p1, int p2) - Retrieves the two strings at given node positions p1 and p2. The retrieved strings are joined as a single string. This new string is then pushed to the list using push() method.
The following method is defined within a linked list class. What does it do? void MyList::doSomething() { Node* p = head; while (p) { cout << p->value << " "; p = p->next; }} Group of answer choices inserts a node into linked list deletes a node from linked list displays contents of linked list destroys the entire linked list
Q1: Write a method to insert an array of elements at index in a single linked list and then display this list. The method receives this array by parameters. 12:54 AM Q2: Write a method to multiply the odd numbers and add the even numbers for a single linked list data structure, then display the results. The method receives this list by parameters. 12:54 AM Q3: Write a complete project and test it to execute the single-linked list data structure with all functions including the methods in questions 1 & 2. 12:54 AM all in java
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. Java language
LAB: Finding an integer in a list (singly-linked list) Given main() and an IntNode class, complete the IntList class by writing the append() and search() methods. The search() method should return the IntNode whose data value matches a given key, and null if the key is not found. The search() method should also set the position of each IntNode searched in the IntList, starting with 1. Ex: If the input is: 12 23 59 37 923 2 -1 12 the output is: 12 found in list at position 1. If the input is: 12 23 59 37 923 2 -1 68 the output is: 68 not found in list. ______________________________________ import java.util.Scanner; public class SearchList {public static void main (String[] args) {Scanner scnr = new Scanner(System.in);IntList intList = new IntList();IntNode curNode, foundNode;int num, searchNum;num = scnr.nextInt();while (num != -1) {// Insert into linked listcurNode = new IntNode(num);intList.append(curNode);num = scnr.nextInt();}searchNum = scnr.nextInt();foundNode =…
X595: removeOdd This method takes an ArrayList of integers as a parameter and does not return anything. The method will remove all of the odd elements in the given list. If there is no element in the given list, the list does not change. You must modify the given list. Your Answer: 1 public void removeOdd (ArrayList list) 2{ 3 4} 5 Feedback Your answer could not be processed because it contains errors: line 3: error: size has private access in java.util.ArrayList
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; while (current != nul1) temp = temp + current.data.toString () + '\n'; current =…
Question 1 If N represents the number of elements in the collection, then the add method of the SortedArrayCollection class is O(N). True False Question 2 If N represents the number of elements in the list, then the index-based remove method of the ABList class is O(N). True False Question 3 The add method of our Collection ADT might throw the CollectionOverflowException. True False Question 4 A list allows retrieval of information based on the size of the information. True False Question 5 Our CollectionInterface defines a single constructor. True False Question 6 Our lists allow null elements. True False Question 7 Even though our collections will be generic, our CollectionInterface is not generic. True False Question 8 Our lists are unbounded. True False Question 9 If N represents the number of elements in the collection, then the contains method of the ArrayCollection class is O(N). True False Question 10 Our lists allow duplicate elements. True False