All Programming & Data Structures questions

One or more correct

• A$\dfrac{n+1}{2}$
• B$\dfrac{n-1}{2}$
• C$\dfrac{n-3}{2}$
• D$n$

One or more correct

• A0
• B10
• C2
• D1

Numerical answer

#include <stdio.h>

void func(int i, int j) {
  if(i < j) {
    int i = 0;
    while (i < 10) {
      j += 2;
      i++;
    }
  }
  printf("%d", i);
}

int main() {
  int i = 9, j = 10;
  func(i, j);
  return 0;
}

Numerical answer

T                   S
I:   Inorder        L: left subtree, node, right subtree
II:  Preorder       M: node, left subtree, right subtree
III: Postorder      N: left subtree, right subtree, node

Single correct

• AI – L, II – M, III – N
• BI – M, II – L, III – N
• CI – N, II – M, III – L
• DI – L, II – N, III – M

#include <stdio.h>
int a=5;
int main(){
  int a=7;
  return(0);
}

#include <stdio.h>
int main(){
  int a=5;
  int a=7;
  return(0);
}

#include <stdio.h>
int main(){
  int a=5;
  float a=7;
  return(0);
}

Single correct

• AOnly P1 will compile without any error
• BOnly P2 will compile without any error
• COnly P3 will compile without any error
• DAll three programs P1, P2, and P3 will compile without any error

Numerical answer

One or more correct

• AThe maximum length of a path from the root node to any other node is $(n - 1)$.
• BAn inorder traversal will always produce a sorted sequence of elements.
• CFinding an element takes $O(\log_2 n)$ time in the worst case.
• DEvery BST is also a Min-Heap.

#include <stdio.h>
void foo(int *p, int x){
    *p=x;
}
int main(){
    int *z;
    int a = 20, b = 25;
    z = &a;
    foo(z,b);
    printf("%d",a);
    return 0;
}

Numerical answer

Numerical answer

Single correct

• A$\dfrac{n-2}{2}$
• B$\dfrac{n-1}{2}$
• C$\dfrac{n}{2}$
• D$\dfrac{n+1}{2}$

#include <stdio.h>
void stringcopy(char *, char *);
int main(){
  char a[30] = "@#Hello World!";
  stringcopy(a, a + 2);
  printf("%s\n", a);
  return 0;
}
void stringcopy(char *s, char *t) {
  while(*t)
    *s++ = *t++;
}

Single correct

• A@#Hello World!
• BHello World!
• Cello World!
• DHello World!d!

int x=126,y=105;
do {
     if(x>y) x=x-y;
     else y=y-x;
} while(x!=y);
printf("%d",x);

Numerical answer

Numerical answer

#include <stdio.h>
int main(){
   int a = 6;
   int b = 0;
   while(a < 10) {
      a = a / 12 + 1;
      a += b;}
   printf("%d", a);
   return 0;}

Single correct

• AThe program prints 9 as output
• BThe program prints 10 as output
• CThe program gets stuck in an infinite loop
• DThe program prints 6 as output

#include <stdio.h>
void fX();
int main(){
   fX();
   return 0;}
void fX(){
   char a;
   if((a=getchar()) != '\n')
       fX();
   if(a != '\n')
       putchar(a);}

Single correct

• AThe program will not terminate
• BThe program will terminate with no output
• CThe program will terminate with 4321 as output
• DThe program will terminate with 1234 as output

#include <stdio.h>
int g(int p) { printf("%d", p); return p; }
int h(int q) { printf("%d", q); return q; }
void f(int x, int y) {
  g(x);
  h(y);
}
int main() {
  f(g(10),h(20));
}

Single correct

• A20101020
• B10202010
• C20102010
• D10201020

int fX(char *a){
    char *b = a;
    while(*b)
        b++;
    return b - a;}

One or more correct

• AThe function call fX("abcd") will always return a value
• BAssuming a character array c is declared as char c[] = "abcd" in main(), the function call fX(c) will always return a value
• CThe code of the function will not compile
• DAssuming a character pointer c is declared as char *c = "abcd" in main(), the function call fX(c) will always return a value

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