## 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

Related questions

Q: Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex:…

A: Java Programming is the object oriented programming languages. It is used to create the web…

Q: getListRowIndices Method public static java.util.ArrayList getListRowIndices(int[][] array, int…

A: public static java.util.ArrayList<java.lang.Integer> getListRowIndices(int[][] array, int…

Q: ERROR IN THIS CODE!! import java.util.ArrayList; import java.util.Collections; import…

A: This Java code simulates four CPU scheduling algorithms: FCFS (First-Come, First-Served), SJF…

Q: Public class DLL{ public DLLNode first; public DLLNode last; public DLL()…

A: Given: Public class DLL{ public DLLNode first; public DLLNode last; public DLL()…

Q: USING JAVA CODE Consider the interface below: package prelim; import…

A: Required language is Java:

Q: X1240: HashTable for Student ID The student ID at a fictitious university encodes various pieces of…

A: method addStidentId(String[] ids)// takes a string of student ids create an empty hasmap<String,…

Q: JAVA: Fill in the ParsedRequest method in the CustomParser.java file. The point of it is to parse…

A: ANSWER: Java Programming: One of the most generally utilized programming dialects, Java is utilized…

Q: de: int paths(int i, int j) { static int p[5][5] = {0}; if (i == 0 || j == 0) return 1;…

A: In C++, finish the Robot Paths code. Here is the starter code: int paths(int i, int j) { static…

Q: 4.14 LAB: Ticketing service (Queue) Given main(), complete the program to add people to a queue. The…

A: Algorithm: START Initialize an empty queue called peopleInQueue. Prompt the user to enter a list…

Q: //Instance variables private IntegerNode head; private int itemCount; /** * Default constructor. */…

A: The algorithm to delete a value from a linked list is as follows: Check if list is empty. If yes,…

Q: } } for (int i = 0; i < elements.length; i++) { System.out.println(elements [i]); elements…

A: Define the 'SeaCreature' class with the 'method1()' and 'method2' methods that print messages, and…

Q: Input Your output Expected output Roxanne Hughes 443-555-2864 Juan Alberto Jr. 410-555-9385 Rachel…

A: Algorithm:Initialize head and current to null.For each of the three contacts:Prompt the user to…

Q: I have the following code in java: import java.util.ArrayList; import java.util.Scanner; public…

A: In this question we have to modify the given code in java for the few extra operations to be added.…

Q: package sorting; import java.util.Arrays; import java.util.Random; import sorting.Heap;…

A: This program is an implementation of various comparison-based sorting algorithms such as insertion…

Q: import java.util.Scanner; public class SportsBus extends Bus { private int competitorArea;…

A: Below is the complete solution with explanation in detail for the given question about the…

Q: 1. ArrayLists Given the starter code consisting of MyArrayList.java, complete the implementation of…

A: Given: import java.util.ArrayList; public class Main{ public static void main(String[] args) {…

Q: Presentation Slide: Explain what generics are Their purpose in Java Types

A: Generics in Java are a feature that allow you to write a class or method that can work with objects…

Q: Code in java please import java.util.*; public class QueueLastname //<------ change the name…

A: import java.util.*; public class QueueLastname { // no code goes here} class Queue { private…

Q: Analyze the following code: import java.util.*; public class Test { public static void main(String[]…

A: The given code create a priority queue of integers with value 60, 10, 50, 30, 40 and 20. Then it…

Q: package hashset; import java.util.Iterator; public class MySet { // implements a set using…

A: a) Hash table right before the resize method is triggered is: [0] -> 0 -> 7 -> 14[1] ->…

Q: Given the code: import java.util.HashMap; import java.util.LinkedList; import java.util.Scanner;…

A: In this question we have to write a java program based out of LinkedList Data Structures.Let's code…

Question

## Java Programming Exercise: Grocery List

### Programming Code:

```java
import java.util.Scanner;
import java.util.HashSet;

public class GroceryList {
public static void main(String[] args) {
Scanner scnr = new Scanner(System.in);
HashSet<String> groceries = new HashSet<String>();
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:**
```
butter
ham
chips
cereal
milk
done
```

**Output:**
```
n
r
n
r
r
Size: 3
```

### Diagram:

#### Input Box:

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

VIEW

Step 2

VIEW

Step 3

VIEW

Trending now

This is a popular solution!

Step by step

Solved in 3 steps with 2 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

44 // create a loop that reads in the next int from the scanner to the intList 45 46 47 // call the ReverseArray function 48 49 50 System.out.print("Your output is: "); 51 // print the output from ReverseArray 52 ww 53 54 55 }
package edu.umsl.iterator;import java.util.ArrayList;import java.util.Arrays;import java.util.Collection;import java.util.Iterator;public class Main {public static void main(String[] args) {String[] cities = {"New York", "Atlanta", "Dallas", "Madison"};Collection<String> stringCollection = new ArrayList<>(Arrays.asList(cities));Iterator<String> iterator = stringCollection.iterator();while (iterator.hasNext()) {System.out.println(/* Fill in here */);}}} Rewrite the while loop to print out the collection using an iterator. Group of answer choices iterator.toString() iterator.getClass(java.lang.String) iterator.remove() iterator.next()
import java.util.HashSet; import java.util.Set; // Define a class named LinearSearchSet public class LinearSearchSet { // Define a method named linearSearch that takes in a Set and an integer target // as parameters public static boolean linearSearch(Set<Integer> set, int target) { // Iterate over all elements in the Set for () { // Check if the current value is equal to the target if () { // If so, return true } } // If the target was not found, return false } // Define the main method public static void main(String[] args) { // Create a HashSet of integers and populate integer values Set<Integer> numbers = new HashSet<>(); // Define the target to search for numbers.add(3); numbers.add(6); numbers.add(2); numbers.add(9); numbers.add(11); // Call the linearSearch method with the set…
USING THE FOLLOWING METHOD SWAP CODE: import java.util.*; class ListIndexOutOfBoundsException extends IndexOutOfBoundsException { public ListIndexOutOfBoundsException(String s) { super(s); } } class ListUtil { public static int maxValue(List<Integer> aList) { if(aList == null || aList.size() == 0) { throw new IllegalArgumentException("List cannot be null or empty"); } int max = aList.get(0); for(int i = 1; i < aList.size(); i++) { if(aList.get(i) > max) { max = aList.get(i); } } return max; } public static void swap(List<Integer> aList, int i, int j) throws ListIndexOutOfBoundsException { if(aList == null) { throw new IllegalArgumentException("List cannot be null"); } if(i < 0 || i >= aList.size() || j < 0 || j >= aList.size()) { throw new ListIndexOutOfBoundsException("Index out…
import java.util.*; public class Main{ public static void main(String[] args) { Main m = new Main(); m.go(); } private void go() { List<Stadium> parks = new ArrayList<Stadium>(); parks.add(new Stadium("PNC Park", "Pittsburgh", 38362, true)); parks.add(new Stadium("Dodgers Stadium", "Los Angeles", 56000, true)); parks.add(new Stadium("Citizens Bank Park", "Philadelphia", 43035, false)); parks.add(new Stadium("Coors Field", "Denver", 50398, true)); parks.add(new Stadium("Yankee Stadium", "New York", 54251, false)); parks.add(new Stadium("AT&T Park", "San Francisco", 41915, true)); parks.add(new Stadium("Citi Field", "New York", 41922, false)); parks.add(new Stadium("Angels Stadium", "Los Angeles", 45050, true)); Collections.sort(parks, Stadium.ByKidZoneCityName.getInstance()); for (Stadium s : parks) System.out.println(s); }}…
What is wrong with my Java code? public static void main(String[] args) { class IncrementClass<T> { T value; } IncrementClass<String> i = new IncrementClass<>(); int[] intArray = new int[10]; for(i.value = 0; i.value<intArray.length;i.value++){ intArray[i.value]=i.value; System.out.print(intArray[i.value]); } }
implement changeArrayLength(int m) – void method; public class Course { public String code; public int capacity; public SLinkedList<Student>[] studentTable; public int size; public SLinkedList<Student> waitlist; public Course(String code) { this.code = code; this.studentTable = new SLinkedList[10]; this.size = 0; this.waitlist = new SLinkedList<Student>(); this.capacity = 10; } public Course(String code, int capacity) { this.code = code; this.studentTable = new SLinkedList[capacity]; this.size = 0; this.waitlist = new SLinkedList<>(); this.capacity = capacity; } public void changeArrayLength(int m) { // insert your solution here } This method creates a new student table for this course; this new table has the given length m; the method moves all registered students to this table, as described in more detail below. Note that this method itself…
1. Goals and Overview The goal of this assignment is to practice creating a hash table. This assignment also has an alternative, described in Section 5. A hash table stores values into a table (meaning an array) at a position determined by a hash function. 2. Hash Function and Values Every Java object has a method int hashCode() which returns an int suitable for use in a hash table. Most classes use the hashCode method they inherit from object, but classes such as string define their own hashCode method, overriding the one in object. For this assignments, your hash table stores values of type public class HashKeyValue { K key; V value; } 3. Hash Table using Chained Hashing Create a hash table class (called HashTable211.java) satisfying the following interface: public interface HashInterface { void add(K key, V value); // always succeeds as long as there is enough memory V find (K key); // returns null if there is no such key } Internally, your hash table is defined as a private…
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.