A system has 6 identical resources and N processes competing for them. Each process can request atmost 2 resources. Which one of the following values of N could lead to a deadlock?

A computer system implements a $$40$$-bit virtual address, page size of $$8$$ kilobytes, and a $$128$$-entry translation look-aside buffer $$(TLB)$$ organized into $$32$$ sets each having four ways. Assume that the $$TLB$$ tag does not store any process id. The minimum length of the $$TLB$$ tag in bits is ________________.

Consider the following function written in the C programming language.

void foo(char *a){
 if ( *a && *a != ' '){
     foo(a+1);
     putchar(*a);
   }
}

The output of the above function on input “ABCD EFGH” is

Consider the C program below.

#include < stdio.h >
int *A, stkTop;
int stkFunc(int opcode, int val)
{
     static int size=0, stkTop=0;
     switch (opcode) {
         case -1: size = val; break;
         case 0: if (stkTop < size) A[stkTop++] = val; break;
         default: if (stkTop) return A[--stkTop];
     }
     return -1;
}
int main()
{
     int B[20]; A = B; stkTop = -1;
     stkFunc (-1, 10);
     stkFunc ( 0, 5);
     stkFunc ( 0, 10);
     printf ("%d\n", stkFunc(1, 0) + stkFunc(1, 0));
}

The value printed by the above program is __________.