61. Co-ordinate compression reduces the number of squares in a graph.
62. How many unique colors will be required for proper vertex coloring of a complete graph having n vertices?
63. Which word offers a word rate that is typical of 5-letter code groups?
64. . . . . . . . . is the mechanism of sending data bits multiple times to ensure consistency.
65. Given below is the pseudocode of the independent set problem. Which of the following best suits the blank?
Independent (G = (V, E))
{
temp=true
for every {u, v} in the subset
{
check if they have any edge between them
if edge exist, then set ________________
}
If temp is true
correct result
else
incorrect
}
Independent (G = (V, E))
{
temp=true
for every {u, v} in the subset
{
check if they have any edge between them
if edge exist, then set ________________
}
If temp is true
correct result
else
incorrect
}66. Given G is a bipartite graph and the bipartitions of this graphs are U and V respectively. What is the relation between them?
67. Problems that can be solved in polynomial time are known as?
68. How many times is the function recursive_min_element() called when the following code is executed?
int min_of_two(int a, int b)
{
if(a < b)
return a;
return b;
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1));
}
int main()
{
int n = 10, idx = 0, arr[] = {5,2,6,7,8,9,3,-1,1,10};
int min_element = recursive_min_element(arr,n,idx);
printf("%d",min_element);
return 0;
}
int min_of_two(int a, int b)
{
if(a < b)
return a;
return b;
}
int recursive_min_element(int *arr, int len, int idx)
{
if(idx == len - 1)
return arr[idx];
return min_of_two(arr[idx], recursive_min_element(arr, len, idx + 1));
}
int main()
{
int n = 10, idx = 0, arr[] = {5,2,6,7,8,9,3,-1,1,10};
int min_element = recursive_min_element(arr,n,idx);
printf("%d",min_element);
return 0;
}69. In which of the following cipher the plain text and the ciphered text have same letters?
70. Is it possible to have no four queens in a straight line as the part of one of the solution to the eight queen puzzle.
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 9
- Miscellaneous on Data Structures - Section 10
- Miscellaneous on Data Structures - Section 11
- Miscellaneous on Data Structures - Section 12