Miscellaneous on Data Structures MCQ question and answer with solution Page-6 section-4

Section 1 Section 2 Section 3 Section 4 Section 5 Section 6 Section 7 Section 8 Section 9 Section 10 Section 11 Section 12

51.

Consider the following recursive implementation of the binary search:

#include<stdio.h>
int recursive_binary_search(int *arr, int num, int lo, int hi)
{
      if(lo > hi)
       return -1;
      int mid = (lo + hi)/2;
      if(arr[mid] == num)
      return mid;
      else if(arr[mid] < num)
          __________;
      else
          hi = mid - 1;
     return recursive_binary_search(arr, num, lo, hi);
}
int main()
{
      int arr[8] ={0,0,0,0,3,5,6,7},num = 7,len = 8;
      int indx = recursive_binary_search(arr,num,0,len-1);
      printf("Index of %d is %d",num,indx);
      return 0;
}

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

A. hi = mid - 1

B. mid = (lo + hi)/2

C. mid = lo - 1

D. lo = mid + 1

Answer & Solution Discuss in Board Save for Later

52.
What is the optimal time required for solving the closest pair problem using divide and conquer approach?

A. O(N)

B. O(log N)

C. O(N log N)

D. O(N²)

Answer & Solution Discuss in Board Save for Later

53.
Running key cipher is a transposition cipher.

A. true

B. false

Answer & Solution Discuss in Board Save for Later

54.
Which among the following is an application of the least recently used algorithm?

A. Paging for memory management

B. Dynamic memory allocation

C. Priority scheduling

D. Disk scheduling

Answer & Solution Discuss in Board Save for Later

55.

What will be the output of the following code?

void my_recursive_function(int n)
{
    if(n == 0)
    {
         printf("False");
	   return;
    }
    if(n == 1)
    {
         printf("True");
         return;
    }
    if(n%2==0)
    my_recursive_function(n/2);
    else
    {
         printf("False");
         return;
    }
 
}
int main()
{
     my_recursive_function(100);
     return 0;
}

A. True

B. False

Answer & Solution Discuss in Board Save for Later

56.
What should be the return type of rand() function?

A. int

B. float

C. long

D. double

Answer & Solution Discuss in Board Save for Later

57.
hat is the correct formula for generating random numbers in the range (lower,upper) using rand()?

A. rand() % (upper - lower)

B. rand() + lower

C. (rand()%(upper-lower)) + lower

D. (rand()%(upper-lower+1)) + lower

Answer & Solution Discuss in Board Save for Later

58.
What will be the plain text corresponding to cipher text "XKS" if the bifid cipher is used with key as "KEY" and period as 5?

A. IND

B. USA

C. RSA

D. AUS

Answer & Solution Discuss in Board Save for Later

59.
What is the LCM according to the given Venn Diagram?

A. 2

B. 3

C. 180

D. 6

Answer & Solution Discuss in Board Save for Later

60.
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO's algorithm?

A. O(n*q)

B. O(n)

C. O((q+n)√n)

D. O(q*√n)

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

Answer & Solution

52.
What is the optimal time required for solving the closest pair problem using divide and conquer approach?

Answer & Solution

53.
Running key cipher is a transposition cipher.

Answer & Solution

54.
Which among the following is an application of the least recently used algorithm?

Answer & Solution

55.
What will be the output of the following code?

`void my_recursive_function(int n) { if(n == 0) { printf("False"); return; } if(n == 1) { printf("True"); return; } if(n%2==0) my_recursive_function(n/2); else { printf("False"); return; } } int main() { my_recursive_function(100); return 0; }`

Answer & Solution

56.
What should be the return type of rand() function?

Answer & Solution

57.
hat is the correct formula for generating random numbers in the range (lower,upper) using rand()?

Answer & Solution

58.
What will be the plain text corresponding to cipher text "XKS" if the bifid cipher is used with key as "KEY" and period as 5?

Answer & Solution

59.
What is the LCM according to the given Venn Diagram?

Answer & Solution

60.
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO's algorithm?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

Answer & Solution

52. What is the optimal time required for solving the closest pair problem using divide and conquer approach?

Answer & Solution

53. Running key cipher is a transposition cipher.

Answer & Solution

54. Which among the following is an application of the least recently used algorithm?

Answer & Solution

55. What will be the output of the following code? void my_recursive_function(int n) { if(n == 0) { printf("False"); return; } if(n == 1) { printf("True"); return; } if(n%2==0) my_recursive_function(n/2); else { printf("False"); return; } } int main() { my_recursive_function(100); return 0; }

Answer & Solution

56. What should be the return type of rand() function?

Answer & Solution

57. hat is the correct formula for generating random numbers in the range (lower,upper) using rand()?

Answer & Solution

58. What will be the plain text corresponding to cipher text "XKS" if the bifid cipher is used with key as "KEY" and period as 5?

Answer & Solution

59. What is the LCM according to the given Venn Diagram?

Answer & Solution

60. What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO's algorithm?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

52.
What is the optimal time required for solving the closest pair problem using divide and conquer approach?

53.
Running key cipher is a transposition cipher.

54.
Which among the following is an application of the least recently used algorithm?

55.
What will be the output of the following code?

`void my_recursive_function(int n) { if(n == 0) { printf("False"); return; } if(n == 1) { printf("True"); return; } if(n%2==0) my_recursive_function(n/2); else { printf("False"); return; } } int main() { my_recursive_function(100); return 0; }`

56.
What should be the return type of rand() function?

57.
hat is the correct formula for generating random numbers in the range (lower,upper) using rand()?

58.
What will be the plain text corresponding to cipher text "XKS" if the bifid cipher is used with key as "KEY" and period as 5?

59.
What is the LCM according to the given Venn Diagram?

60.
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO's algorithm?