## Java Programming Exercise: Grocery List### Programming Code:```javaimport java.util.Scanner;import java.util.HashSet;public class GroceryList { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); HashSet groceries = new HashSet(); String userInput; groceries.add("milk"); groceries.add("cereal"); groceries.add("tomatoes"); groceries.add("bananas"); groceries.add("eggs"); groceries.add("ham"); userInput = scnr.nextLine(); while (userInput.compareTo("done") != 0) { if (groceries.remove(userInput)) { System.out.println("r"); } else { System.out.println("n"); } userInput = scnr.nextLine(); } System.out.println("Size: " + groceries.size()); }}```### Task:Type the program's output as per the given inputs on the right.### Explanation:1. **Initialization & Setup:** - Import `Scanner` and `HashSet` from Java utilities. - Define a public class named `GroceryList`.2. **Main Method:** - Create a `Scanner` object (`scnr`) for user input. - Create a `HashSet` named `groceries` to store the grocery items. - Add items "milk", "cereal", "tomatoes", "bananas", "eggs", and "ham" to the `groceries` set.3. **User Input and Processing:** - Read the first line of user input. - Use a while loop to continue reading inputs until the user types "done". - For each input, check if the item is in the `groceries` set: - If the item is found in the set and is successfully removed, print "r". - If the item is not found in the set, print "n".4. **Final Output:** - After exiting the loop, print the size of the remaining items in the `groceries` set.### Input and Expected Output:**Input:** ```butterhamchipscerealmilkdone```**Output:** ```nrnrrSize: 3```### Diagram:#### Input Box:

import java.util.Scanner; import java.util.HashSet; public class GroceryList { public static void main(String[] args) { Scanner scnr = new Scanner (System.in); HashSet groceries = new HashSet (); String userInput; groceries.add("milk"); groceries.add("cereal"); groceries.add("tomatoes"); groceries.add("bananas"); groceries.add("eggs"); groceries.add("ham"); userInput = scnr.nextLine(); while (userInput.compareTo ("done") != 0) { if (groceries.remove(userInput)) { System.out.println(""); } else { System.out.println(""); } userInput = scnr.nextLine(); } "1 System.out.println("Size: + groceries.size()); Input butter ham chips cereal milk done Output

import java.util.Scanner; import java.util.HashSet; public class GroceryList { public static void main(String[] args) { Scanner scnr = new Scanner (System.in); HashSet groceries = new HashSet (); String userInput; groceries.add("milk"); groceries.add("cereal"); groceries.add("tomatoes"); groceries.add("bananas"); groceries.add("eggs"); groceries.add("ham"); userInput = scnr.nextLine(); while (userInput.compareTo ("done") != 0) { if (groceries.remove(userInput)) { System.out.println(""); } else { System.out.println(""); } userInput = scnr.nextLine(); } "1 System.out.println("Size: + groceries.size()); Input butter ham chips cereal milk done Output

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

PROBLEM STATEMENT: In this problem you will need to insert 5 at the frontof the provided ArrayList and return the list. import java.util.ArrayList;public class InsertElementArrayList{public static ArrayList<Integer> solution(ArrayList<Integer> list){// ↓↓↓↓ your code goes here ↓↓↓↓return new ArrayList<>(); Can you help me with this question The Language is Java
Redesign LaptopList class from previous project public class LaptopList { private class LaptopNode //inner class { public String brand; public double price; public LaptopNode next; public LaptopNode(String brand, double price) { // add your code } public String toString() { // add your code } } private LaptopNode head; // head of the linked list public LaptopList(String fname) throws IOException { File file = new File(fname); Scanner scan = new Scanner(file); head = null; while(scan.hasNextLine()) { // scan data // create LaptopNode // call addToHead and addToTail alternatively } } private void addToHead(LaptopNode node) { // add your code } private void addToTail(LaptopNode node) { // add your code } private…
public class ArraySection { static void arraySection(int a[], int b[]) { int k = 0; int [] c = new int[a.length]; for(int i = 0; i < a.length; i++) { for(int j = 0; j < b.length; j++) if(a[i] == b[j]) c[k++] = a[i]; } for(int i = 0; i < k; i++) System.out.println(c[i]); System.out.println(); } public static void main(String[] args) { int a[] = { 1, 2, 3, 4, 5 }; int b[] = { 0, 2, 4,5 }; arraySection(a,b); }} Calculate the algorithm step number and algorithm time complexity of the above program?
public ArrayList<Bus> loadBuses(String bfile) { ArrayList<Bus> buses = new ArrayList<>(); try { Scanner scanner = new Scanner(new File(bfile)); while (scanner.hasNextLine()) { String[] line = scanner.nextLine().split(" "); if (line.length < 4 || line.length > 7) { throw new IllegalArgumentException("Invalid input format"); } String name = line[1]; int size = Integer.parseInt(line[1]); int price = Integer.parseInt(line[2]); int level = Integer.parseInt(line[3]); Ministry ministry = null; if (line.length > 5) { ministry = new Ministry(line[5]); } int competitorArea, numSecurity, barArea; Bus bus; SportsBus sportsBus; PartyBus partyBus;…
public class arrayOutput ( public static void main (String [] args) { final int NUM ELEMENTS = 3; int[] userVals = new int [NUM_ELEMENTS]; int i; } Type the program's output userVals [0] = 2; userVals [1] = 6; userVals [2] = 8; for (i = userVals.length - 1; i >= 0; −−1) { System.out.println(userVals [1]); } C.C. ? ? ??
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() { }
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…
private static final List<Polynomial> polyList = new ArrayList<>(); //main here public static void main(String[] args) { processPolyList(); } //=============================================================================================== // method: fromFile / returns: Arraylist // description: Opens a file takes a String and tokenizes it into an ArrayList of of expressions //=============================================================================================== public static ArrayList<String> f
JavaTimer.java: import java.util.Arrays;import java.util.Random; public class JavaTimer { // Please expand method main() to meet the requirements.// You have the following sorting methods available:// insertionSort(int[] a);// selectionSort(int[] a);// mergeSort(int[] a);// quickSort(int[] a);// The array will be in sorted order after the routines are called!// Be sure to re-randomize the array after each sort.public static void main(String[] args) {// Create and initialize arraysint[] a = {1, 3, 5}, b, c, d;// Check the time to sort array along startTime = System.nanoTime();quickSort(a);long endTime = System.nanoTime();long duration = (endTime - startTime) / 1000l;// Output resultsSystem.out.println("Working on an array of length " + a.length + ".");System.out.println("Quick sort: " + duration + "us.");}// Thanks to https://www.javatpoint.com/insertion-sort-in-javapublic static void insertionSort(int array[]) {int n = array.length;for (int j = 1; j < n; j++) {int key = array[j];int…
Exercise 2: Consider the following class: public class Sequence { private ArrayList values; public Sequence() { values = new ArrayList(); } public void add(int n) { values.add(n); } public String toString() { return values.toString(); } } Add a method public Sequence merge(Sequence other) that merges two sequences, alternating ele- ments from both sequences. If one sequence is shorter than the other, then alternate as long as you can and then append the remaining elements from the longer sequence. For example, if a is 1 4 9 16 and b is 9 7 4 9 11 then a.merge(b) returns the sequence 1 9 4 7 9 4 16 9 11 without modifying a or b.
package circularlinkedlist;import java.util.Iterator; public class CircularLinkedList<E> implements Iterable<E> { // Your variablesNode<E> head;Node<E> tail;int size; // BE SURE TO KEEP TRACK OF THE SIZE // implement this constructorpublic CircularLinkedList() {} // I highly recommend using this helper method// Return Node<E> found at the specified index// be sure to handle out of bounds casesprivate Node<E> getNode(int index ) { return null;} // attach a node to the end of the listpublic boolean add(E item) {this.add(size,item);return false; } // Cases to handle// out of bounds// adding to empty list// adding to front// adding to "end"// adding anywhere else// REMEMBER TO INCREMENT THE SIZEpublic void add(int index, E item){ } // remove must handle the following cases// out of bounds// removing the only thing in the list// removing the first thing in the list (need to adjust the last thing in the list to point to the beginning)// removing the last…
import java.util.* ; public class Averager { public static void main(String[] args) { //a two dimensional array int[][] a = {{5, 9, 3, 2, 14}, {77, 44, 22, 15, 99}, {14, 2, 3, 9, 5}, {88, 15, 17, 121, 33}} ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average = 29.85") ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; System.out.println("EXPECTED:") ; System.out.println("Average of evens = 26.57") ; Random random = new Random(1) ; a = new int[100][1] ; for (int i = 0 ; i < 100 ; i++) a[i][0] = random.nextInt(1000) ; System.out.println("For an array of random values in range 0 to 999:") ; System.out.printf("Average = %.2f\n", average(a)) ; System.out.printf("Average of evens = %.2f\n", averageEvens(a)) ; } /** Find the average of all elements of a two-dimensional array @param aa the two…