11. What is the meaning of cipher in computer terminology?
12. How many fundamental solutions are there for the eight queen puzzle?
13. Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?
14. What is vertex coloring of a graph?
15. Choose the correct statement for the following code segment?
bool check (int N)
{
if( N & (1 << i) )
return true;
else
return false;
}
bool check (int N)
{
if( N & (1 << i) )
return true;
else
return false;
}
16. Asymmetric encryption is also known as?
17. How many unique colors will be required for proper vertex coloring of a bipartite graph having n vertices?
18. Master's theorem is used for?
19. . . . . . . . . is a method of constructing a smallest polygon out of n given points.
20. In most of the cases, topological sort starts from a node which has . . . . . . . .
Read More Section(Miscellaneous on Data Structures)
Each Section contains maximum 100 MCQs question on Miscellaneous on Data Structures. To get more questions visit other sections.
- Miscellaneous on Data Structures - Section 1
- Miscellaneous on Data Structures - Section 2
- Miscellaneous on Data Structures - Section 3
- Miscellaneous on Data Structures - Section 4
- Miscellaneous on Data Structures - Section 5
- Miscellaneous on Data Structures - Section 6
- Miscellaneous on Data Structures - Section 7
- Miscellaneous on Data Structures - Section 8
- Miscellaneous on Data Structures - Section 9
- Miscellaneous on Data Structures - Section 10
- Miscellaneous on Data Structures - Section 11