Q1. Write a program to find the count of elements repeating in an array, store the count of those elements in another array respective of the element index number. Assume that elements in the first array have values >=1 and <=10 and it has 200 elements in total. Also print the histogram of the elements showing the frequency of each number.

Q1. Write a program to find the count of elements repeating in an array, store the count of those elements in another array respective of the element index number. Assume that elements in the first array have values >=1 and <=10 and it has 200 elements in total. Also print the histogram of the elements showing the frequency of each number.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

Write a program in ¢++ that asks the user to enter 10 integers of an array . The program must return the position pointer of an element that is equal to the square of another element.and then print the array example:- array={2.6,8,4,5} ------- 1 is squar of 2 position=3
C++ PROGRAM Write a program that will get 10 numbers( including duplicate) between 20 and 100and store them in one dimensional array of type int. your program shall delete all ofthem duplicate values and print the final array list.
If an array is given, identify the next bigger element for each element in the array, if one exists. If the element is not accessible, print the element itself. The next bigger element y in the array for an element x is the first element that is greater than x and appears on its right side. The element itself is the next bigger member of the array's rightmost element.For instance, if A = [6 8 4 3 9], the next bigger element list B = [8 9 9 9 9].
Write a program to insert an element in the given array (1D) at the beginning. Afterinsertion, identify the largest element from the array, and delete it. After deleting thelargest element, display the final array elements on the screen.
Write a basketball program such that it implements a two-dimensional array for 5 players whose score is entered into the array.
Write a program that fills an integer array of size 1000 with random positive integers between 1 and 10.Assume that each element represents a different city and the integers stored in the array represent thenumber of golds in those cities. The program traverses over the array and collects the golds at each city,starting from a random position. When the program visits a certain city, all of the golds are collected,and the visited element of the array becomes 0 (no gold is left at that city.) The journey continues withthe rule given below. If the position at the nth step is denoted by pn, and the number of golds at the citypn is denoted by gn,??+1 = {| ((??−1 + ?? + ??) ???1000|, ????? 2 = 0| ((??−1 + ?? − ??) ???1000|, ????? 2 = 1.The program continues visiting cities until the last three visited city has no gold.The program, at each visit, should print out the following information:• The current city index (pn).• The previous city index (pn-1).• The number of golds at the current city…
An array having a character subscript can be indexed using a computer language, as in CHR_ARRAY['A':'D']. In this scenario, the characters' ordinal numbers (ORDs), such as ORD('A') = 1, ORD('B') = 2, ORD('Z') = 26 and so on, are used to designate the array's elements, CHR_ARRAY['A'], CHR_ARRAY['B'], and so on. Beginning at position 500, two arrays called TEMP[1:5, -1:2] and CODE['A':'Z', 1:2] are now kept in the RAM. Furthermore, CODE outperforms TEMP in storage. Determine the locations of the following addresses: (i) TEMP[5, -1], (ii) CODE['N',2], and (iii) CODE['Z',1].
Write a program to Build a 100-element array with the integers 1 through 100 for which shellsort utilises as many comparisons as it can discover, using increments of 1 4 13 40.
this is insturction Write a program which prompts the user to enter up to 15 floating point numbers (terminated with a non-numeric), reads them into an array, then prints the following. The program must use an array (not a vector) to get credit. The array values in the original order, separated by commas, with no trailing comma at the last value. The array values where the order of each adjacent pair of elements is swapped, separated by commas (NOT every element swapped with its next neighbor, which would just move the first element to the end, but every original pair swapped only in that pair. For an odd element count, the last element should not change. See examples below.) The smallest number in the array. Example program outputs with user input shown in bold font: Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 # Original array: 1, 0, -1.001 The swapped array: 0, 1, -1.001 Smallest number: -1.001 Enter up to 15 numbers, and a non-numeric to quit: 1 0 -1.001 5 ,…
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]
Write a program to enter 10 numbers using keyboard and put them in an array.Now generate another array of same size from the array created in the first stepby satisfying the following conditions: If the number is prime then write ‘P’ to the same location of the secondarray If the number is divisible by 5 then write ‘F’ If the number is divisible by 3 then write ‘T’ If number is an Even number and neither divisible by 3 or 5 then write‘E’ If number is an Odd number and a non-prime number write ‘N’
Consider two arrays of Different sizes are given and your task is to multiply corresponding elements and store it into the result array and print the result array.