All Programming & Data Structures questions

One or more correct

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

Single correct

• A23, 17, 10, 6, 13, 14, 1, 5, 7, 12
• B23, 17, 14, 7, 13, 10, 1, 5, 6, 12
• C23, 17, 14, 6, 13, 10, 1, 5, 7, 15
• D23, 14, 17, 1, 10, 13, 16, 12, 7, 5

Answer key coming soon

Single correct

• ASLLdel is $O(1)$ and DLLdel is $O(n)$
• BBoth SLLdel and DLLdel are $O(\log(n))$
• CBoth SLLdel and DLLdel are $O(1)$
• DSLLdel is $O(n)$ and DLLdel is $O(1)$

Answer key coming soon

Single correct

• ADivision method, i.e., use the hash function $h(k) = k \bmod m$.
• BMultiplication method, i.e., use the hash function $h(k) = \lfloor m(kA - \lfloor kA \rfloor) \rfloor$, where $A$ is a carefully chosen constant.
• CUniversal hashing method.
• DIf $k$ is a prime number, use Division method. Otherwise, use Multiplication method.

Answer key coming soon

#include<stdio.h>
int funcp(){
  static int x = 1;
  x++;
  return x;
}
int main(){
  int x,y;
  x = funcp();
  y = funcp()+x;
  printf("%d\n", (x+y));
  return 0;
}

Numerical answer

Answer key coming soon

Single correct

• ABoth Extract-Max(A) and Insert(A,key) run in $O(1)$.
• BBoth Extract-Max(A) and Insert(A,key) run in $O(\log(n))$.
• CExtract-Max(A) runs in $O(1)$ whereas Insert(A,key) runs in $O(n)$.
• DExtract-Max(A) runs in $O(1)$ whereas Insert(A,key) runs in $O(\log(n))$.

Answer key coming soon

typedef struct node {
  int val;
  struct node *left, *right;
} node;

int foo(node *p) {
  int retval;
  if (p == NULL)
    return 0;
  else {
    retval = p->val + foo(p->left) + foo(p->right);
    printf("%d ", retval);
    return retval;
  }
}

Single correct

• A3 8 5 13 11 10
• B3 5 8 10 11 13
• C3 8 16 13 24 50
• D3 16 8 50 24 13

Answer key coming soon

Numerical answer

Answer key coming soon

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

Single correct

• A$\Theta(n \log n)$
• B$\Theta(n)$
• C$\Theta(\log n)$
• D$\Theta(1)$

Answer key coming soon

Numerical answer

Answer key coming soon

#include <stdio.h>
int main()
{
    int i, j, count;
    count = 0;
    i = 0;
    for (j = -3; j <= 3; j++)
    {
        if ((j >= 0) && (i++))
            count = count + j;
    }
    count = count + i;
    printf("%d", count);
    return 0;
}

Single correct

• AThe program will not compile successfully.
• BThe program will compile successfully and output 10 when executed.
• CThe program will compile successfully and output 8 when executed.
• DThe program will compile successfully and output 13 when executed.

Answer key coming soon

One or more correct

• A5, 9, 4, 13, 10, 7
• B9, 5, 10, 6, 7, 1
• C10, 9, 6, 7, 5, 13
• D9, 5, 13, 6, 10, 14

Answer key coming soon

int SimpleFunction(int Y[], int n, int x)
{
  int total = Y[0], loopIndex;
  for (loopIndex = 1; loopIndex <= n - 1; loopIndex++)
       total = x * total + Y[loopIndex];
  return total;
}

Numerical answer

Answer key coming soon