McqMate

Q. |
## 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» A. o(n) | |

Explanation: the time taken to find the ‘n’ points that lie in a convex quadrilateral is mathematically found to be o(n). |

2.5k

0

Do you find this helpful?

16

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Which of the following is called the “ultimate planar convex hull algorithm”?
- In divide and conquer, the time is taken for merging the subproblems is?
- The time taken to compute the transitive closure of a graph is Theta(n2).
- What is the time complexity of the recursive implementation used to find the nth fibonacci term?
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- Consider the brute force implementation in which we find all the possible ways of multiplying the given set of n matrices. What is the time complexity of this implementation?
- What is the time complexity of the brute force algorithm used to find the longest common subsequence?
- What is the time complexity of the brute force algorithm used to find the length of the longest palindromic subsequence?
- The most important condition for which closest pair is calculated for the points (pi, pj) is?
- Manhattan distance is an alternative way to define a distance between two points.