All Programming & Data Structures questions

Single correct

• AThe best algorithm for the problem takes $\theta(n)$ time in the worst case.
• BThe best algorithm for the problem takes $\theta(n\log n)$ time in the worst case.
• CThe best algorithm for the problem takes $\theta(n^2)$ time in the worst case.
• DIt is not possible to reverse a singly linked list in $O(1)$ space.

Answer key coming soon

Single correct

• A$\dfrac{m}{n}$
• B$\dfrac{n}{m}$
• C$\dfrac{2n}{m}$
• D$\dfrac{n}{2m}$

Answer key coming soon

#include<stdio.h>
int main(int argc, char *argv[])
{
  int x = 1, z[2] = {10, 11};
  int *p = NULL;
  p = &x;
  *p = 10;
  p = &z[1];
  *(&z[0] + 1) += 3;
  printf("%d, %d, %d\n", x, z[0], z[1]);
  return 0;
}

Single correct

• A1, 10, 11
• B1, 10, 14
• C10, 14, 11
• D10, 10, 14

Answer key coming soon

Numerical answer

Answer key coming soon

#include<stdio.h>
int main(int argc, char *argv[])
{
  int a[3][3][3] =
  {{1, 2, 3, 4, 5, 6, 7, 8, 9},
   {10, 11, 12, 13, 14, 15, 16, 17, 18},
   {19, 20, 21, 22, 23, 24, 25, 26, 27}};
  int i = 0, j = 0, k = 0;
  for( i = 0; i < 3; i++ ){
    for(k = 0; k < 3; k++ )
      printf("%d ", a[i][j][k]);
    printf("\n");
  }
  return 0;
}

Single correct

• A1 2 3 / 10 11 12 / 19 20 21 (three lines)
• B1 4 7 / 10 13 16 / 19 22 25 (three lines)
• C1 2 3 / 4 5 6 / 7 8 9 (three lines)
• D1 2 3 / 13 14 15 / 25 26 27 (three lines)

Answer key coming soon

#include<stdio.h>
int main(int argc, char *argv[]){
    char a = 'P';
    char b = 'x';
    char c = (a & b) + '*';
    char d = (a | b) - '-';
    char e = (a ^ b) + '+';
    printf("%c %c %c\n", c, d, e);
    return 0;
}

Single correct

• Az K S
• B122 75 83
• C* - +
• DP x +

Answer key coming soon

Numerical answer

Answer key coming soon