

MCQOPTIONS
Saved Bookmarks
This section includes 2 Mcqs, each offering curated multiple-choice questions to sharpen your General Awareness knowledge and support exam preparation. Choose a topic below to get started.
1. |
Mo’s algorithm can only be used for problems where the query can be calculated from the result of the previous query. |
A. | true |
B. | false |
Answer» B. false | |
2. |
What will be the worst case time complexity of code to find sum in given query range (l,r) in an array of size n with q number of such queries when we apply MO’s algorithm? |
A. | O(n*q) |
B. | O(n) |
C. | O((q+n)√n) |
D. | O(q*√n) |
Answer» D. O(q*√n) | |