Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include int last0f(const int a[], int aLen, const int b[], int bLen) { int pos = -1; for (size t i = 0; i < aLen; ++i) if (a[i] == pos) pos = i; return pos; 3 4 7 8 9. 10 11 } CodeCheck Reset Testers Running Tester.cpp fail pass fail fail fail al->[3, 2, 11, 10, 1] b1->[8, 10, 6] last0f (al, 5, b1, 3): -1 Expected: 3 al->[3, 2, 11, 10, 1] b2->[5, 6] lastof (al, 5, b2, 2): -1 Expected: -1 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b2->[5, 6] last0f (a2, 11, b2, 2): -1 Expected: 6 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b1->[8, 10, 6] last0f (a2, 11, b1, 3): -1 Expected: 10 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b3->[11, 2, 1, 15] last0f(a2, 11, b3, 4): -1 Expected: 8 Score 1/5

Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include int last0f(const int a[], int aLen, const int b[], int bLen) { int pos = -1; for (size t i = 0; i < aLen; ++i) if (a[i] == pos) pos = i; return pos; 3 4 7 8 9. 10 11 } CodeCheck Reset Testers Running Tester.cpp fail pass fail fail fail al->[3, 2, 11, 10, 1] b1->[8, 10, 6] last0f (al, 5, b1, 3): -1 Expected: 3 al->[3, 2, 11, 10, 1] b2->[5, 6] lastof (al, 5, b2, 2): -1 Expected: -1 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b2->[5, 6] last0f (a2, 11, b2, 2): -1 Expected: 6 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b1->[8, 10, 6] last0f (a2, 11, b1, 3): -1 Expected: 10 а2->[4, 12, 12, 10, 12, 1, 5, 10, 11, 9, 8] b3->[11, 2, 1, 15] last0f(a2, 11, b3, 4): -1 Expected: 8 Score 1/5

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 3PE

See similar textbooks

Similar questions

Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 3 int lastof(const int a[), int alen, const int b[], int blen) 4 { int res = 0; for (int i = 0; i =0 ; j--) if (b[j] == a[i]) { if(res[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b1->[7, 5, 9] last0f(al, 14, b1, 3): -1 Expected: 12 al->[1, 9, 4, 5, 1, 5, 1, 12, 8, 11, 2, 11, 7, 8] b2->[7, 7] lastof (al, 14, b2, 2): -1 Expected: 12 a2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b2->[7, 7] lastof (a2, 11, b2, 2): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 1ө, 11, 13, 14] b1->[7, 5, 9] last0f (a2, 11, b1, 3): -1 Expected: -1 а2->[3, 2, 1, 14, 10, 6, 13, 10, 11, 13, 14] b3->[11, 2, 1, 15] lastof (a2, 11, b3, 4): -1 Expected: 8 Score 2/5
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.
Write the function lastOf which searches the array a for the last occurance of any value contained in the array b. Returns the index if found. If not found, return -1. arrays.cpp 1 #include 2 int last0f(const int a[], int alen, const int b[], int bLen) { 3 4 5 6 7 8 }
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.
Description of the assignment: Your program should read in a set of grades (that are all integers) entered by the user. The user will signify the end of the list of grades by entering -999. Do NOT process this value. You can assume that the user will enter at least three grades and not more than 100 grades, all of which will be integers in between 0 and 100, inclusive. For the set of grades, your program should compute the minimum value, print this out to two decimal places and remove it from the data. Then your program should compute the maximum value, print it out to two decimal places and remove it from the data. Then, your program should calculate the mean and standard deviation for the remaining set of grades, and print these out to two decimal places. Finally, a histogram for this data (without the highest and lowest grades) should be printed out as well. Your program should include the following functions: void readGrades (double grades [], int *n); /* This function reads an…
int main() { int inStock[10][4]; int alpha[20]; int beta[20]; int gamma[4] = {11, 13, 15, 17}; int delta[10] = {3, 5, 2, 6, 10, 9, 7, 11,1, 8};. . .} a. Write the definition of the function setZero that initializes any onedimensional array of type int to 0. b. Write the definition of the function inputArray that prompts the user to input 20 numbers and stores the numbers into alpha. c. Write the definition of the function doubleArray that initializes the elements of beta to two times the corresponding elements in alpha. Make sure that you prevent the function from modifying the elements of alpha. d. Write the definition of the function copyGamma that sets the elements of the first row of inStock to gamma and the remaining rows of inStock to three times the previous row of inStock. Make sure that you prevent the function from modifying the elements of gamma. e. Write the definition of the function copyAlphaBeta that stores alpha into the first five rows of inStock and beta into the…
Print the elements of the array ‘a’ using the mentioned notations: int a[]={1,2,3,4,5}; int *p; p = a; for (int i = 0; i< 5; i++) { //Subscript notation with name of array //Subscript notation with pointer 'p' //Offset notation using array name //Offset notation using pointer 'p' }
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
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.
String [] plants = newstring [] {“onions”, “carrots”, “peas”, “tomatoes”, “bananas”, “lemons”}; Using the array above , write code that 1. Prints the elements of the array in the order they appear in the array using a lambda function 2. Prints the elements of the array in descending order using a Linq function 3. Prints the elements of the array in ascending order using a linq fucntion 4. Prints the elements of the array that contain “ba” using a linq 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
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.