Miscellaneous on Data Structures MCQ question and answer with solution

Home / Data Structure / Miscellaneous On Data Structures

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

61.
Which of the following should be the base case for the recursive solution of subset sum problem?

if(sum==0)
return true;

if(sum==0)
   return true;
if (n ==0 && sum!= 0) 
   return false;

if (n ==0 && sum!= 0) 
return false;

if(sum<0)
   return true;
if (n ==0 && sum!= 0) 
   return false;

Answer & Solution Discuss in Board Save for Later

62.
According to Gabriel lame, how many steps does Euclid's algorithm require to solve a problem?

A. Less than five times the number of digits

B. More than five times the number of digits

C. Less than two times the number of digits

D. More than two times the number of digits

Answer & Solution Discuss in Board Save for Later

63.
Which two English letters are usually combined in polybius table?

A. A and B

B. Y and Z

C. I and J

D. J and K

Answer & Solution Discuss in Board Save for Later

64.
Which case of master's theorem can be extended further?

A. 1

B. 2

C. 3

D. No case can be extended

Answer & Solution Discuss in Board Save for Later

65.

What is the output of the following code?

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

A. 0

B. 1

C. Runtime error

D. Garbage value

Answer & Solution Discuss in Board Save for Later

66.
Which of the following algorithms does Stable marriage problem uses?

A. Gale-Shapley algorithm

B. Dijkstra's algorithm

C. Ford-Fulkerson algorithm

D. Prim's algorithm

Answer & Solution Discuss in Board Save for Later

67.
What is the condition for proper edge coloring of a graph?

A. Two vertices having a common edge should not have same color

B. Two vertices having a common edge should always have same color

C. No two incident edges should have the same color

D. No two incident edges should have different color

Answer & Solution Discuss in Board Save for Later

68.
What is meant by the single dash in Morse code?

A. A

B. T

C. Z

D. E

Answer & Solution Discuss in Board Save for Later

69.
How many unique colors will be required for vertex coloring of the following graph?

A. 2

B. 3

C. 4

D. 5

Answer & Solution Discuss in Board Save for Later

70.
The six queen puzzle has a fewer solution than the five queen puzzle.

A. True

B. False

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

61.
Which of the following should be the base case for the recursive solution of subset sum problem?

Answer & Solution

62.
According to Gabriel lame, how many steps does Euclid's algorithm require to solve a problem?

Answer & Solution

63.
Which two English letters are usually combined in polybius table?

Answer & Solution

64.
Which case of master's theorem can be extended further?

Answer & Solution

65.
What is the output of the following code?

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

Answer & Solution

66.
Which of the following algorithms does Stable marriage problem uses?

Answer & Solution

67.
What is the condition for proper edge coloring of a graph?

Answer & Solution

68.
What is meant by the single dash in Morse code?

Answer & Solution

69.
How many unique colors will be required for vertex coloring of the following graph?

Answer & Solution

70.
The six queen puzzle has a fewer solution than the five queen puzzle.

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

61. Which of the following should be the base case for the recursive solution of subset sum problem?

Answer & Solution

62. According to Gabriel lame, how many steps does Euclid's algorithm require to solve a problem?

Answer & Solution

63. Which two English letters are usually combined in polybius table?

Answer & Solution

64. Which case of master's theorem can be extended further?

Answer & Solution

65. What is the output of the following code? #include<stdio.h> void dec_to_bin(int n) { int arr[31],len = 0,i; if(n == 0) { arr[0] = 0; len = 1; } while(n != 0) { arr[len++] = n % 2; n /= 2; } for(i=len-1; i>=0; i--) printf("%d",arr[i]); } int main() { int n = 0; dec_to_bin(n); return 0; }

Answer & Solution

66. Which of the following algorithms does Stable marriage problem uses?

Answer & Solution

67. What is the condition for proper edge coloring of a graph?

Answer & Solution

68. What is meant by the single dash in Morse code?

Answer & Solution

69. How many unique colors will be required for vertex coloring of the following graph?

Answer & Solution

70. The six queen puzzle has a fewer solution than the five queen puzzle.

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

61.
Which of the following should be the base case for the recursive solution of subset sum problem?

62.
According to Gabriel lame, how many steps does Euclid's algorithm require to solve a problem?

63.
Which two English letters are usually combined in polybius table?

64.
Which case of master's theorem can be extended further?

65.
What is the output of the following code?

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

66.
Which of the following algorithms does Stable marriage problem uses?

67.
What is the condition for proper edge coloring of a graph?

68.
What is meant by the single dash in Morse code?

69.
How many unique colors will be required for vertex coloring of the following graph?

70.
The six queen puzzle has a fewer solution than the five queen puzzle.