Directions Using the starter code below, follow the ToDo directions. This lab has you use dynamic allocation to create and populate an array. /* A function that reads a sequence of integers from input to fill a dynamically allocated array. For example, if the length is 3, and the numbers are 123 345 99 then the array returned will be of size 3, and stores values 123, 345 and 99. @param size: upon return, stores the size of the array @return the pointer pointing to the array */ int * ReadNumberSequence (int & size) { int * array = NULL; // initialize the pointer to NULL do { cout «"Enter the length of the number sequence:"; cin >> size; } while (size <= 0); // Todo: Write a statement to allocate memory for the array. // Note: we know the value of size only at run time, so we need to DYNAMICALLY // Todo: write a loop to read size # of int from input, and store in the array return array; int main() { // Todo: delcare necesssary variables // Todo: call the ReadNumberSequence function to read a sequence of numbers // Todo: write a loop to display the elements in the array returned ... // Todo: free the array returned by ReadNumberSequence. return e;

Directions Using the starter code below, follow the ToDo directions. This lab has you use dynamic allocation to create and populate an array. /* A function that reads a sequence of integers from input to fill a dynamically allocated array. For example, if the length is 3, and the numbers are 123 345 99 then the array returned will be of size 3, and stores values 123, 345 and 99. @param size: upon return, stores the size of the array @return the pointer pointing to the array / int ReadNumberSequence (int & size) { int * array = NULL; // initialize the pointer to NULL do { cout «"Enter the length of the number sequence:"; cin >> size; } while (size <= 0); // Todo: Write a statement to allocate memory for the array. // Note: we know the value of size only at run time, so we need to DYNAMICALLY // Todo: write a loop to read size # of int from input, and store in the array return array; int main() { // Todo: delcare necesssary variables // Todo: call the ReadNumberSequence function to read a sequence of numbers // Todo: write a loop to display the elements in the array returned ... // Todo: free the array returned by ReadNumberSequence. return e;

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter8: Arrays

Section: Chapter Questions

Problem 9PE

See similar textbooks

Similar questions

(Numerical) a. Define an array with a maximum of 20 integer values, and fill the array with numbers input from the keyboard or assigned by the program. Then write a function named split() that reads the array and places all zeros or positive numbers in an array named positive and all negative numbers in an array named negative. Finally, have your program call a function that displays the values in both the positive and negative arrays. b. Extend the program written for Exercise 6a to sort the positive and negative arrays into ascending order before they’re displayed.
(Data processing) The answers to a true-false test are as follows: T T F F T. Given a twodimensional answer array, in which each row corresponds to the answers provided on one test, write a function that accepts the two-dimensional array and number of tests as parameters and returns a one-dimensional array containing the grades for each test. (Each question is worth 5 points, so the maximum possible grade is 25.) Test your function with the following data:
(Numerical) Given a one-dimensional array of integer numbers, write and test a function that displays the array elements in reverse order.
Finding the common members of two dynamic arrays: Write a program that first reads two arrays and then finds their common members (intersection). The program should first read an integer for the size of the array and then should create the two arrays dynamically (using new) and should read the numbers into array1 and array2 and then should find the common members and show it. Note: The list of the common members should be unique. That is no member should be listed more than once. Tip: A simple for loop is needed on one of the arrays (like array1) and one inner for loop for on array2. Then for each member of array1, if we find any matching member in array2, we record it. Sample run: Enter the number of elements of array 1: 7 Enter the elements of array 1: 10 12 13 10 14 15 12 Enter the number of elements of array 2: 5 Enter the elements of array 2: 17 12 10 19 12 The common members of array1 and array2 are: 12 10
//convert array of numbers from farenheit to celcius// example:// argument: [23, 32, 41, 50, 59]// return: [-5, 0, 5, 10, 15]// hint: use Array.mapfunction toCelcius(array){ } //write a function that takes an input array and returns an array of booleans (>=75) or fail (<75)// example:// argument: [20, 30, 50, 80, 90, 100]// return: [false, false, false, true, true, true]// hint: use Array.mapfunction passOrFail(array){ }
In statistics, the mode of a set of values is the value that occurs most often or with the greatestfrequency. Write a function that accepts as arguments the following:A. An array of integersB. An integer that indicates the number of elements in the arrayThe function should determine the mode of the array. That is, it should determine which valuein the array occurs most often. The mode is the value the function should return. If the arrayhas no mode (none of the values occur more than once), the function should return −1.Demonstrate your pointer process by using pointer notation instead of array notation in thisfunction.
/* (name header) #include // Function declaration int main() { int al[] int a2[] = { 7, 2, 10, 9 }; int a3[] = { 2, 10, 7, 2 }; int a4[] = { 2, 10 }; int a5[] = { 10, 2 }; int a6[] = { 2, 3 }; int a7[] = { 2, 2 }; int a8[] = { 2 }; int a9[] % { 5, 1, б, 1, 9, 9 }; int al0[] = { 7, 6, 8, 5 }; int all[] = { 7, 7, 6, 8, 5, 5, 6 }; int al2[] = { 10, 0 }; { 10, 3, 5, 6 }; %3D std::cout « ((difference (al, 4) « ((difference(a2, 4) <« ((difference (a3, 4) « ((difference(a4, 2) <« ((difference (a5, 2) <« ((difference (a6, 2) <« ((difference (a7, 2) <« ((difference(a8, 1) « ((difference (a9, 6) « ((difference(a10, 4) " <« ((difference(al1, 7) « ((difference (al2, 2) == 10) ? "OK\n" : "X\n"); << "al: << "a2: %3D 7)? "OK" : "X") << std::endl == 8) ? "OK\n" : "X\n") 8) ? "OK\n" : "X\n") == 8) ? "OK\n" : "X\n") == 8) ? "OK\n" : "X\n") == 1) ? "OK\n" : "X\n") == 0) ? "OK\n" : "X\n") 0) ? "OK\n" : "X\n") == 8) ? "OK\n" : "X\n") == 3) ? "OK\n" : "X\n") == 3) ? "OK\n" : "X\n") == << "a3: == << "a4: <<…
Reverse ArrayWrite a function that accepts an int array and the array’s size as arguments. The function should create a copy of the array, except that the element values should be reversedin the copy. The function should return a pointer to the new array. Demonstrate thefunction in a complete program.
1- Write a user-defined function that accepts an array of integers. The function should generate the percentage each value in the array is of the total of all array values. Store the % value in another array. That array should also be declared as a formal parameter of the function. 2- In the main function, create a prompt that asks the user for inputs to the array. Ask the user to enter up to 20 values, and type -1 when done. (-1 is the sentinel value). It marks the end of the array. A user can put in any number of variables up to 20 (20 is the size of the array, it could be partially filled). 3- Display a table like the following example, showing each data value and what percentage each value is of the total of all array values. Do this by invoking the function in part 1.
In statistics, the mode of a set of values is the value that occurs most often or with the greatest frequency. Write a function that accepts as arguments the following: A) An array of integers B) An integer that indicates the number of elements in the array The function should determine the mode of the array. That is, it should determine which value in the array occurs most often. The mode is the value the function should return. If the array has no mode (none of the values occur more than once), the function should return −1. (Assume the array will always contain non negative values.) Demonstrate your pointer prowess by using pointer notation instead of array notation in this function.
Write a void function called largerThanLast whose heading is given below. The function should print all the numbers in the array which are larger than the last element in the array. arraySize represents the number of elements in the array. void largerThanLast (int List[ ], int arraySize)
Q3: write a program to pass a two dimensional array as a parameter to a function which is used to find the summation of the upper triangular elements of the array. Co 0 Co1 Co 2 Col 3 Ro 0 Ro 1 Ro 2 Ro 3