21. Quickselect is an in-place algorithm?
22. What will be the slope of the line perpendicular to the line 6x-3y-16=0?
23. In the not recently used algorithm, what do the R bits and M bits refer to?
24. While choosing the value of a and m (m is the no. of alphabets) in affine cipher it must be ensured that?
25. To find an eulerian circuit in the graph by fleury's algorithm, always begin with the vertex having an odd degree.
26. The number of scalar additions and subtractions used in Strassen's matrix multiplication algorithm is . . . . . . . .
27. What is the name given to the algorithm depicted in the pseudo code below?
procedure generate(n : integer, Arr : array):
if n = 1 then
output(Arr)
else
for i = 0; i <= n - 2; i ++ do
generate(n - 1, Arr)
if n is even then
swap(Arr[i], Arr[n-1])
else
swap(Arr[0], Arr[n-1])
end if
end for
generate(n - 1, Arr )
end if
procedure generate(n : integer, Arr : array):
if n = 1 then
output(Arr)
else
for i = 0; i <= n - 2; i ++ do
generate(n - 1, Arr)
if n is even then
swap(Arr[i], Arr[n-1])
else
swap(Arr[0], Arr[n-1])
end if
end for
generate(n - 1, Arr )
end if28. Which of the following is not a property of the bipartite graph?
29. Which of the following is not an Eigen value of the adjacency matrix of the complete bipartite graph?
30. What is the time complexity of the following recursive implementation to find the sum of digits of a number n?
#include<stdio.h>
int recursive_sum_of_digits(int n)
{
if(n == 0)
return 0;
return _________;
}
int main()
{
int n = 1201;
int ans = recursive_sum_of_digits(n);
printf("%d",ans);
return 0;
}
#include<stdio.h>
int recursive_sum_of_digits(int n)
{
if(n == 0)
return 0;
return _________;
}
int main()
{
int n = 1201;
int ans = recursive_sum_of_digits(n);
printf("%d",ans);
return 0;
}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