What will be the output of the following program? 1 import java.util.LinkedList; 2 3 public class ListTest{ 36655575600 in to 10 11 12 13 14 15 16 17 } public static void main(String[] args) { LinkedList player Ranking new LinkedList (); } player Ranking.add("Messi"); player Ranking.add("Neymar"); player Ranking.addFirst("Ronaldo"); player Ranking.add(0, "Salah"); player Ranking.se(1, "Benzema"); player Ranking.remove(); for (String p: player Ranking) System.out.println(p);

What will be the output of the following program? 1 import java.util.LinkedList; 2 3 public class ListTest{ 36655575600 in to 10 11 12 13 14 15 16 17 } public static void main(String[] args) { LinkedList player Ranking new LinkedList (); } player Ranking.add("Messi"); player Ranking.add("Neymar"); player Ranking.addFirst("Ronaldo"); player Ranking.add(0, "Salah"); player Ranking.se(1, "Benzema"); player Ranking.remove(); for (String p: player Ranking) System.out.println(p);

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

Starter code for ShoppingList.java import java.util.*;import java.util.LinkedList; public class ShoppingList{ public static void main(String[] args) { Scanner scnr=new Scanner(System.in); LinkedList<ListItem>shoppingList=new LinkedList<ListItem>();//declare LinkedList String item; int i=0,n=0;//declare variables item=scnr.nextLine();//get input from user while(item.equals("-1")!=true)//get inputuntil user not enter -1 { shoppingList.add(new ListItem(item));//add into shoppingList LinkedList n++;//increment n item=scnr.nextLine();//get item from user } for(i=0;i<n;i++) { shoppingList.get(i).printNodeData();//call printNodeData()for each object } }} class ListItem{ String item; //constructor ListItem(String item) { this.item=item; } void printNodeData() { System.out.println(item); }}
Java/Data Structures: If myList is a declared ADT list and the front of the list is on the left, what does the method getEntry(3) return after applying the following pseudo code? myList.add(“horse”) myList.add(“goat”) myList.add(1, “fish”) myList.add(“cat”) myList.add(2, “dog”) myList.remove(4) Multiple choice. A) cat B) dog C) fish D) horse
What will be the output of the following program? 1 import java.util.LinkedList; 3 public class ListTest{ 556555-66425547 10 11 12 13 14 15 16 17 } public static void main(String[] args) { LinkedList player Ranking new LinkedList(); } player Ranking.add("Messi"); player Ranking.add("Neymar"); player Ranking.addFirst("Ronaldo"); player Ranking.add(0, "Salah"); player Ranking.se(1, "Benzema"); player Ranking.remove(); for (String p: player Ranking) System.out.println(p); O Ronaldo Salah Messi O Salah Benzema Messi Neymar O Compilation Error Benzema Messi Neymar O Messi Neymar Ronaldo Salah
2) Suppose you have a linked list class that provides the following methods: // constructor. // returns size of the list. LinkList () int size (); void insertHead (Object data) // insert new data at the head of // the list. // remove and return the Object at // the head of the list. Object removeHead () void insertTail (Object data) // insert new data at the tail of // the list. The class below is an implementation of a stack using the linked list class. Fill in the method implementations: class Stack { private Stack s; public Stack () { public void push (Object x) { } public Object pop () // assume stack is not empty { } public boolean isEmpty() { }
please fix code to match "enter patients name in lbs" thank you import java.util.LinkedList;import java.util.Queue;import java.util.Scanner; interface Patient { public String displayBMICategory(double bmi); public String displayInsuranceCategory(double bmi);} public class BMI implements Patient { public static void main(String[] args) { /* * local variable for saving the patient information */ double weight = 0; String birthDate = "", name = ""; int height = 0; Scanner scan = new Scanner(System.in); String cont = ""; Queue<String> patients = new LinkedList<>(); // do while loop for keep running program till user not entered q do { System.out.print("Press Y for continue (Press q for exit!) "); cont = scan.nextLine(); if (cont.equalsIgnoreCase("q")) { System.out.println("Thank you for using BMI calculator"); break;…
Complete this missing methods using Java: public boolean contains(int value) Write a method contains that accepts a value and returns true if the value exists in the linked list, otherwise it returns false 2. public void set(int index, int value) Write a method set that accepts an index and a value and sets the list's element at that index to have the given value. You may assume that the index is between 0 (inclusive) and the size of the list (exclusive). 3.public boolean isSorted() Write a method isSorted that returns true if the list is in sorted (nondecreasing) order and returns false otherwise. An empty list is considered to be sorted. 4. public int deleteBack() Write a 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…
Write the following method in Java: public void reverse() The method will reverse the linked list. Head will point to the last node of the linked list and all the pointers (addresses) will be reversed. The last node (a new head) will point to the second last node and so on. The old head node will become the tail node in the reversed LinkedList. Use the LinkedList class discussed in the video lecture and write the reverse() method in the same class. Test your method in the main method. Following picture depicts the reversal of the LinkedList. NULL Head I V R I ↑ Head > NULL
Java Program, Dont Copy Consider a class Student that has an attribute age and a method getAge(): StudentList is a class representing a linkedlist of students. Write sumListAge_lterative......), a method that computes and returns the sum of the ages of all students in the list using the iterative way. Parameters of the method should be specified accordingly
2. By using the above class definition, write a program statement for each of the operation: // Import the LinkedList class import java.util.LinkedList; public class linkedListl { public static void main(String[] args) { LinkedList cars = new LinkedList (); cars.add("Volvo"); cars.add("BMW"); cars.add("Ford"); cars.add("Mazda"); } } a) Use removeFirst () remove the first item from the list b) Use removeLast () remove the last item from the list c) Use getFirst () to display the first item in the list d) Use getLast () to display the last item in the list
Need help only part 2. Thank you! In this assignment, you will create a Linked List data structure variant called a “Circular Linked List”. The Node structure is the same as discussed in the slides and defined as follows (we will use integers for data elements): public class Node { public int data; public Node next; } For the Circular Linked List, its class definition is as follows: public class CircularLinkedList { public int currentSize; public Node current; } In this Circular Linked List (CLL), each node has a reference to an existing next node. When Node elements are added to the CLL, the structure looks like a standard linked list with the last node’s next pointer always pointing to the first. In this way, there is no Node with a “next” pointer in the CLL that is ever pointing to null. For example, if a CLL has elements “5”, “3” and “4” and “current” is pointing to “3”, the CLL should look like: Key observations with this structure:…
import java.util.Scanner; public class Playlist { // TODO: Write method to ouptut list of songs public static void main (String[] args) { Scanner scnr = new Scanner(System.in); SongNode headNode; SongNode currNode; SongNode lastNode; String songTitle; int songLength; String songArtist; // Front of nodes list headNode = new SongNode(); lastNode = headNode; // Read user input until -1 entered songTitle = scnr.nextLine(); while (!songTitle.equals("-1")) { songLength = scnr.nextInt(); scnr.nextLine(); songArtist = scnr.nextLine(); currNode = new SongNode(songTitle, songLength, songArtist); lastNode.insertAfter(currNode); lastNode = currNode; songTitle = scnr.nextLine(); } // Print linked list…
Computer Science Write a program in the Java language that includes: 1. A class for books, taking into account the encapsulation and getter, setter. 2. Entering books by the user using Scanner 3. LinkedList class for: (Adding a new book - Inserting a book- Searching for a book using the ISBN Number - Viewing all books,delete book). 4. Serial number increases automatically with each book that is entered. 5. Printing the names of books is as follows: Serial - ISBN - Name - PubYear - Price - Notes. 6-Design a main menu that includes: • Add Book • Insert Book • Delete Book • Search . Display . Exit