Explanation of Solution
The program has been explained in the in-lined comments:
#include <iostream>
using namespace std;
int main()
{
//declare int pointers
int *intArrayPtr;
int *temp;
//creates an array of five components of type int and
//stores the base address of the array
//into the pointer intArrayPtr
intArrayPtr = new int[5];
//contents of the base address of the array is
//assigned a value of 7 i.e. intArrayPtr[0] is 7
*intArrayPtr = 7;
//temp is assigned the value of intArrayPtr
//so it also points to array base address
//i.e. intArrayPtr[0]
temp = intArrayPtr;
//modify the contents of the array inside for loop
for (int i = 1; i < 5; i++)
{
//increment pointer to the next address
//i.e. next element in the array
intArrayPtr++;
//assign the value of the current element
//pointed to by intArrayPtr with the value
//on RHS ...
Want to see the full answer?
Check out a sample textbook solutionChapter 12 Solutions
C++ Programming: From Problem Analysis to Program Design
- In java Develop a function that accepts an array and returns true if the array contains any duplicate values or false if none of the values are repeated. Develop a function that returns true if the elements are in decreasing order and false otherwise. A “peak” is a value in an array that is preceded and followed by a strictly lower value. For example, in the array {2, 12, 9, 8, 5, 7, 3, 9} the values 12 and 7 are peaks. Develop a function that returns the number of peaks in an array of integers. Note that the first element does not have a preceding element and the last element is not followed by anything, so neither the first nor last elements can be peaks. Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function would return 6, since the subsequence {1, 4, 6} is the longest that is strictly increasing. Develop a function that takes a string…arrow_forwardDescribe what problem occurs in the following code. What modifications should be made to it to eliminate the problem? int[] sums = {6, 12, 3, 32, 12, 10, 9, 6}; for (int index = 1; index <= sums.length; index += 1) { System.out.println(sums[index]); }arrow_forwardCan you please explain this C code beside every code on each line: #include <stdio.h> int main() { long long int level; long long int time; long long int orderTime; long long int minimumTime = 0; scanf("%d", &level); getchar(); long long int array1[level]; long long int array2[level + 1]; long long int array3[level + 1]; for(int i = 0; i < level - 1; i++) { scanf("%lld", &array1[i]); getchar(); } for(int i = 0; i < level; i++){ scanf("%lld", &array2[i]); getchar(); } for(int i = 0; i < level; i++){ scanf("%lld", &array3[i]); getchar(); } for(int i = level - 1; i >= 1; i--) { if(array3[i] > array2[i]) { time = array3[i] - array2[i]; array2[i - 1] = array2[i - 1] - time; array2[i] = array2[i] + time; orderTime =…arrow_forward
- Consider the following code: int a[5] = {1,3,5,7,9};int b = a[3]; // <--- here Rewrite the last statement (marked “here”) without using array brackets [ ]. Group of answer choices int b = a + 3; int b = *(a + 3); int b = *a + 3; int b = *(a + 2);arrow_forwardWrite a lambda expression to count odd numbers in the following array, using a seed value of 0. Display your result on Console. int[] array = { 8,2,2,24,5,7,5,3,2,10};arrow_forwardWrite two overloaded functions that return the sum of values at even locations of an array with the following headers:int sumOfEven(const int* array, int size);double sumOfEven(const double* array, int size);Write a test program that reads five integers or double values, invokes this function, and displays the sum of values at even locations.arrow_forward
- Define the meaning of the following array by illustrating the array list. i. int total[10] = {0}; ii. int total[10] = {8, 5, 12}; iii. int total[ ] = {5, 6, 3}; iv. total[2] = 3; v. int total[4] = {1, 2, 3, 4};arrow_forwardSuppose array a is int[] a = {1, 2, 3, 5, 7}, what is a[0] - a[2]? A. -2 B. 1 C. 2 D. -1arrow_forwardThis is the code so far #include <iostream> // for cin and cout#include <iomanip> // for setw() and setfill()using namespace std; // so that we don't need to preface every cin and cout with std:: void printSpaces(int n, int end){for (int j = n; j > end; j--){cout << " ";}}void printFirstTwoBuildingSection(int n, int startSpacing){int start = 2 * ((n / 2) - 1), end = 0;for (int i = 0; i < n; i++){printSpaces(startSpacing, 0);cout << "|";if (i < (n / 2)){printSpaces(i, 0);cout << "\\";printSpaces(start, 0);cout << "/";start -= (2);printSpaces(i, 0);cout << "|" << endl;}else{printSpaces(n - i - 1, 0);cout << "/";printSpaces(end, 0);cout << "\\";end += (2);printSpaces(n - i - 1, 0);cout << "|" << endl;}}printSpaces(startSpacing, 0);cout << "/";for (int i = 0; i < n; i++){cout << "-";}cout << "\\" << endl;}int main(){int menuOption = 0; cout << "Choose from among the following…arrow_forward
- Given an array arr of type int, along with two int variables i and j, write some code that swaps the values of arr[i] and arr[j]. Declare any additional variables as necessary.arrow_forward1. When you are taking java, you are aware that a[] is an array, It can also be evalutated under certain circumstances. if you have x[2*z+4], what do you need to be true to evaluate? a. 3<= x < z.length b. 3<= x < (z.length-1)/2 c 2 <= x < z.length d. 4<= x < z.length/2 2. Given the program solve the problem for (int i=0; i ! lolma.length-1; i= i+1){ lolma[i] = lolma[i]+lolma[i+1] the array looks like from 0-3: 5, 9, 1, -3 What will be the next order a. 5,9,1,-3 b. 11,19,3,-5 c. 14,10,-2,-3 d. 5, 14,10,-2arrow_forwardJava - Given the following method header, give the code for the function using a binary search of an array. Don’t worry about the precondition (assume this is already true). public static boolean has10 (int[ ] data, int start, int end) // Precondition: The elements data[start]...data[end] are sorted from smallest to largest. This // array segment might be empty (indicated by end being less than start). // Postcondition: A true return value indicates that the number 10 appears in the array // data[start]...data[end]. A false return value indicates that 10 doesn’t appear.arrow_forward
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education