Answer:
(9F7, 9F8, 9F9, 9FA, 9FB, 9FC, 9FD, 9FE, 9FF, A00, A01, A02, A03)
Explanation:
This means that we must find all hexadecimal values from 2551 to 2563, or 9F7 to A03. You can convert from decimal to hexadecimal for each one, or just count.
Answer:
#include <iostream>//including libraries
using namespace std;
int main()
{
int arr[6] = { 0,1,2,3,4,5 };//make sure size of arr is 1 less than secArr
int secArr[7];//second array (1 element bigger)
for (int i = 0;i < 6;i++)//looping through each element (6 times)
{
secArr[i + 1] = arr[i];//transferring elements to second array and shifting by 1 cell
cout << secArr[i + 1] << endl;//printing elements of second array
}
return 0;//terminating program
}
Explanation:
The array size can range from any number. just make sure to keep arr one less than secArr. This is because we need the room for the extra element. This task is to help you understand how array work and how to parse through them using loops. For loops are the best for this task because even if you think intuitively, they work for as long as there are items in the array. and you can define the size yourself.
............................
Mark me brainliest^^
It Will Say " Too Many People At A Time Trying To Get In " And It Will Say Wait .
