There are 2 arrays, the first contains item numbers in inventory and the second parallel array contains the price of the items. The user will enter the item number they want to purchase, the program checks to see if it is a valid entry. If it is valid, it will tell the user the price of the item. If it is an invalid item, a message will display telling the user they entered an invalid item. Type up the code below, execute the program a few times. Import javax.swing.*:public class ParallelArrays {public static void main(String[] args) {II Variables neededInt item;double price = 0.0;String itemEntered =boolean valid = false;// Set up arraysInt[] items Arr = {101, 102, 103, 452, 524, 601, 775);double priceArr(7.52, 18.36, 1.25, 450.99, 19.99, 24.97, 101.33);// Use a loop to allow the user to order itemsdo {II Ask the user to enter an item to purchaseitemEntered = JOptionPane.show/nputDialog(null, "Enter the item number toorder, enter '9999' to quit");item= Integer.parse/nfitemEntered); item + " is $" + price);}}// If the item number entered is validif(!itemEntered.equals("9999"))}{+ item + " is invalid, please try again.");// Loop through the items array to see if it therefor (int x = 0; x< itemsArr.length; x++){}else// If the item number is foundif (item == itemsArr[x]){}if (valid == true)}valid = true;price = priceArr[x];JOptionPane.showMessageDialog(null, "The price of item " +JOptionPane.showMessageDialog(null, "The item you chose: "// Reset the valuesprice = 0.0;itemEntered = "";valid = false;while (!itemEntered.equals("9999"));JOptionPane.showMessageDialog(null, "Program complete");

The JAVA code is given below along with multiple output screenshots

There are 2 arrays, the first contains item numbers in inventory and the second parallel array contains the price of the items. The user will enter the item number they want to purchase, the program checks to see if it is a valid entry. If it is valid, it will tell the user the price of the item. If it is an invalid item, a message will display telling the user they entered an invalid item. Type up the code below, execute the program a few times

There are 2 arrays, the first contains item numbers in inventory and the second parallel array contains the price of the items. The user will enter the item number they want to purchase, the program checks to see if it is a valid entry. If it is valid, it will tell the user the price of the item. If it is an invalid item, a message will display telling the user they entered an invalid item. Type up the code below, execute the program a few times

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

import java.util.ArrayList; public class RemoveMin { public static void main(String[] args) { ArrayList<Integer> a = new ArrayList<Integer>(); // Add some integers to the array list a.add(14); a.add(29); a.add(19); a.add(3); a.add(15); a.add(62); a.add(18); a.add(97); a.add(44); a.add(31); a.add(51); a.add(78); // Print the array list - Note the use of the size() method and the get() method for (int i = 0; i < a.size(); i++) { System.out.print(a.get(i) + " "); } System.out.println(); //Remove the minimum element from ArrayList a removeMin(a); // Print the array list again for (int i = 0; i < a.size(); i++) { System.out.print(a.get(i) + " "); } System.out.println(); // Trick: You can also print the entire array by calling the toString() method…
Write Java statements to add the integers 1001, 1100, and 1110 to the resulting ArrayList import java.util.*;public class test { public static void main(String[] args) { //Set n =25 int n = 25; //ArrayList of Integer type with size,n=25 ArrayList<Integer> list = new ArrayList<Integer>(n); for(int i = 0;i<n;i++){ //Assign -1 to all the objects of the array list,list list.add(-1); } //Add 1001 to the list list.add(1001); //Add 1100 to the list list.add(1100); //Add 1110 to the list list.add(1110); //Reset the number of elements in the list becomes 28 //Use size() method to get the size of the list. n=list.size(); //for loop to print the list for(int i = 0;i<n;i++){ System.out.print(list.get(i) + " "); } }} 1. Write the Java statement to display the size of the resulting ArrayList from above.
import java.util.*;class Arraylist{public static void main(String args[]){ArrayList obj = new ArrayList();obj.add("A");obj.add("B");obj.add("C");obj.add(1, "D");System.out.println(obj);}} What will the given code prints on the output screen.
Please help me fix this code Make it run out like the picture import java.util.ArrayList; import java.util.Random; import java.util.Scanner; public class FrogListApp { public static void main(String[] args) { final int MIN_WEIGHT = 1; final int MAX_WEIGHT = 25; // Step 3: Create an array list to store Frog objects ArrayList frogsList = new ArrayList<>(); // Step 4: Create a Scanner object Scanner scanner = new Scanner(System.in); // Step 5: Read an integer as the number of frogs // using prompt "Enter the number of frogs: " System.out.print("Enter the number of frogs: "); int numberOfFrogs = scanner.nextInt(); // Step 6: Read an integer as the random generator seed // using prompt…
import java.util.Scanner; public class ModifyArray { public swapArrayEnds(10, 20, 30, 40) { for (i = 0; i < (arrVals.length / 2); ++i) { tempValue = arrVals[i]; // Do swap //*please fix code// arrVals[i] = arrVals[arrVals.length - 1 - i]; arrVals[arrVals.length - 1 - i] = tempValue; Write a method swapArrayEnds() that swaps the first and last elements of its array parameter. Ex: sortArray = {10, 20, 30, 40} becomes {40, 20, 30, 10}. public static void main (String [] args) { Scanner scnr = new Scanner(System.in); int numElem = 4; int[] sortArray = new int[numElem]; int i; int userNum; for (i = 0; i < sortArray.length; ++i) { sortArray[i] = scnr.nextInt(); } swapArrayEnds(sortArray); for (i = 0; i < sortArray.length; ++i) { System.out.print(sortArray[i]); System.out.print(" "); } System.out.println(""); }}
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…
The implementation of a queue in an array, as given in this chapter, uses the variable count to determine whether the queue is empty or full. You can also use the variable count to return the number of elements in the queue. On the other hand, class linkedQueueType does not use such a variable to keep track of the number of elements in the queue. Redefine the class linkedQueueType by adding the variable count to keep track of the number of elements in the queue. Modify the definitions of the functions addQueue and deleteQueue as necessary. Add the function queueCount to return the number of elements in the queue. Also, write a program to test various operations of the class you defined.
Please make this java program work Instruction: Write a test program that inputs, sorts, outputs Integer and Float. And call the isEqualTo method. import java.util.*; public class Generics <E>{ public static < E > void printArray( E inputArray[] ) { // Display array elements for( E element : inputArray) { System.out.printf("%s ", element); } System.out.println(); } public static < E extends Comparable<E> > void selectionSort(E array[]){ int size = array.length; for (int i = 0; i < size-1; i++){ // Find the minimum element int min = i; for (int j = i+1; j < size; j++) if (array[j].compareTo(array[min]) < 0) min = j; // Swap the found minimum element with the first element E temp = array[min]; array[min] = array[i]; array[i] = temp; } } public static <…
JAVA PROGRAMMING I need an expert to write Test application to run the MyArrayStack<T> class. import java.util.Arrays; interface MyStack<T> {public void push(T o);public T pop() throws StackEmptyException;public T peek();public boolean isEmpty();public int size();} class MyArrayStack<T> implements MyStack<T>{private static final int DEFAULT_STACK_SIZE = 100;T[] stackArray;int top = 0; public MyArrayStack() {this(DEFAULT_STACK_SIZE);}public MyArrayStack(int defaultSize) {top = 0;stackArray = (T[])new Object[defaultSize];} public void push(T o) {if (size() == stackArray.length) expandCapacity();stackArray[top] = o;top++;}private void expandCapacity() {stackArray = Arrays.copyOf(stackArray, stackArray.length*2);System.out.println("StackArray size is automatically expanded:" + stackArray.length);} public T pop() throws StackEmptyException {if (isEmpty()) throw new StackEmptyException("Stack is empty");top--;T o = stackArray[top];stackArray[top] = null;return o;}…
public class ReplaceEvenWithZero { public static void main(String[] args) { int[]a = new int[]{14, 2, 19, 3, 15, 22, 18, 7, 44, 39, 51, 78} ; // Print array a for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); // Replace the even elements. replaceEven(a); // Print array a again to see new elements. for (int i = 0; i < a.length; i++) { System.out.print(a[i] + " "); } System.out.println(); } /** Replace the even elements in the given array with 0 @param arr the array to use for the replacements */ public static void replaceEven(int[] arr) { //-----------Start below here. To do: approximate lines of code = 2 // Write a for loop to go through each element, determine if it is even //If so, replace with 0. Hint: use the modulus operator % to determine if an…
import java.util.Scanner;import java.util.ArrayList; public class PhotoLineups { // TODO: Write method to create and output all permutations of the list of names. public static void printAllPermutations(ArrayList<String> permList, ArrayList<String> nameList) { } public static void main(String[] args) { Scanner scnr = new Scanner(System.in); ArrayList<String> nameList = new ArrayList<String>(); ArrayList<String> permList = new ArrayList<String>(); String name; // TODO: Read in a list of names; stop when -1 is read. Then call recursive method. }}
Write the method printTail() method that accepts an array of integers and an integer index as parameters and prints all the array elements starting from the index passed. For example if printTail(x,5) is invoked, it should print all the elements of the array x starting at x[5]. !!!!LANGUAGE: JAVA!!!!