All Programming & Data Structures questions

The height of a binary tree is the number of edges in the longest path from the root to a leaf in the tree. The maximum possible height of a full binary tree with 23 nodes is _________. (*answer in integer*)

Consider the following program in C:

#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;
}

The output of the program is _________. (*answer in integer*) *Note*: Assume that the program compiles and runs successfully.

Consider the following code snippet in C language that computes the number of nodes in a non-empty singly linked list pointed to by the pointer variable head.

struct node{
  int elt;
  struct node *next;
};
int getListSize (struct node *head)
{
  if( E1 ) return 1;
  return E2;
}

Which one of the following options gives the correct replacements for the expressions E1 and E2?

Let $P$ be the set of all integers from 1 to 15. Consider any order of insertion of the elements of $P$ into a binary search tree that creates a complete binary tree. Which one of the following elements can NEVER be the third element that is inserted?

Consider the recursive functions represented by the following code segment:

int bar(int n){
     if (n == 1) return 0;
     else return 1 + bar(n/2);
}
int foo(int n){
     if (n == 1) return 1;
     else return 1 + foo(bar(n));
}

The smallest positive integer n for which foo(n) returns 5 is ______. (*answer in integer*) *Note:* Ignore syntax errors (if any) in the function.

The following sequence corresponds to the preorder traversal of a binary search tree $T$: $$50, 25, 13, 40, 30, 47, 75, 60, 70, 80, 77$$ The position of the element 60 in the postorder traversal of $T$ is ______. (*answer in integer*) *Note:* The position begins with 1.

The set T represents various traversals over binary tree. The set S represents the order of visiting nodes during a traversal. Which one of the following is the correct match from T to S?

Consider the following three ANSI-C programs, P1, P2, and P3. P1

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

P2

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

P3

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

Which one of the following statements is true?

The keys 5, 28, 19, 15, 26, 33, 12, 17, 10 are inserted into a hash table using the hash function $h(k) = k \bmod 9$. The collisions are resolved by chaining. After all the keys are inserted, the length of the longest chain is __________. (*answer in integer*)

Consider the following ANSI-C program.

#include <stdio.h>
int main(){
  int *ptr, a, b, c;
  a=5; b=11; c=20;
  ptr=&a; *ptr=c; ptr=&c;
  a=*(&b); c=*ptr-a;
  printf("%d",c);
  return(0);
}

The output of this program is ____________. (*answer in integer*) *Note*: Assume that the program compiles and runs successfully.

Consider the following ANSI-C function.

int func(int start, int end){
  int length=end+1-start;
  if((length<1)||(start<0)||(end<0)){ return(0); }
  if(length%3==0){
    return(func(start+1, end));
  } else if(length%3==1){
    return(1+func(start, end-1));
  } else {
    return(func(start+2, end));
  }
}

The maximum possible value that can be returned from this function is ____________. (*answer in integer*) *Note*: Ignore syntax errors (if any) in the function.