MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 11 Mcqs, each offering curated multiple-choice questions to sharpen your Bin Multiple Choice knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Bigger the query rectangle the better is the query efficiency. |
| A. | true |
| B. | false |
| Answer» C. | |
| 2. |
Efficiency of bin depends upon ___________ |
| A. | size of query and candidates |
| B. | location of query and candidates |
| C. | location and size of query and candidates |
| D. | depends on the input |
| Answer» D. depends on the input | |
| 3. |
What will be the time complexity of insertion operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects) |
| A. | O(1) |
| B. | O(m) |
| C. | O(m<sup>2</sup>) |
| D. | O(log m) |
| Answer» C. O(m<sup>2</sup>) | |
| 4. |
What will be the time complexity of delete operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (m = number of bins intersecting candidate intersects) |
| A. | O(1) |
| B. | O(m) |
| C. | O(m<sup>2</sup>) |
| D. | O(log m) |
| Answer» C. O(m<sup>2</sup>) | |
| 5. |
What will be the time complexity of query operation if all the candidates are evenly spaced so that each bin has constant no. of candidates? (k = number of bins query rectangle intersects) |
| A. | O(1) |
| B. | O(k) |
| C. | O(k<sup>2</sup>) |
| D. | O(log k) |
| Answer» C. O(k<sup>2</sup>) | |
| 6. |
What is computational geometry? |
| A. | study of geometry using a computer |
| B. | study of geometry |
| C. | study of algorithms |
| D. | study of algorithms related to geometry |
| Answer» E. | |
| 7. |
What is the worst case time complexity of insertion operation(n =no. of candidates)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» B. O(n) | |
| 8. |
What is the worst case time complexity of delete operation(n is the no. of candidates)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» C. O(log n) | |
| 9. |
What is the worst case time complexity of query operation(n is the no. of candidates)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(log n) |
| D. | O(n log n) |
| Answer» C. O(log n) | |
| 10. |
Bin is an example of a range query data structure. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 11. |
What is the use of the bin data structure? |
| A. | to have efficient insertion |
| B. | to have efficient deletion |
| C. | to have efficient region query |
| D. | to have efficient traversal |
| Answer» D. to have efficient traversal | |