Miscellaneous on Data Structures
practice.

Route cipher is an example of . . . . . . . .

What will be the output for following code?

float power(float x, int y) 
{ 
	float temp; 
	if( y==0) 
	return 1; 
	temp = power(x, y/2);	 
	if (y%2 == 0) 
		return temp*temp; 
	else
	{ 
		if(y > 0) 
			return x*temp*temp; 
		else
			return (temp*temp)/x; 
	} 
} 
int main() 
{ 
	float x = 2; 
	int y = -3; 
	printf("%f", power(x, y)); 
	return 0; 
}

What will happen when the below code snippet is executed?

void my_recursive_function()
{
   my_recursive_function();
}
int main()
{
   my_recursive_function();
   return 0;
}

Which of the following was the first poly graphic cipher to be able to operate on more than 3 letters at once?

The Euler's totient function of a prime number will be (p - 1), where p is a prime number.

Suppose you have coins of denominations 1, 3 and 4. You use a greedy algorithm, in which you choose the largest denomination coin which is not greater than the remaining sum. For which of the following sums, will the algorithm produce an optimal answer?

What is the default value of seed if function rand() is called before srand()?

Which of the following option is wrong?

The time complexity of the following recursive implementation to find the factorial of a number is . . . . . . . .

int fact(int n)
{
     if(_________)
        return 1;
     return n * fact(n - 1);
}
int main()
{
      int n = 5;
      int ans = fact(n);
      printf("%d",ans);
      return 0;
}

Which graph is used to define the claw free graph?

What is the output of the following code?

#include<stdio.h>
int arr[31], len = 0;
void recursive_dec_to_bin(int n)
{
      if(n == 0 && len == 0)
      {
          arr[len++] = 0;
          return;
      }
      if(n == 0)
         return;
      arr[len++] = n % 2;
      recursive_dec_to_bin(n/2);
}
int main()
{
     int n = 111,i;
     recursive_dec_to_bin(n);
     for(i=len-1; i>=0; i--)
     printf("%d",arr[i]);
     return 0;
}

Consider the following recursive implementation to find the nth fibonacci number:

int fibo(int n)
{
     if(n == 1)
        return 0;
     else if(n == 2)
        return 1;
     return ________;
}
int main()
{
     int n = 5;
     int ans = fibo(n);
     printf("%d",ans);
     return 0;
}

Which of the following lines should be inserted to complete the above code?

The concept of cross product is applied in the field of computer graphics.

Which one of the following is the chromatic number of bipartite graph?

Backtracking algorithm is implemented by constructing a tree of choices called as?

Which of the following is not another name for GCD(Greatest Common Divisor)?

What is the time complexity of the above recursive implementation used to reverse a string?

Autokey cipher is an example of . . . . . . . .

Coalesced hashing is better than separate chaining.

In a complete bipartite graph K_{m, n}, the minimum vertex cover is of the size max{m, n}.