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

11.
What will be the chromatic number of the following graph?

A. 1

B. 2

C. 3

D. 4

Answer & Solution Discuss in Board Save for Later

12.
What will be the maximum number of rounds required to reach all nodes in the flooding algorithm?

A. Radius to the graph

B. Diameter of graph

C. 1

D. Distance between two nodes

Answer & Solution Discuss in Board Save for Later

13.
Which structure can be modelled by using Bipartite graph?

A. Hypergraph

B. Perfect Graph

C. Hetero Graph

D. Directed Graph

Answer & Solution Discuss in Board Save for Later

14.
Which of the following is called the "ultimate planar convex hull algorithm"?

A. Chan's algorithm

B. Kirkpatrick-Seidel algorithm

C. Gift wrapping algorithm

D. Jarvis algorithm

Answer & Solution Discuss in Board Save for Later

15.
What is the definition of graph according to graph theory?

A. visual representation of data

B. collection of dots and lines

C. collection of edges

D. collection of vertices

Answer & Solution Discuss in Board Save for Later

16.
Gronsfeld cipher is an example of . . . . . . . .

A. mono-alphabetic cipher

B. poly-alphabetic cipher

C. transposition cipher

D. additive cipher

Answer & Solution Discuss in Board Save for Later

17.
Who publish the bitwise operation method to solve the eight queen puzzle?

A. Zongyan Qiu

B. Martin Richard

C. Max Bezzel

D. Frank Nauck

Answer & Solution Discuss in Board Save for Later

18.

What is the output of the following code?

#include<stdio.h>
int sum_of_digits(int n)
{
      int sm = 0;
      while(n != 0)
      {
          sm += n%10;
          n /= 10;
      }
      return sm;
}
int main()
{
      int n = 1234;
      int ans = sum_of_digits(n);
      printf("%d",ans);
      return 0;
}

A. 1

B. 3

C. 7

D. 10

Answer & Solution Discuss in Board Save for Later

19.
The most common hamming codes are a generalized version of?

A. Hamming(7, 4) code

B. Hamming(8, 4) code

C. Hamming(6, 3) code

D. Hamming(5, 7) code

Answer & Solution Discuss in Board Save for Later

20.
Topological sort can be applied to which of the following graphs?

A. Undirected Cyclic Graphs

B. Directed Cyclic Graphs

C. Undirected Acyclic Graphs

D. Directed Acyclic Graphs

Answer & Solution Discuss in Board Save for Later

1 2 3 4 5 6 7 8 9 10

11.
What will be the chromatic number of the following graph?

Answer & Solution

12.
What will be the maximum number of rounds required to reach all nodes in the flooding algorithm?

Answer & Solution

13.
Which structure can be modelled by using Bipartite graph?

Answer & Solution

14.
Which of the following is called the "ultimate planar convex hull algorithm"?

Answer & Solution

15.
What is the definition of graph according to graph theory?

Answer & Solution

16.
Gronsfeld cipher is an example of . . . . . . . .

Answer & Solution

17.
Who publish the bitwise operation method to solve the eight queen puzzle?

Answer & Solution

18.
What is the output of the following code?

`#include<stdio.h> int sum_of_digits(int n) { int sm = 0; while(n != 0) { sm += n%10; n /= 10; } return sm; } int main() { int n = 1234; int ans = sum_of_digits(n); printf("%d",ans); return 0; }`

Answer & Solution

19.
The most common hamming codes are a generalized version of?

Answer & Solution

20.
Topological sort can be applied to which of the following graphs?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

Miscellaneous on Data Structures MCQ question and answer with solution

11. What will be the chromatic number of the following graph?

Answer & Solution

12. What will be the maximum number of rounds required to reach all nodes in the flooding algorithm?

Answer & Solution

13. Which structure can be modelled by using Bipartite graph?

Answer & Solution

14. Which of the following is called the "ultimate planar convex hull algorithm"?

Answer & Solution

15. What is the definition of graph according to graph theory?

Answer & Solution

16. Gronsfeld cipher is an example of . . . . . . . .

Answer & Solution

17. Who publish the bitwise operation method to solve the eight queen puzzle?

Answer & Solution

18. What is the output of the following code? #include<stdio.h> int sum_of_digits(int n) { int sm = 0; while(n != 0) { sm += n%10; n /= 10; } return sm; } int main() { int n = 1234; int ans = sum_of_digits(n); printf("%d",ans); return 0; }

Answer & Solution

19. The most common hamming codes are a generalized version of?

Answer & Solution

20. Topological sort can be applied to which of the following graphs?

Answer & Solution

Read More Section(Miscellaneous on Data Structures)

11.
What will be the chromatic number of the following graph?

12.
What will be the maximum number of rounds required to reach all nodes in the flooding algorithm?

13.
Which structure can be modelled by using Bipartite graph?

14.
Which of the following is called the "ultimate planar convex hull algorithm"?

15.
What is the definition of graph according to graph theory?

16.
Gronsfeld cipher is an example of . . . . . . . .

17.
Who publish the bitwise operation method to solve the eight queen puzzle?

18.
What is the output of the following code?

`#include<stdio.h> int sum_of_digits(int n) { int sm = 0; while(n != 0) { sm += n%10; n /= 10; } return sm; } int main() { int n = 1234; int ans = sum_of_digits(n); printf("%d",ans); return 0; }`

19.
The most common hamming codes are a generalized version of?

20.
Topological sort can be applied to which of the following graphs?