Question: We have an array of 20 integer elements which is supposed to contain the values from 1 to 20. User may not input all the number and skip a few, duplicating the same number for many times. For examples user misses 9 and enters 2 in place of 9, so 2 is entered twice in the array. Your task is to determine the missing values in the array of 20 elements and display all those values on console. For example; in array of 10 elements, A={2,3,5,7,8,4,1,5,5,2) Missing elements are: 6,9,10

Question: We have an array of 20 integer elements which is supposed to contain the values from 1 to 20. User may not input all the number and skip a few, duplicating the same number for many times. For examples user misses 9 and enters 2 in place of 9, so 2 is entered twice in the array. Your task is to determine the missing values in the array of 20 elements and display all those values on console. For example; in array of 10 elements, A={2,3,5,7,8,4,1,5,5,2) Missing elements are: 6,9,10

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Write a program that declares an array of 15 integers and reads the values from the user. Make sure that the user doesn’t enter a value greater than 10 (if the user enters a value not in the allowed range, discard that value and read another to put into the array). Now tell the number that occur maximum number of times in the array. For example for the following 7 has maximum occurrence. 4,7,3,3,2,7,1,5,7,9,9,9,7,8,10 Use both linear and binary search.
You’re given an array of integers and another array of three distinct integers. The first array is guaranteed to only contain integers that are in the second array, and the second array represents a desired order for the integers in the first array. For example, a second array of [x, y, z] represents a desired order of [x, x,…,x, y, y,…,y, z, z,…,z] in the first array. Write a program that sorts the first array according to the desired order in the second array. The program should perform this in place (i.e.., it should mutate the input array), and it shouldn’t use any auxiliary space. Note that the desired order won’t necessarily be ascending or descending and that the first array won’t necessarily contain all three integers found in the second array-it might only contain one or two. Please Don't Use Chat GPT Answers Sample input array = [1,0,0,-1,-1,0,1,1] order = [0,1,-1] Sample output [0,0,0,1,1,1-1,-1] Requirements: 1. Implement the above problem statement using C Programming. 2.…
in java Create two arrays with same length n: - Array A with integer numbers that user will insert- Array B with random numbers from 0 to 100.- Find sum of both arrays,- Find maximum values of both array and compare them: .if maximum of 1 st is lower then maximum of 2nd array: print sums of both arrays.if maximum of 1st is greater then maximum of 2nd array print 2nd array (use println)otherwise print first array in reverse.
Write a hangman game that randomly generates a word andprompts the user to guess one letter at a time, as presented in the sample run.Each letter in the word is displayed as an asterisk. When the user makes a correctguess, the actual letter is then displayed. When the user finishes a word, displaythe number of misses and ask the user whether to continue to play with anotherword. Declare an array to store words, as follows:// Add any words you wish in this arrayString[] words = {"write", "that",...}; (Guess) Enter a letter in word ******* > p↵Enter(Guess) Enter a letter in word p****** > r↵Enter(Guess) Enter a letter in word pr**r** > p↵Enterp is already in the word(Guess) Enter a letter in word pr**r** > o↵Enter(Guess) Enter a letter in word pro*r** > g↵Enter(Guess) Enter a letter in word progr** > n↵Entern is not in the word(Guess) Enter a letter in word progr** > m↵Enter(Guess) Enter a letter in word progr*m > a↵EnterThe word is program. You missed 1 timeDo…
I need to write an array method that Shift all elements to the right by one and move the last element into the first position. For example, 1 4 9 16 25 would be transformed into 25 1 4 9 16. For some reason, I managed to get it to shift to the left, but I cannot figure out to shift it to the right? The problem is from Big Java 6th E. E7.10.b
Write a program that prompts the user for an integer, then asks user to enter that many integer value. Store these values in an integer array and print the array. Reverse the array elements so that first element become the last element, the second element become the second to last element, and so on, with the old last element now first. Do not just reverse the order in which they are printed; actually, change the way they are stored in the array. Try not to create a second array; just rearrange the elements within the array you have. (Hints; Swap elements that need to change place.) When the elements have been reversed, Print the array again.
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 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
Suppose that longitude is assigned to the first column of an array and latitude is assigned to the second column of an array. If the user inputs the longitude and the latitude, how do you loop through the 2D array to find which row the longitude and latitude match up? Please use java to answer this question. Here are the variables: double longitude = Double.parseDouble(args[0]); double latitude = Double.parseDouble(args[1]);
Please code in python.Given an array of integers a of even length, your task is to split it into two arrays of equal length such that all the numbers are unique in each of them. There may be more than one possible answer, in which case you may return any of them. If there are no possible answers, return an empty array. Hint: Count the number of occurrences of each integer in a. If there are integers occurring more than twice, then there is no solution. Next, put the integers occurring twice into both answer arrays. Finally, put all other numbers in the answer arrays, following the condition that they should have equal sizes. Example • For a = [2, 1, 2, 3, 3, 4], the output can be solution(a) = [[2, 1, 3], [2, 3, 4]]. Answers like [[1, 2, 3], [2, 3, 4]] or [[4, 2, 3], [3, 2, 1]] would also be considered correct. • For a = [1, 2, 2, 1], the output can be solution(a) = [[1, 2], [2, 1]]. Again, there are other possible answers. • For a = [2, 2, 3, 3, 2, 2], the output should be solution(a)…
Can you make the array be randomly genorated instead of already named values, and ask the user to enter the number of numbers that will be genorated in the array. Everything else can stay the same. '''def binary_search(arr, x): low = 0high = len(arr) - 1mid = 0while low <= high: mid = (high + low) // 2if arr[mid] < x: low = mid + 1elif arr[mid] > x: high = mid - 1else: return mid return -1arr = [ 2, 3, 4, 10, 40 ] print("The array is [ 2, 3, 4, 10, 40 ]")x = int(input("Enter which value do you seek to find from the array above? "))while not (x==2 or x==3 or x==4 or x == 10 or x == 40):print("Option isn't in the array.")x = int(input("Please input a valid number to search "))result = binary_search(arr, x) print("Searching for", x) if result != -1: print("Element is present at index", str(result))
Given your array declared above, and assuming your program has already read in a certain number of Complex values into that array, we'd like to take the average of these Complex values. It may help if you also knew that the Complex class has this method for adding two Complex objects: Complex Complex::add(const Complex & b) const; and a method to divide a Complex object by a floating-point value: Complex Complex::divide(double n) const; Now, show your code in C++ to average all the elements in your array of Complex numbers. (Hint: What is the data type of the average of two or more Complex numbers?)
Consider 2 integer arrays, x and y, each with size equal to 10.Initialize array x with random numbers between 1 and 100.Write code that fills array y with values such that each element of y is the corresponding valueof x multiplied by its index.