Arrays/Stacks/Queues

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.

C = 100;
for i = 1 to n do
    for j = 1 to n do
    {
        Temp = A[i][j] + C;
        A[i][j] = A[j][i];
        A[j][i] = Temp - C;
    }
for i = 1 to n do
    for j = 1 to n do
        output (A[i][j]);

Single correct

• AThe matrix A itself
• BTranspose of the matrix A
• CAdding 100 to the upper diagonal elements and subtracting 100 from lower diagonal elements of A
• DNone of the above