Data Structure · all questions

Miscellaneous on Data Structures
practice.

Practice every MCQ with options. Use Show answers when you want the correct option and solution.

1,171

Questions

57/59

Page

Pick an option on a question to see the right answer and solution.

Q1121

Vigenere cipher is harder to crack than autokey cipher.

Select an option to see the answer and solution.

Q1122

How many spanning trees does a complete bipartite graph contain?

Select an option to see the answer and solution.

Q1123

What is the time complexity of matrix multiplied recursively by Strassen's Method?

Select an option to see the answer and solution.

Q1124

For which symbol there is no standard representation in Morse Code?

Select an option to see the answer and solution.

Q1125

What will be the output of the following code?

int cnt=0;
void my_recursive_function(int n)
{
     if(n == 0)
     return;
     cnt++;
     my_recursive_function(n/10);
}
int main()
{
     my_recursive_function(123456789);
     printf("%d",cnt);
     return 0;
}

Select an option to see the answer and solution.

Q1126

What is the domination number for 8-queen's problem?

Select an option to see the answer and solution.

Q1127

Manhattan distance is an alternative way to define a distance between two points.

Select an option to see the answer and solution.

Q1128

Consider the following iterative code snippet to find the largest element:

int get_max_element(int *arr,int n)
{
      int i, max_element = arr[0];
      for(i = 1; i < n; i++)
          if(________)
          max_element = arr[i];
      return max_element;
}

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

Select an option to see the answer and solution.

Q1129

Which type of exception is raised by computer hardware when a code tries to access a block of memory that is not stored in physical memory?

Select an option to see the answer and solution.

Q1130

. . . . . . . . is a matching with the largest number of edges.

Select an option to see the answer and solution.

Q1131

Which of the following statements is not a part of Chan's algorithm?

Select an option to see the answer and solution.

Q1132

What is the output of the following code?

#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)
          lo = mid + 1;
      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 = 0,len = 8;
      int indx = recursive_binary_search(arr,num,0,len-1);
      printf("Index of %d is %d",num,indx);
      return 0;
}

Select an option to see the answer and solution.

Q1133

Rail fence cipher is an example of . . . . . . . .

Select an option to see the answer and solution.

Q1134

Affine cipher is less secure than caesar cipher.

Select an option to see the answer and solution.

Q1135

In graph theory collection of dots and lines is called

Select an option to see the answer and solution.

Q1136

What will be the cross product of the vectors 2i + 3j + k and 6i + 9j + 3k?

Select an option to see the answer and solution.

Q1137

Which of the following problems is related to stable marriage problem?

Select an option to see the answer and solution.

Q1138

Which of the following techniques can be used to search an element in an unsorted array?

Select an option to see the answer and solution.

Q1139

There are four students in a class namely A, B, C and D. A tells that a triangle is a bipartite graph. B tells pentagon is a bipartite graph. C tells square is a bipartite graph. D tells heptagon is a bipartite graph. Who among the following is correct?

Select an option to see the answer and solution.

Q1140

Affine cipher is an example of?

Select an option to see the answer and solution.

Prev 55 56 57 58 59 Next