Consider 2 two-dimensional integer arrays, x and y, of the same size (assume 3 by 4). Fill array x with random numbers between 5 and 95. Fill array y with values such that each element of array y is the corresponding value of array x plus the minimum value of array x. For example: х 14 16 95 12 70 19 27 29 14 22 43 21 23 20 49 10 64 13 16 101 13 8.

Consider 2 two-dimensional integer arrays, x and y, of the same size (assume 3 by 4). Fill array x with random numbers between 5 and 95. Fill array y with values such that each element of array y is the corresponding value of array x plus the minimum value of array x. For example: х 14 16 95 12 70 19 27 29 14 22 43 21 23 20 49 10 64 13 16 101 13 8.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

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…
Write a program that randomly fills in 0s and 1sinto an n-by-n matrix, prints the matrix, and finds the rows and columns with themost 1s. Here is a sample run of the program: Enter the array size n: 4 ↵EnterThe random array is0011001111011010The largest row index: 2The largest column index: 2, 3
Write a program to take input of 100 integers in a dynamically allocated array using malloc() function, then find the average of numbers that are in between 20 and 80. For example if an array contains [10, 40, 15, 20, 30, 90] then the average will be (40+20+30) / 3 = 30.
Take an array of length n where all the numbers are nonnegative and unique. Find the element inthe array possessing the highest value. Split the element into two parts where the first part containsthe next highest value in the array and the second part holds the required additive entity to get thehighest value. Return the array index value. Consider the negative numbers as well.Input: [4, 8, 6, 3, 2]Output: [4, 6, 2, 6, 3, 2]
Suppose an array A contains 8 elements as follows: 77,33,X,11,88,Y,6, 15 Where: element X = last two digits of your roll number (e.g., if your roll number is 19106018, then X is 18; if your roll number is 19106001, then X is 1) element Y = last two digits of the number obtained by squaring X (c.g., squarc of X = 18 is 324,50 Y is 24; squarc of X =1 is I,s0 Y is 1). Write an algorithm for insertion sort and step by step ap algorithm on the above example array A.
Write a program that reads an array A of N elements containing only 0's and 1's. Your program should find the position of a 0 and replace it with a 1 to get the longest continuous sequence of 1's. Let this position of 0 be called P. Print P if such a 0 exists and print -1 if the original array A contains only 1's. Assume the array indexing starts from 0.
Given two arrays of integers, compute the pair of values (one value in eacharray) with the smallest (non-negative) difference. Return the difference.EXAMPLEInput: {l, 3, 15, 11, 2}, {23, 127, 235, 19, 8}Output: 3. That is, the pair (11, 8).
Write a program that initialize square matrix of size N x N and check if that array is symmetric or not. The array is symmetric if array[row][column] == array[column][row].
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].
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 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.
Write a program in JavaScript to print intersection of 2 arrays and print that intersection array