Consider a 2D integer array A of dimensions 10 x 20 stored in row-major order starting at base address 1000. If each integer occupies 4 bytes, calculate the memory address of element A[4][5].
Address = Base + (row * Total_Cols + col) * size = 1000 + (4 * 20 + 5) * 4 = 1000 + 85 * 4 = 1000 + 340 = 1340.
What is the output printed by the following code?
#include <stdio.h>
int main(void) {
int a[] = {2, 4, 6, 8, 10};
int *p = a + 1;
int *q = a + 4;
printf("%d", (int)(q - p));
return 0;
}Pointer subtraction q - p calculates element index distance: (index 4) - (index 1) = 3.
What is the return value of main()?
#include <stdio.h>
int main(void) {
int arr[5] = {1, 2, 3, 4, 5};
int sum = 0;
for (int *p = arr; p < arr + 5; p++) {
sum += *p;
}
return sum;
}The pointer loop iterates through all elements 1 to 5, calculating sum = 1 + 2 + 3 + 4 + 5 = 15.
What is the output of the following C program?
#include <stdio.h>
int main(void) {
int arr[] = {4, 20, 30, 40};
int *p = arr;
printf("%d", *(p + 1) - *p);
return 0;
}*(p + 1) accesses arr[1] (20) and *p accesses arr[0] (4). The difference is 20 - 4 = 16.
What is the output of the following C program?
#include <stdio.h>
int main(void) {
int arr[] = {5, 25, 30, 40};
int *p = arr;
printf("%d", *(p + 1) - *p);
return 0;
}*(p + 1) accesses arr[1] (25) and *p accesses arr[0] (5). The difference is 25 - 5 = 20.