Consider the following C program :

#include <stdio.h>
int main( ) {
    int a;
    int arr[5]={30,50,10};
    int *ptr;
    ptr = &arr[0] + 1;
    a = *ptr;
    (*ptr)++;
    ptr++;
    printf("%d",a + (*ptr) + arr[1]);
    return 0;
}

The output of the above program is _________. (Answer in integer)

Consider the following C program :

#include <stdio.h>
int g(int n) {
    return (n+10);
}
    int f(int n) {
    return g(n*2);
}
int main() {
    int sum, n;
    sum=0;
    for (n=1; n<3; n++)
    sum += g(f(n));
    printf("%d", sum);
    return 0;
}

The output of the given C program is ________. (Answer in integer)

Which ONE of the following languages is accepted by a deterministic pushdown automaton?

Let $G_1, G_2$ be Context Free Grammars (CFGs) and $R$ be a regular expression. For a grammar $G$, let $L(G)$ denote the language generated by $G$. Which ONE among the following questions is decidable?