51. The solution of the activity selection problem can have two overlapping activities in a particular time interval.
52. What is the range of rand()?
53. What will be the output of the following code in C++?
#include <stdio.h>
int ETF(int n)
{
int a, result = n;
for (a = 2; a * a <= n; ++a)
{
if (n % a == 0)
{
while (n % a == 0)
n = n / a;
result = result - result / a;
}
}
if (n > 1)
result = result - result / n;
return result;
}
int main()
{
int n;
for (n = 1; n <= 4; n++)
printf("%d\n", ETF(n));
return 0;
}
#include <stdio.h>
int ETF(int n)
{
int a, result = n;
for (a = 2; a * a <= n; ++a)
{
if (n % a == 0)
{
while (n % a == 0)
n = n / a;
result = result - result / a;
}
}
if (n > 1)
result = result - result / n;
return result;
}
int main()
{
int n;
for (n = 1; n <= 4; n++)
printf("%d\n", ETF(n));
return 0;
}
54. Which of the following is a type of traditional cipher?
55. With reference to the given Venn diagram, what is the formula for computing |AUBUC| (where |x, y| represents intersection of sets x and y)?

56. Strassen's Matrix Algorithm was proposed by . . . . . . . .
57. Time complexity of fractional knapsack problem is . . . . . . . .
58. Who discussed techniques for reducing the memory requirements for Strassen's algorithm?
59. Which of the following ciphers are created by shuffling the letters of a word?
60. Flooding algorithm shouldn't be used if only a single destination needs the packet.
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 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
- Miscellaneous on Data Structures - Section 12