All Programming & Data Structures questions

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