Create two dynamic arrays A and B with random numbers. a) Merge B in array A calling a function by reference. b) Delete the Prime numbers from the merged array A calling a function by pointer. c) Print the Array A in ascending order. You have to use only two Arrays A and B throughout the code. Be careful about memory leakage. Example: A= [20, 30, 5, 7, 19] B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like- A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like- A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending order A= [10, 15, 20, 30, 25]

Create two dynamic arrays A and B with random numbers. a) Merge B in array A calling a function by reference. b) Delete the Prime numbers from the merged array A calling a function by pointer. c) Print the Array A in ascending order. You have to use only two Arrays A and B throughout the code. Be careful about memory leakage. Example: A= [20, 30, 5, 7, 19] B= [19, 10, 15, 11, 17, 25] a) After merging B in A, the merged Array A will look like- A= [20, 30, 5, 7, 19, 19, 10, 15, 11, 17, 25] b) After deleting prime numbers the merged Array would look like- A= [20, 30, 10, 15, 25] c) Finally print the merged array in ascending order A= [10, 15, 20, 30, 25]

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

3. Implement a function called findLargestIndex which returns the index of the rowwith the largest sum.ex. int array[3][6] = {{3, 6, 8, 2, 4, 1}, // sum = 24{2, 4, 5, 1, 3, 4}, // sum = 19{1, 0, 9, 0, 1, 0}}; // sum = 11If the findLargestIndex function was called using this array, it would return 0, asit is returning the index of the row, not the sum.Note that the number of columns is required when passing a 2d array to a function.Assume that 2D arrays passed to this function will have 6 columns.Title line: int findLargestIndex(int array[][6], int rows, int columns);
1. single element of an array can be passed to the function? true or false. 2. Array can be declared as constant? true or false. 3. which of the following gives the memory address of the first element in array x? a. X b. X[0] c. X{0} d. X_0 e. X(0) 4. The index of the last element of array X whose size is S? a. S+1 b. S-1 c. 0 d.1000 e. S 5. Assume you have the following declarations const int MAX = 1000;double A[MAX];which of the following sentences is incorrect? a. The assingnment statement MAX = 1000 is mandatory. b. we can store up to 1000 values in the mandatory. c we cannot change the size of the array A during the runtime. d. all values in the array are set to ZERO's (0) e. all above sentences are correct. 6. The only difference between char array and string is that, the string ends with '\0'? true or false. 7. Index of an array can be of type integer or double, since both deals with the digits? True or False 8. Which definition describes the term Array precisely?…
Consider the following function main:int main(){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 one-dimensional array of type int to0.b. Write the definition of the function inputArray that prompts the user to input 20 numbers and storesthe numbers into alpha. Ex-10 ENGR2217 SP20c. Write the definition of the function doubleArray that initializes the elements of beta to two timesthe corresponding elements in alpha. Make sure that you prevent the function from modifying theelements of alpha.d. Write the definition of the function printArray that prints any one- dimensional array of type int.Print 15 elements per line.
2. Write a program which sorts the CGPA array having cgpa of all students in ascending order by using bubble sort and make use of pointers for each and every variable and constant and array.
5. Using c++, Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.
Given these two arrays, char arrA[] = {'a', 'e', 'i', 'o', 'u'} and char arrB[] = {'T', 'A', 'B','L','E'}, merge these two arrays into a new array. Make sure that the contents of arrA is interspersed with contents of arrB.
C++ We would like to write a void function, call it "makeNewArray", that will print a new array by taking an existing array and updating each element by subtracting the first item to its right that is equal to or less than itself. For example: existing array x = {6,2,3,1,6,1,1,7,8} becomes x = {4,1,2,0,5,0,1,7,8} the void function should print the updated array, the sum of its elements, and a list of the positions of the elements that could not be updated due to the condition (in this case it would be 1,7, and 8) *think of nested loops and the use of break statements where appropriate. cannot be done using pointers
3. Consider an 1-d array of type int and a pointer pointing variable pointing to the 2nd item of the array. Write down the code for the following: int arr(10) = (5,6,23,4,89,70,12,78,33); int *ptr = arr+1; (a) Print the first item of the array using ptr. (b) Print all prime numbers of the array using value at address. (c) Print the last item of the array using a pointer to an array. You are not allowed to initialize the pointer to the address of the last item. Iterate using a loop to change the value of the pointer. (d) Now print the array in reverse order using a pointer. 101
CODE IN C++.Write the code to copy values in one array to another. In the following code snippet, we copy values from intArr1 to intArr2. Also, intArr1 will no longer be used and therefore the memory used for intArr1 should be deallocated....int * intArr1 = new int [2];// assign values to intArr1...int * intArr2; // now write the code for allocating space for intArr2, copying values from intArr1 to intArr2, and for deallocating space used by intArr1.
Create two dynamic arrays A and B with random numbers.a) Merge B in array A calling a function by reference.b) Delete the composite numbers from the merged array A calling a function bypointer. You have to use only two Arrays A and B throughout the code. Be carefulabout memory leakage.
Write a function for given main functionint * return_an_array(int n)which takes an integer n and returns a pointer to an array (allocated off of the heap inthe function) containing the digits of n in the appropriate positions. If n = 0 return 0(which is the “null” pointer). Recall an array name is just a pointer to the first element ofthe array. Please use following main to test your function.int main() {int *a = return_an_array(23542); // array of size 5for(int i=0;i<5;i++)cout<<a[i]<<" "; // print 2 3 5 4 2cout<<endl;delete [] a;int *b = return_an_array(12345678); // array of size 8for(int i=0;i<8;i++)cout<<b[i]<<" "; // print 1 2 3 4 5 6 7 8cout<<endl;delete [] b;return 0;}
Modify the following code to add a new function called “delete_target” that will delete the target value from the array and update the array accordingly.Code:#include <stdio.h> #define NOT_FOUND -1 int search(const int arr[], int target, int n);int main(){ int s[] = {1,2,3,4,5,6,10}; int index; int ID_SIZE = 7; index = search(s,10,ID_SIZE); printf("%d",index); return 0;}int search(const int arr[], int target, int n)[15]{ int i, found = 0, where; i = 0; while (!found && i < n) { if (arr[i] == target) found = 1; else ++i; } if (found) where = i; else where = NOT_FOUND; return (where); }