Grey lines of code (Beging - 9 & 13-End of code) can NOT be edited. New Java code myst go inbetween. Given the integer array average Temps with the size of NUM_INPUTS, write a for loop to initialize the second half of average Tempswith the integers read from input, in reverse order.Ex: If the input is 87 58, then the output is:0 0 58 8723 public class TempPoints {4567891011121314151617181920 }Checkpublic static void main(String[] args) {Scanner scnr = new Scanner(System.in);final int NUM_INPUTS = 4;int[] average Temps = new int [NUM_INPUTS];int i;}for * Your code goes here */) {/* Your code goes here */}for (i = 0; i < average Temps.length; ++i) {System.out.print(average Temps[i] + " ");}System.out.println();1Next level23DD"

You are given an integer array averageTemps with a specified size (NUM_INPUTS). You need to…

Given the integer array average Temps with the size of NUM_INPUTS, write a for loop to initialize the second half of average Temps with the integers read from input, in reverse order. Ex: If the input is 87 58, then the output is: 0 0 58 87 3 4 5 6 7 8 9 10 11 12 13 14 public class TempPoints { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); final int NUM_INPUTS = 4; int[] average Temps = new int [NUM_INPUTS]; int i; 15 16 17 18 19 20 } } for * Your code goes here */) { /* Your code goes here */ } for (i = 0; i < average Temps.length; ++i) { System.out.print (average Temps [i] + " "); } System.out.println();

Given the integer array average Temps with the size of NUM_INPUTS, write a for loop to initialize the second half of average Temps with the integers read from input, in reverse order. Ex: If the input is 87 58, then the output is: 0 0 58 87 3 4 5 6 7 8 9 10 11 12 13 14 public class TempPoints { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); final int NUM_INPUTS = 4; int[] average Temps = new int [NUM_INPUTS]; int i; 15 16 17 18 19 20 } } for * Your code goes here /) { / Your code goes here */ } for (i = 0; i < average Temps.length; ++i) { System.out.print (average Temps [i] + " "); } System.out.println();

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

in java Integer numElements is read from input, representing the number of integers to be read next. Then, the remaining integers are read and stored into array valuesArray. For each element in valuesArray that is divisible by 9, assign the element with the element's current value plus 1. Ex: If the input is: 3 81 99 30 then the output is: Original values: 81 99 30 New values: 82 100 30 Note: (x % 9 == 0) returns true if x is divisible by 9. 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 for (i=0; i<valuesArray.length; ++i) { valuesArray[i] =scnr.nextInt(); } System.out.print("Original values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println(); /* Your code goes here */ System.out.print("New values: "); for (i=0; i<valuesArray.length; ++i) { System.out.print(valuesArray[i] +" "); } System.out.println(); } }
code: import java.util.Random;import java.util.ArrayList;import java.util.Scanner;public class WeekendOrders {/*** * This method takes as input the scanner instance created from main and* asks the user for input on the number of orders placed on each of the * days on the long weekend (Saturday, Sunday, and Monday). * Put the number of orders for each day in an array of fixed size* * * @param scnr (an instance of Scanner)* @return an array of int which includes the number of orders* placed on each day, with one day per index of the array*/public static int[] getUserInput(Scanner scnr){// DO NOT MODIFY THIS LINEint[] userInput = new int[3];// TODO: Prompt user for input on number of orders on each day// and store in userInputreturn userInput; }/*** * This method appends all the new orders for the given day onto the * arraylist. It first generates a random int between 0-2 (inclusive).* If the int is 0: it adds "Burger" to the prevOrders list* If the int is 1: it adds "Fries" to the…
java getDup accepts an array and returns an int. If there is any element is duplicated, the method counts how many of those present in the array. Example : getDup(["1","2","aa"',"1"]) returns:2 ("1" is duplicated and there are two "1"s so return is 2) class Main { public static int getDup(String[] r) { } public static void main(String[] args) { Scanner in = new Scanner(System.in); String [] strs = new String[in.nextInt()]; for(int i=0; i < strs.length; i++) { strs[i] = in.next(); } System.out.println(getDup(strs)); } } hint: you will need a nested array the will run on the array we get from the method argument. inside the nested loop you will need to check if the main array element is equal to the current
please help me public static void main(String args[]){ int[] x={1,4,88,9,13,77,4,18}; for(int i=0;i<x.length;i++){ for( int j=i+1;j<x.length;j++){ if(x[i]==x[j]){ System.out.println("duplicates exists is : "+x[i]); }}} System.out.println("no duplication"); } The above segment of code is searching the duplicated values inside an array, where the complexity is O(n). Suggest another solution for the above problem with less time complexity.
Given an array, find the next greater element for each element in the array, ifavailable. If not available, print the element itself. The next greater element y for anelement x in the array is the first element that is greater than x and occurs on its rightside. The next greater element of the right most element in an array is the elementitself.Example: Given A = [ 6 8 4 3 9] the next greater element listB = [8 9 9 9 9]. implement in python
A run is a sequence of adjacent repeated values. Write a program that generates a sequence of 20 random die tosses in an array and that prints the die values, marking the runs by including them in parentheses, like this:1 2 (5 5) 3 1 2 4 3 (2 2 2 2) 3 6 (5 5) 6 3 1Use the following pseudocode:inRun = falseFor each valid index i in the arrayIf inRunIf values[i] is different from the preceding valuePrint ).inRun = falseIf not inRunIf values[i] is the same as the following valuePrint (.inRun = truePrint values[i].If inRun, print ). Please do in Java
A run is a sequence of adjacent repeated values. Write a program that generates a sequence of 20 random die tosses in an array and that prints the die values, marking the runs by including them in parentheses, like this: 1 2 (5 5) 3 1 2 4 3 (2 2 2 2) 3 6 (5 5) 6 3 1Use the following pseudocode: inRun = falseFor each valid index i in the arrayIf inRunIf values[i] is different from the preceding valuePrint ).inRun = falseIf not inRunIf values[i] is the same as the following valuePrint (.inRun = truePrint values[i].If inRun, print ).
im trying to write a program that will read a list of integers and output the integers in reverse. the first number is supposed to tell the program the number of elements. that go into the array import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int[] userList = new int[20]; int numElements; numElements = scnr.nextInt(); the next for loop is intended to add the proper number of elements to the array. for (int i = 0; i < numElements.length; ++i) { numElements(i) = scnr.nextInt(); System.out.println(numElements(i)); } but i keep getting errors, I also want to put in another for loop to loop it backwards and print the numbers in the array list backwards but im a little unsure how to do that. could you walk me through this?
Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an algorithm that runs in O(n) time and uses constant extra space. Example 1: Input: nums = [1,2,0] Output: 3 Explanation: The numbers in the range [1,2] are all in the array. Example 2: Input: nums = [3,4,-1,1] Output: 2 Explanation: 1 is in the array but 2 is missing. Example 3: Input: nums = [7,8,9,11,12] Output: 1 Explanation: The smallest positive integer 1 is missing. Solve it in C# language please
Given a sorted array of n integers that has been rotated an unknownnumber of times, write code to find an element in the array. You may assume that the array wasoriginally sorted in increasing order.EXAMPLElnput:find5in{15, 16, 19, 20, 25, 1, 3, 4, 5, 7, 10, 14}Output: 8 (the index of 5 in the array)
*in java* Array testGrades contains NUM_VALS test scores. Write a for loop that sets sumExtra to the total extra credit received. Full credit is 100, so anything over 100 is extra credit. Ex: If testGrades = {101, 83, 107, 90}, then sumExtra = 8, because 1 + 0 + 7 + 0 is 8. import java.util.Scanner; public class SumOfExcess {public static void main (String [] args) {Scanner scnr = new Scanner(System.in);final int NUM_VALS = 4;int[] testGrades = new int[NUM_VALS];int i;int sumExtra = -9999; // Assign sumExtra with 0 before your for loop for (i = 0; i < testGrades.length; ++i) {testGrades[i] = scnr.nextInt();} /* Your solution goes here */ System.out.println("sumExtra: " + sumExtra);}}
This lab will demonstrate to you how the insertion sort works. Type up the code and submit the output only. CODE:import java.util.Arrays;public class InsertionSort {public static void main(String[] args) {int[] someNums = {90, 85, 65, 95, 75 };int a = 1, b = 0;int temp;System.out.println("The int array starts as: " + "\n"+Arrays.toString(someNums) + "\n");while (a < someNums.length) {temp = someNums[a];System.out.println("Analyze the " + a + " position in the array, and the temp value is " + temp + "\n");b = a - 1;while (b >= 0 && someNums[b] > temp){someNums[b + 1] = someNums[b];b--;System.out.println( Arrays.toString(someNums) + " temp is: " + temp);}System.out.println("Inserting the value " + temp + " into the " + (b+1) + " position in the array");someNums[b + 1] = temp;a++;System.out.println( Arrays.toString(someNums) + "\n");}System.out.println("\nThe int array ends as: " + "\n"+Arrays.toString(someNums));}