28 12 23 KLU FN CLUSTER 5

#include<stdio.h> int main(void) { int arr[5] = { 1, 2, 3, 5, 7 }; int *ptr = (&arr + 1); printf("%d %d\n", *(arr + 1), *(ptr - 1)); return 0; }

• 2 5
• 3 5
• 2 7
• 3 7

#include<stdio.h> int main() { int a[][3] = {0, 1, 2, 3, 4, 5}; int (*ptr)[3] = a; printf("%d %d ", (*ptr)[0], (*ptr)[1]); ++ptr; printf("%d %d\n", (*ptr)[0], (*ptr)[1]); return 0; }

• 0 1 3 4
• 0 1 0 1
• 0 1 2 3
• 0 1 1 2

#include<stdio.h> void fun(char**); int main() { char *arr[] = { "bat", "cat", "fat", "hat", "mat", "pat" }; fun(arr); return 0; } void fun(char **p) { char *t; t = (p += sizeof(int))[-1]; printf("%s\n", t); }

• mat
• fat
• hat
• cat

#include<stdio.h> int main() { int arr[ ]={1.2, 2.4, 3.6, 4.8, 5}; int j, *ptr = arr; for(j = 0;j<5;j++) { printf("%d ", *arr); ++ptr; } }

• 2 2 2 2 2
• 1 1 1 1 1
• 1 2 3 4 5
• None of the above

#include<stdio.h> int main() { char s[] = {'a', 'b', 'c', '\n', 'c', '\0'}; char *p, *str, *str1; p = &s[3]; str = p; str1 = s; printf("%d", ++*p + ++*str1-32); return 0; }

• 76
• 77
• 78
• 79

#include<stdio.h> int main() { int arr[5] = { 1, 3, 5, 7, 11 }; int *ptr; ptr = &arr; printf("%d", *ptr + 1); }

• 1
• 2
• 3
• Runtime error

#include<stdio.h> int main() { static char *arr[ ] = {"bike", "bus", "car", "van"}; char **ptr[ ] = {arr+3, arr+2, arr+1, arr}; char ***p; p = ptr; **++p; printf("%s",*--*++p + 2); }

• Nothing prints
• ke
• ike
• Compilation error

#include<stdio.h> #define arr[5] {1, 2, 3, 4, 5} int main() { printf("%d", arr[1]); return 0; }

• 1
• 2
• Compilation error
• Runtime error

#include<stdio.h> void array(int **p); int main() { int arr[2][3] = {{3, 6, 9 }, {12, 15, 18}}; int *ptr; ptr = &arr; array(&ptr); return 0; } void array(int **p) { printf("%d", **p); }

• address of first element in array
• 3
• address of ptr
• Runtime error

#include<stdio.h> int main() { int a = 130; char *ptr; ptr = (char *)&a; printf("%d ",*ptr); return 0;. }

• -126
• Run Time Error
• Garbage value
• Compile Time Error