Consider the following code segment: int a[45]; P(a); // call function p with argument a (the array above) int p(int *k){ // this is function p cout<<”the size of array k is”<<_What goes here?__ } a.)sizeof(k)/sizeof(int) b.)sizeof(int)/sizeof(a) c.)sizeof(a)/sizeof(int) d..)More than one correct choices listed e.)No correct answer

Consider the following code segment: int a[45]; P(a); // call function p with argument a (the array above) int p(int *k){ // this is function p cout<<”the size of array k is”<<_What goes here?__ } a.)sizeof(k)/sizeof(int) b.)sizeof(int)/sizeof(a) c.)sizeof(a)/sizeof(int) d..)More than one correct choices listed e.)No correct answer

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 3PP: (Numerical) Given a one-dimensional array of integer numbers, write and test a function that...

See similar textbooks

Similar questions

Exercise 1: //The max function the max between a and b, it returns a if a == //b public double max(double a, double b); //The mult function returns the result of a * b public double mult(double a, double b); //The exist in array function returns the index of the element //‘a’ if //‘a’ exist in array ‘arr’ otherwise returns ‘-1’ public int existsInArray(int [] arr, int a); //Are array equals method compares two arrays and returns true // if the elements of array ‘a’ are equal to elements of array // ‘b’, element by element. If equals it returns 0, it returns - // 1 if not public int areArrayEquals(int [] a, int [] b); Devise four executable test cases for every method in the JUnit notation. See the attached handout for a refresher on the notation.
Given the following struct definition; #define MAX 20 typedef struct{ int items[MAX]; int count;}Array;Define the functions:void addItem(Array *a, int item); // adds item to the arrayvoid printArray(Array a); // displays elements of itemsint isFull(Array a); //returns 1 if the items is full; 0 if otherwiseint isEmpty(Array a); //returns 1 if the items is empty; 0 if otherwise
Write a function definition for a function named getLast which does the following:1) Accepts the array, size of the array and value as parameters.2) Returns the last index of a value in an integer array. If the value does not exist in the array, return -1.ExampleGiven the array {3, 6, 8, 3, 2, 6}.Given the value 6, this function getLast returns the value 5 which is the last index of 6 in the array.
write a function that performs this array manipulation with the given parameters. array manipulation: original array = {1,2,3} array after function = {1,2,2,3,3,3} void array_manip( unsigned int*& array, size_t& size) { } please use C++
// New Function prototypes void showValues(const int *, int); // display 10 numbers in a line from the array void fillArray(int *, int, int, int); // fill out random numbers between low and high into the array bool searchValue(const int *, int, int); // search value from the array void sortArray( int *, int); //sort the array in an ascending order void swap(int *, int *); //swap the values Modify the code below to create 50 random numbers instead of 10 and use the above new function protoypes. In the output, remove the display of the minimum, maximum and average from the array. Modify the showValues() function to display 10 numbers in a line from the array. [Part 2] Add the two functions to sort an array in an ascending order: void sortArray(int*, int); //ascending ordervoid swap(int*, int*); In the sortArray() function called the swap() function to swap the values from two elements in the array. Code: #include <iostream>#include <iomanip>#include…
Write a function definition for a function named sumLessThanX which does the following:1) Accepts the array, size of the array and value as parameters.2) Returns the sum of all values less than a specified value in an integer array.ExampleGiven the array {3, 6, 8, 3, 2, 6}.Given the value 4, the sumLessThanX function returns the value 6 which is the sum of 3, 3 and 2.
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.
//Required Functionvoid func(int array_1[],int array_2[],int size){ for(int i=0;i<size;i++){ if(array_2[i]>array_1[i]){ array_1[i]=array_2[i]; } } return;} //main function to test the function.int main(){ int size=6; int a[]={1,5,9,8,7,6}; int b[]={1,4,10,12,7,15}; printf("First array before function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } func(a,b,size); //call to the created function printf("\nFirst array after function call: "); for(int i=0;i<size;i++){ printf("%d ",a[i]); } return 0;} 1. Write the statements to do the following: write a prototype for your function in the previous problem write a main function which includes the following steps declare two arrays of ints with 25 elements each prompt the user and read values into both arrays call your function from the previous problem print both arrays
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.
The correct function header that reference to array as function parameter (function increment contents of array passed as a parameter to it) Select one: O a. void inc_array(int *arr) O b. void inc_array(int &arr) O c. void inc_array(int arr) O d. void inc_array(int *arr[])
in c++ 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 nonnegative values.) Demonstrate your pointer prowess by using pointer notation instead of array notation in this function.
Typedef struct Complex { Double a; Double b; } COMP_t, *COMP; -write a function which finds and returns the position of the complex number whose absolute value is maximum in a two dimensional array of complex numbers.Absolute value of z=a+bi is |z|=(a^2+b^2)^1/2