// Use pointer p to traverse the 2D array of characters variable 'strings' (input from user in main() ) and set all characters in each // array to a null terminator so that there is a 4 row and 50 column 2D array full of null terminators. // The null terminator '\0' is used to denote the end of a string. void initializeStrings(char strings[NUM_STRINGS][STRING_LENGTH]) { char *p = &strings[0][0]; // enter code here }

// Use pointer p to traverse the 2D array of characters variable 'strings' (input from user in main() ) and set all characters in each // array to a null terminator so that there is a 4 row and 50 column 2D array full of null terminators. // The null terminator '\0' is used to denote the end of a string. void initializeStrings(char strings[NUM_STRINGS][STRING_LENGTH]) { char *p = &strings[0][0]; // enter code here }

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);
An array with any number of elements is said to be repeating if any two or more of the elements are appearing in sequential an indexes after each other.Write a C++ function that accepts an integer array and returns 1 or “Repeating” if it is a repeating array, otherwise it returns 0 or “Not Repeating”. For Instance:2, 3, 5, 6, 7, 7, 7, 6, 8, 10 - Repeating2, 3, 4, 6, 4, 6, 4, 7, 8, 9 - Not repeating
I want this code in C++ #include <stdio.h> #include<malloc.h>//function to fillint Equalcols(int *A,int rows,int cols){ //creating a dynamic array of length cols to store sum of each column int *b=(int*)(malloc(sizeof(int)*cols)); int i,j; //initializing the values zero in b array for(i=0;i<cols;i++) { *(b+i)=0; } //loop to add elements of each column to respective index in b array for(i=0;i<rows;i++) { for(j=0;j<cols;j++) { //adding value of element in respective column to index in b array *(b+j)+=*(A+j+cols*i); //printf("%d %d\n",j+cols*i,*(A+j+cols*i)); } } //loop to check whether sum is equal or not for(i=1;i<cols;i++) { //printf("%d %d\n",*(b+i-1),*(b+i)); //checking for consecutive value are not equal if(*(b+i-1)!=*(b+i)) { //returning 0 return 0; } } //returning 1 return 1;} int…
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;}
Suppose you have an array of integer caller myArray that is arranged in ascending order. Write a user-defined function in C++ to search for an integer from myArray using the Binary Search method, this function returns an integer 0 if the number is not found and integer 1 if the number is found. The function should have three parameters: array myArray, array size N, and the number to be searched key.
In C++,Given two parallel arrays and a pointer into one of them, use pointer math to access the coinciding element of the second array. Here are the declarations we are dealing with: double arr1[MAX]; char arr2[MAX]; double * p; // points into arr1 at a particular element Show code to print the element of arr2 that corresponds to *p (from arr1) -- use no variables beyond what are given here.
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.
Please help me with this: using js create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your…
Rewrite the Binary search function in the textbook to use a generic type for the array elements. Test the function with arrays of int, double, and string values. *When using test arrays make sure elements are stored in ascending sorted order*
Write a Program for insertion and deletion from an array without replacement of element from the arrays. Also, write a program to search the array for the presence of a given element from an array. Write the sub-functions in the provided test case in text form and upload the same. #include<stdio.h> #include<stdlib.h> int cmpfunc (const void * a, const void * b) { return ( *(int*)a - *(int*)b ); } int insert_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of insertion, x: element to insert*/ /*output:-1 indication error or 0 if successful /* write the function for inserting element into a position*/ } int delete_function(int *data, int n, int p, int x) { /* input data: array, n: size of array, p: position of deletion, x: element to deletion*/ /*output:-1 indication error or 0 if successful /* write the function for delete element into a position*/ } int linear_search_function(int *data, int n, int x) { /*write the function to…
Write a function that takes two int arrays arr1 and arr2, and their size n as parameters. The functionreturns the number of elements that exist in arr1 and arr2 with indexes i1 and i2 respectively such that i1>=i2.(Example: arr1: [ 1,5,2,3,4,0,7] arr2: [0,1,3,7,4,2] then the function returns 3 ( 0,3,7) )
Given the following, write a line of code that will initialize p to point to the “7” inthe array).unsigned char x[] = {2, 3, 5, 7, 11, 13, 17};unsigned char *p, *q; If pointer q in the previous question points to some element of array x, whatexpression will return the index of the element pointed to? E.g., if q points to the 13in the above array, then your expression should return 5 In C Programming Please!