Arrays/Stacks/Queues

One or more correct

• A$1S, 2Q, 3S, 4S, 5Q$
• B$1Q, 2Q, 3S, 4S, 5Q$
• C$1Q, 2Q, 3Q, 4S, 5S$
• D$1S, 2S, 3S, 4Q, 5Q$

One or more correct

• AKeep with every record in the stack, a pointer to the record with the smallest key below it.
• BKeep a pointer to the record with the smallest key in the stack.
• CKeep an auxiliary array in which the key values of the records in the stack are maintained in sorted order.
• DKeep a Min-Heap in which the key values of the records in the stack are maintained.

int first=0, second=0, len1=0, len2=0, maxlen=0;
for (int i=0; i < n; i++) {
  if (X[i] == first) {
    len2++; len1++;
  } else if (X[i] == second) {
    len2++;
    len1 = (P);
    second = first;
  } else {
    len2 = (Q);
    len1 = 1; second = first;
  }
  if (len2 > maxlen) {
    maxlen = len2;
  }
  first = X[i];
}

Single correct

• A(P) len1+1 (Q) len2+1
• B(P) 1 (Q) len1+1
• C(P) 1 (Q) len2+1
• D(P) len2+1 (Q) len1+1

One or more correct

• A100, 200, 400, 300
• B200, 300, 400, 100
• C400, 200, 100, 300
• D300, 200, 400, 100

#include <stdio.h>
int main(){
  int arr[4][5];
  int i, j;
  for (i=0; i<4; i++){
    for (j=0; j<5; j++){
      arr[i][j] = 10*i + j;
    }
  }
  printf("%d", *(arr[1] + 9));
  return 0;
}

Single correct

• A14
• B20
• C24
• D30

Answer key coming soon

Single correct

• AI only
• BII only
• CBoth I and II
• DNeither I nor II

Answer key coming soon

Numerical answer

#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));
}

Numerical answer

Single correct

• AA queue cannot be implemented using this stack.
• BA queue can be implemented where ENQUEUE takes a single instruction and DEQUEUE takes a sequence of two instructions.
• CA queue can be implemented where ENQUEUE takes a sequence of three instructions and DEQUEUE takes a single instruction.
• DA queue can be implemented where both ENQUEUE and DEQUEUE take a single instruction each.