McqMate
| Q. |
To which type of problems does quick hull belong to? |
| A. | numerical problems |
| B. | computational geometry |
| C. | graph problems |
| D. | string problems |
| Answer» B. computational geometry | |
| Explanation: quick hull problem and closest pair algorithms are some of the examples of computational problems. | |
View all MCQs in
Design and Analysis of AlgorithmsNo comments yet