- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which of the points are closer to each o...

Q. |
## Which of the points are closer to each other? |

A. | p1 and p11 |

B. | p3 and p8 |

C. | p2 and p3 |

D. | p9 and p10 |

Answer» C. p2 and p3 | |

Explanation: from symmetry, we determine that the closest pair is p2 and p3. but the exact calculations have to be done using euclid’s algorithm. |

View all MCQs in:
Design and Analysis of Algorithms

- If there are n couples who would prefer each other to their actual marriage partners, then the assignment is said to be unstable.
- 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.
- is a method of constructing a smallest polygon out of n given points.
- The quick hull algorithm runs faster if the input uses non- extreme points.
- The time is taken to find the ‘n’ points that lie in a convex quadrilateral is?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- You have 2 dice each of them having 6 faces numbered from 1 to 6. What is the number of ways in which a sum of 11 can be achieved?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?

Login to Continue

It will take less than 2 minutes

Report MCQ