MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 31 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following factors account more to the cost of Chan's algorithm? |
| A. | computing a single convex hull |
| B. | locating points that constitute a hull |
| C. | computing convex hull in groups |
| D. | merging convex hulls |
| Answer» D. merging convex hulls | |
| 2. |
Who formulated quick hull algorithm? |
| A. | Eddy |
| B. | Andrew |
| C. | Chan |
| D. | Graham |
| Answer» B. Andrew | |
| 3. |
Chan's algorithm can be used to compute the lower envelope of a trapezoid. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 4. |
Who formulated Chan's algorithm? |
| A. | Timothy |
| B. | Kirkpatrick |
| C. | Frank Nielsen |
| D. | Seidel |
| Answer» B. Kirkpatrick | |
| 5. |
Which of the following is called the 'ultimate planar convex hull algorithm'? |
| A. | Chan's algorithm |
| B. | Kirkpatrick-Seidel algorithm |
| C. | Gift wrapping algorithm |
| D. | Jarvis algorithm |
| Answer» C. Gift wrapping algorithm | |
| 6. |
What is the running time of Hershberger algorithm? |
| A. | O(log n) |
| B. | O(n log n) |
| C. | O(n log h) |
| D. | O(log h) |
| Answer» C. O(n log h) | |
| 7. |
What is the running time of Chan's algorithm? |
| A. | O(log n) |
| B. | O(n log n) |
| C. | O(n log h) |
| D. | O(log h) |
| Answer» D. O(log h) | |
| 8. |
What is the basic operation of closest pair algorithm using brute force technique? |
| A. | Euclidean distance |
| B. | Radius |
| C. | Area |
| D. | Manhattan distance |
| Answer» B. Radius | |
| 9. |
What is the runtime efficiency of using brute force technique for the closest pair problem? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N2) |
| D. | O(N3 log N) |
| Answer» D. O(N3 log N) | |
| 10. |
The running time of Chan's algorithm is obtained from combining two algorithms. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 11. |
Which of the following is similar to Euclidean distance? |
| A. | Manhattan distance |
| B. | Pythagoras metric |
| C. | Chebyshev distance |
| D. | Heuristic distance |
| Answer» C. Chebyshev distance | |
| 12. |
Which approach is based on computing the distance between each pair of distinct points and finding a pair with the smallest distance? |
| A. | Brute force |
| B. | Exhaustive search |
| C. | Divide and conquer |
| D. | Branch and bound |
| Answer» B. Exhaustive search | |
| 13. |
The most important condition for which closest pair is calculated for the points (pi, pj) is? |
| A. | i>j |
| B. | i!=j |
| C. | i=j |
| D. | i<j |
| Answer» E. | |
| 14. |
What is the optimal time required for solving the closest pair problem using divide and conquer approach? |
| A. | O(N) |
| B. | O(log N) |
| C. | O(N log N) |
| D. | O(N2) |
| Answer» D. O(N2) | |
| 15. |
The time is taken to find the 'n' points that lie in a convex quadrilateral is? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N2) |
| D. | O(log N) |
| Answer» B. O(N log N) | |
| 16. |
Manhattan distance is an alternative way to define a distance between two points. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 17. |
Which of the following algorithms is the simplest? |
| A. | Chan's algorithm |
| B. | Kirkpatrick-Seidel algorithm |
| C. | Gift wrapping algorithm |
| D. | Jarvis algorithm |
| Answer» B. Kirkpatrick-Seidel algorithm | |
| 18. |
Which of the following statements is not a part of Chan's algorithm? |
| A. | eliminate points not in the hull |
| B. | recompute convex hull from scratch |
| C. | merge previously calculated convex hull |
| D. | reuse convex hull from the previous iteration |
| Answer» C. merge previously calculated convex hull | |
| 19. |
Which of the following areas do closest pair problem arise? |
| A. | computational geometry |
| B. | graph colouring problems |
| C. | numerical problems |
| D. | string matching |
| Answer» B. graph colouring problems | |
| 20. |
Chan's algorithm is used for computing _________ |
| A. | Closest distance between two points |
| B. | Convex hull |
| C. | Area of a polygon |
| D. | Shortest path between two points |
| Answer» C. Area of a polygon | |
| 21. |
In divide and conquer, the time is taken for merging the subproblems is? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N2) |
| D. | O(log N) |
| Answer» B. O(N log N) | |
| 22. |
The optimal time obtained through divide and conquer approach using merge sort is the best case efficiency. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 23. |
Which of the following statement is not related to quickhull algorithm? |
| A. | finding points with minimum and maximum coordinates |
| B. | dividing the subset of points by a line |
| C. | eliminating points within a formed triangle |
| D. | finding the shortest distance between two points |
| Answer» E. | |
| 24. |
Which of the following algorithms is similar to a quickhull algorithm? |
| A. | merge sort |
| B. | shell sort |
| C. | selection sort |
| D. | quick sort |
| Answer» E. | |
| 25. |
What is the average case complexity of a quick hull algorithm? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N2) |
| D. | O(log N) |
| Answer» C. O(N2) | |
| 26. |
What is the worst case complexity of quick hull? |
| A. | O(N) |
| B. | O(N log N) |
| C. | O(N2) |
| D. | O(log N) |
| Answer» D. O(log N) | |
| 27. |
What is the other name for quick hull problem? |
| A. | convex hull |
| B. | concave hull |
| C. | closest pair |
| D. | path compression |
| Answer» B. concave hull | |
| 28. |
To which type of problems does quick hull belong to? |
| A. | numerical problems |
| B. | computational geometry |
| C. | graph problems |
| D. | string problems |
| Answer» C. graph problems | |
| 29. |
How many approaches can be applied to solve quick hull problem? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |
| 30. |
The quick hull algorithm runs faster if the input uses non- extreme points. |
| A. | true |
| B. | false |
| Answer» B. false | |
| 31. |
___________ is a method of constructing a smallest polygon out of n given points. |
| A. | closest pair problem |
| B. | quick hull problem |
| C. | path compression |
| D. | union-by-rank |
| Answer» C. path compression | |