Use a one-dimensional array to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem.

Use a one-dimensional array to solve the following problem. Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem.

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter6: Using Arrays

Section: Chapter Questions

Problem 19RQ

See similar textbooks

Similar questions

in c# Use a one-dimensional array to solve the following problem: Read in 20 numbers, each of which is between 10 and 100, inclusive. As each number is read, validate it and store it in the array only if it is not a duplicate of a number already read. After reading all the values, display only the unique values that the user entered. Provide for the “worst case” in which all 20 numbers are different. Use the smallest possible array to solve this problem
Problem 3: Use a one dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it’s not a duplicate of a number that has already been read. Provide for the “worst case,” in which all 10 numbers are different. Use the smallest possible array to solve the problem.
Use a one-dimensional array to solve the following problem. Read in 20 numbers, each of which is between 20 and 50, inclusive. As each number is read, validate it and check its value. Numbers greater than 40 are to be stored as they are. Numbers that are less than or equal to 40 should be doubled and then stored. After reading all the values, display all the values which were stored.
Use one-dimensional arrays to solve the following problem. Read in two sets of numbers, each having 10 numbers. After reading all values, display all the unique elements in the collection of both sets of numbers. Use the smallest possible array to solve this problem.
Note: Set a random seed of 100 for this assignment. All arrays should contain random numbers between 0 and 1 (zero is inclusive). Create a one-dimensional array of twenty float random numbers. Assign the sum of these values to Q1. Assign the max of these values to Q2. Create a four by five array of random numbers. Take the minimum values in each array and create an array of those values. Assign it to Q3. Assign the mean of all the array values to Q4. Create an array with the following values: 2, 3, np.nan (this should represent a missing value), and 5. Use a numpy function to find the sum of the values in this array. Assign the sum to Q5 (you should expect a numerical value here). Create two separate arrays each containing four random numbers. Concatenate the two arrays and assign it to Q6. Create a four by four array of random numbers and call it q7. Concatenate this array with itself and assign it to Q7. Create a two by four array of…
The student names and the grades for four tests for Mr. Smith’s class have been placed in parallel arrays. Mr. Smith would like to have one student’s name and test scores printed. Develop a solution that will enter the student’s name, search for the name in the same array, and then print the name and test scores. Use the sequential-search method.
For the array ADT, the operations associated with the type array are: insert a value in the array, delete a value from the array, and test whether a value is in the array or not. 1.true 2.false
ABC zoo wants to keep track of how many pounds of food each of its four monkeys eats each day during a typical week. Stores this information in a two dimensional 4× 7 array, where each row represents a different monkey and each column represents a different day of the week. First let the user input the data of food eaten by each monkey then it should create a report that includes the following information: Average amount of food eaten by each monkey for the whole week. The least amount of food eaten during the week by any one monkey.
Create an array called QArray of 100 elements of type integer. Then fill the array with the odd values 1, 3, 5, 7, .…. (b) Calculate the print the summation of all elements in this array. (c) calculate and print the average of all array elements
Create an array of 15 integers. Add all elements located at ODD index positions and sum also all numbers located at EVEN(Assume index 0 is even) index positions in the linear array. The user's will be the one to input each item in the array of 15 elements. Display also the inputted integers in the array. Given the sample layout w/ test data below: Sample input/output: Enter 15 integers in the array: Num[0): 10 Num(1]: -5 Num[2): 15 Num[3): 20 Num[4]: Num(5): 9 Num(6): -3 Num[7]: 25 Num[8]: 30 Num[9]:-18 Num[10]:-10 Num[11]: 7 Num[12]: 18 Num[13]: 1 Num[14]: 9 Inputted elements in the ARRAY are: Num(0): 10 Num[1]: -5 Num[2]: 15 Num[3]: 20 Num[4]: 2 Num[5): 9 Num[6]: -3 Num[7]: 25 Num[8]: 30 Num[9]:-18 Num[10]:-10 Num[11]: 7 Num[12]: 18 Num[13]: 1 Num[14]: 9
You are playing a game where you roll two number cubes and your score is the sum of the two cubes. Show the sample space by creating an array.
Use a one-dimensional array to solve the following problem: Read in 10 numbers, each of which is between 10 and 100. As each number is read, print it only if it's not a duplicate of a number that has already been read. Provide for the "worst case", in which all 10 numbers are different. Use the smallest possible array to solve this problem. This needs to be in Java and Html.