1. Consider the following code:int nums[10] = {4, 5, 6, 7, 8, 9, 10, 11, 12, 13};
int *pInt;
pInt = &nums[7];
pInt -= 2;
*pInt = 15;
What will be the resulting array when this code is completed? Explain.
2. Consider the following code:
int i;
int smallest;
int nums[10] = {4, 20, 18, 7, 2, 19, 50, 6, 74, 37};
smallest = nums[0];
for (i = 1; i < 10; i++) {
if (nums[i] < smallest) smallest = nums[i];
}
cout << smallest;
a. Rewrite the code using pointers. Specifically, instead of i and smallest, use
int* pInt;
int* pSmallest;
b. Which version of the code do you find easier to read?
3. Take the multi-purpose sorting program that uses function pointers. Create a new auxiliary function such that the routine will sort numbers in ascending order, but all zeros will be placed at the end of the list. For example, an array with 3, 0, -5, 9, 22, 0, 14, 7 would be set to -5, 3, 7, 9, 22, 0, 0.
4. Create a BaseballBatter class that records the batting statistics for an individual player. It should have "get" and "set" methods for the following values: at-bats, singles, doubles, triples, and home runs. The "set" methods should check that only non-negative values are set. In addition, the class should have the following methods:
a. A validData method that returns true if the number of at-bats is greater than the number of hits.
b. A battingAverage method that returns the batting average.
c. A sluggingPercentage method that returns the slugging percentage (google the term if you are unfamiliar with it).
Create a simple main function to test your class and split the program into three files as before.