1. Encryption in Rail fence cipher is done using . . . . . . . .
2. What is the time complexity of matrix multiplied recursively by Divide and Conquer Method?
3. What will be the time complexity of the following code which raises an integer x to the power y?
#include<stdio.h>
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y%2 == 0)
return power(x, y/2)*power(x, y/2);
else
return x*power(x, y/2)*power(x, y/2);
}
int main()
{
int x = 2;
int y = 3;
printf("%d", power(x, y));
return 0;
}
#include<stdio.h>
int power(int x, int y)
{
if (y == 0)
return 1;
else if (y%2 == 0)
return power(x, y/2)*power(x, y/2);
else
return x*power(x, y/2)*power(x, y/2);
}
int main()
{
int x = 2;
int y = 3;
printf("%d", power(x, y));
return 0;
}
4. Optimal page replacement algorithm is also called as . . . . . . . .
5. Who published the eight queens puzzle?
6. Encryption in hill cipher is done using . . . . . . . .
7. Which of the following correctly defines poly alphabetic cipher?
8. What is the condition for proper coloring of a graph?
9. Which of the following page replacement algorithms return the minimum number of page faults?
10. What is the space complexity of program to reverse stack recursively?
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 10
- Miscellaneous on Data Structures - Section 11
- Miscellaneous on Data Structures - Section 12