31. Atbash cipher is an example of?
32. Which one of the following problem types does inclusion-exclusion principle belong to?
33. Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance?
34. Consider the following algorithm to find the solution of the activity selection problem. Which of the following option is best suited to fill the blank?
Sort the given activity List
display the first activity
set i = 1
for j = 1 to n-1 do
if begin time of activity[j] >= completion of activity[i] then
___________
i = j
Sort the given activity List
display the first activity
set i = 1
for j = 1 to n-1 do
if begin time of activity[j] >= completion of activity[i] then
___________
i = j
35. What can be the maximum sum of digits for a 4 digit number?
36. Can binary search be applied on a sorted linked list in O(Logn) time?
37. What will be the time complexity of the code to reverse stack recursively?
38. Who formulated quick hull algorithm?
39. The number of elements in the power set increases when there are duplicates present in the set.
40. Pigpen cipher is less secure than a vigenere cipher.
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