Consider the following code snippet: LinkedList words = new LinkedList<>(); words.addLast("abc"); words.addLast("def"); words.addLast("ghi"); System.out.print(words.removeLast()); System.out. print(words.removeFirst()); System.out.print(words.removeLast()); What will this code print when it is execute Oabcdefghi defghiabc ghiabcdef abcghidef

Consider the following code snippet: LinkedList words = new LinkedList<>(); words.addLast("abc"); words.addLast("def"); words.addLast("ghi"); System.out.print(words.removeLast()); System.out. print(words.removeFirst()); System.out.print(words.removeLast()); What will this code print when it is execute Oabcdefghi defghiabc ghiabcdef abcghidef

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

Java. Refer to screenshot. There is starter code for this question. public class LinkedList {Node head;Node tail; protected class Node{String data;Node next;} public String removeFirst(){//Complete the implementation of removeFirst} public String toString(){ String result = ""; Node n = head;while(n != null){result += n.data + " -> ";n = n.next;} return result;} }
In java, how do I implement the following methods into a linkedlist class. 1) removeLast() – remove the last number of the list 2) removeLeast()- remove least number in the list 3) removeMax()- remove largest number in the list 4) removeFirst() – remove the first number of the list 5) addNum()- add another number to the list
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;…
A linked list is built in this lab. Make sure to keep track of the head node. ContactNode.java - Class definition ContactList.java - Contains main() method (2) Build the ContactNode class per the following specifications: Private fields String contactName String contactPhoneNumber ContactNode nextNodePtr Constructor with parameters for name followed by phone number Public member methods getName() - Accessor getPhoneNumber() - Accessor insertAfter() getNext() - Accessor printContactNode() Ex: If the name is Roxanne Hughes and the phone number is 443-555-2864, printContactNode() outputs: Name: Roxanne Hughes Phone number: 443-555-2864 (3) Define main() to read the name and phone number for three contacts and output each contact. Create three ContactNodes and use the nodes to build a linked list. Ex: If the input is: Roxanne Hughes 443-555-2864 Juan Alberto Jr. 410-555-9385 Rachel Phillips 310-555-6610 the output is: Person 1: Roxanne Hughes, 443-555-2864 Person 2: Juan…
Complete the following method that uses a loop to removes all strings with length less than four from its parameter words. import java.util.Iterator;import java.util.LinkedList; public class Lists{ public static void removeShort(LinkedList<String> words) { Iterator<String> iter = words.iterator(); /* Your code goes here */ }}
Using a doubly linked list class and node class, implement the following methods: Node* lastNode(void); void pushBack(string argData); void popBack(void); void pushFront(string argData); void print(void); void printReverse(void); void insertAfter(Node* argPtr); void deallocateAll(void); Node* searchFor(string argData); int size(void); Hard code a linked list (no UI) in the main to demonstrate your functions. Print forward and backward to show that the links are well-formed.
public class CustomLinkedList {    public static int findMax(IntNode headObj) { /* Type your code here */         }    public static void main(String[] args) { IntNode headObj;   IntNode currObj; IntNode lastObj; int i;   int max;     // Create head node headObj = new IntNode(-1);   lastObj = headObj;     // Add nodes to the list for (i = 0; i < 20; ++i) {   currObj = new IntNode(i);     lastObj.insertAfter(currObj);   lastObj = currObj; }        max = findMax(headObj); System.out.println(max); }}
Assume that the following method is within the KWLinkedList class, what does this method do? public boolean undefined(E item) {       if(head == null) return false;       Node<E> p = head.next;       Node<E> newNode= new Node<E>(item, p);       newNode.prev = head;       head.next = newNode;       p.prev = newNode;       size++;       return true; } nserts a new node with its data as item at the front of the list. Inserts a new node with its data as item after the first node of the list. Deletes the node with its data as item. Inserts a new node with its data as item, at the end of the list.
Integer armchairCount is read from input as the number of input values that follow. The node headArmchair is created with the string "color". Use scnr.next() to read armchairCount strings. Insert a ArmchairNode for each string at the end of the linked list. Ex: If the input is 2 rose scarlet, then the output is: color rose scarlet import java.util.Scanner; public class ArmchairLinkedList {     public static void main(String[] args) { Scanner scnr = new Scanner(System.in); ArmchairNode headArmchair = null; ArmchairNode currArmchair = null; ArmchairNode lastArmchair = null; int armchairCount; String inputValue; int i; armchairCount = scnr.nextInt();    headArmchair = new ArmchairNode("color"); lastArmchair = headArmchair;     currArmchair = headArmchair; while (currArmchair != null) { currArmchair.printNodeData(); currArmchair = currArmchair.getNext(); } }} class ArmchairNode { private String…
What does self.append(item) append to? Does it append to the linkedList? But when I run this it shows AttributeError: 'LinkedList' object has no attribute 'append' class LinkedList: def __init__(self, items: list) -> None: self._first = None for item in items: self.append(item)
Complete the method printSkipper below. Use a loop to print every other element of a linked list parameter words. Print a space after every word and a newline after all elements have been printed. For example, if the list contains the strings "A", "B", and "C", print A C import java.util.Iterator;import java.util.LinkedList; public class Lists{ public static void printSkipper(LinkedList<String> words) { Iterator<String> iter = words.iterator(); //code here System.out.println(); }}
Rewrite this code so it can use a generic type instead of integers. This means we can use any data type with it. For example:LinkedList<String> = new LinkedLIst<>(); public class Main { public static void main(String[] args) { /* * Expected output: * * The list: 8 -> 1 -> 5 -> 3 -> 6 * Size: 5 * Head: 8 * Tail: 6 * Removeing 1... * The list: 8 -> 5 -> 3 -> 6 * Size: 4 * Head: 8 * Tail: 6 * Removeing head... * The list: 5 -> 3 -> 6 * Size: 3 * Head: 5 * Tail: 6 * Removeing tail... * The list: 5 -> 3 * Size: 2 * Head: 5 * Tail: 3 */ LinkedList list = new LinkedList(); list.append(5); list.append(3); list.append(6); list.prepend(1); list.prepend(8); printListDetails(list);…