91. Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
92. What will be the recurrence relation of the following code?
Int sum(int n)
{
If(n==1)
return 1;
else
return n+sum(n-1);
}
Int sum(int n)
{
If(n==1)
return 1;
else
return n+sum(n-1);
}93. What is the usual size of polybius square used for encrypting English alphabets?
94. What will be the chromatic number of the following graph?
95. In how many ways can a Gomory-Hu tree be implemented?
96. Which of the following is true about the time complexity of the recursive solution of the subset sum problem?
97. Gronsfeld cipher is harder to crack than caesar cipher.
98. Consider the following code:
#include<stdio.h>
int recursive_sum(int n)
{
if(n == 0)
return 0;
return ________;
}
int main()
{
int n = 5;
int ans = recursive_sum(n);
printf("%d",ans);
return 0;
}
Which of the following lines is the recurrence relation for the above code?
#include<stdio.h>
int recursive_sum(int n)
{
if(n == 0)
return 0;
return ________;
}
int main()
{
int n = 5;
int ans = recursive_sum(n);
printf("%d",ans);
return 0;
}99. In what time can the Hamiltonian path problem can be solved using dynamic programming?
100. In a optimal page replacement algorithm, when a page is to be replaced, which of the following pages is chosen?
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 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
- Miscellaneous on Data Structures - Section 12