Given an Array M of 99 int values, and int *pit: 1. Declare two pointers p1 and p2 2. Make p1 point to the first odd value in M. 3. Make p2 point to the last negative value in M. 4. Make p1 and p2 point to array locations index 15 and index 33 5. Use pointer pit to print all elements in the array in reverse. 6. Find the count elements between p1 and p2 inclusive. 7. Find the product of values between p1 and p2. 8. Use pointer pit to print all odd values between p1 and p2 exclusively. 9. Use pointer pit to print all values between p1 and p2 inclusive that are odd and divisible by 5. 10. Use pit to replace all even and negative values in M with 7.

Given an Array M of 99 int values, and int *pit: 1. Declare two pointers p1 and p2 2. Make p1 point to the first odd value in M. 3. Make p2 point to the last negative value in M. 4. Make p1 and p2 point to array locations index 15 and index 33 5. Use pointer pit to print all elements in the array in reverse. 6. Find the count elements between p1 and p2 inclusive. 7. Find the product of values between p1 and p2. 8. Use pointer pit to print all odd values between p1 and p2 exclusively. 9. Use pointer pit to print all values between p1 and p2 inclusive that are odd and divisible by 5. 10. Use pit to replace all even and negative values in M with 7.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

6. Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).Do In c Program
Read in two integers n and m (n, m < 50). Read n integers in an array A. Read m integers in anarray B. Then do the following (write separate programs for each, only the reading part iscommon).a) Find if there are any two elements x, y in A and an element z in B, such that x + y = z.b) Copy in another array C all elements that are in both A and B (intersection).c) Copy in another array C all elements that are in either A and B (union).d) Copy in another array C all elements that are in A but not in B (difference).c programm please tell all the answer
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.
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;}
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);
C++ By defining a dynamic allocation for pointer array, ask the user to enter some numbers and then return a sorted list of those numbers.
ALGO1(A)// A is an integer array, an index that starts at 11): for i=1 to n-1 do2): minIndex = findSmallest(A,i)3): exchange A[i] with A[minIndex] The sub-routine find the smallest(A, i) in Line 2, and returns the index of the smallest element in thesub-array A[i:n]Suppose the array below is provided as input to ALGO1 2 5 6 7 3 8 1 4 Fill in the Blanks At the end of the first iteration of the for loop (i.e. with i=1)1) a) the element at index 1 is : b) the element at index 4 is : c) the element at index 7 is :
Please define and initialize and array X of length 8. You need implement following and write outcomes with reasons; int X[ ] = { 1,2,3,4,5,6,7,8 }; 1.cout<< X+1; 2.cout<<&X+1; 3.cout<<2[X]; 4.cout<<&X[0]+1; 5.cout<<*(X+1); 6.cout<<*X+1; Also, practice and play with pointers using multiplication, division, subtraction and addition. You may also play with it your ways and find out reasoning. Write down those reasoning.
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.
Write a program that uses random number generation to create sentences.The program should use four arrays of pointers to char called article, noun, verband preposition. The program should create a sentence by selecting a word atrandom from each array in the following order: article, noun, verb, preposition,article and noun. As each word is picked, it should be concatenated to the previouswords in an array large enough to hold the entire sentence.The words should be separated by spaces. When the final sentence is output, itshould start with a capital letter and end with a period. The program shouldgenerate 20 such sentences. The arrays should be filled as follows: The article arrayshould contain the articles "the", "a", "one", "some “and "any"; the noun arrayshould contain the nouns "boy", "girl", "dog", "town" and "car"; the verb arrayshould contain the verbs "drove", "jumped", "ran", "walked" and "skipped"; thepreposition array should contain the prepositions "to", "from", "over",…
write a program using pointers to find the smallest index of the large element : often you need to locate the largest element in an array . if an array has multiple elements with the same largest value , find the smallest index of such an element. suppose the array my list is {1,2,3,4,5,5}. so, the largest element is 5 and the smallest index for 5 is 1 .
Implement the function below. void swap(int pos1, int pos2){} Initial code to be completed: class ArrayList : public List { int* array; int index; int capacity; void dyn_all_add(){ int cap = ceil(capacity * 1.5); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } void dyn_all_rem(){ int cap = capacity - (capacity/3); array = (int*)realloc(array,cap * sizeof(int)); capacity = cap; } public: // CONSTRUCTOR ArrayList() { capacity = 4; array = (int*)malloc(capacity); index = 0; } int add(int num) { if (index == capacity){ dyn_all_add(); } *(array + index) = num; index++; return index; } int get(int pos){ if (pos-1 < index){ return *(array + pos-1); } return -1; } int size(){ return index; }…