- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- The shortest distance between a line and...

Q. |
## The shortest distance between a line and a point is achieved when? |

A. | a line is drawn at 90 degrees to the given line from the given point |

B. | a line is drawn at 180 degrees to the given line from the given point |

C. | a line is drawn at 60 degrees to the given line from the given point |

D. | a line is drawn at 270 degrees to the given line from the given point |

Answer» A. a line is drawn at 90 degrees to the given line from the given point | |

Explanation: the shortest distance between a line and a point is achieved when a line is drawn at 90 degrees to the given line from the given point. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the shortest distance between the line given by -2x + 3y + 4 = 0 and the point (5,6)?
- Manhattan distance is an alternative way to define a distance between two points.
- What is the distance between the lines 3x- 4y+7=0 and 3x-4y+5=0?
- Consider the strings “monday” and “tuesday”. What is the edit distance between the two strings?
- Consider the two strings “”(empty string) and “abcd”. What is the edit distance between the two strings?
- Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.
- 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?
- There are 10 dice having 5 faces. The faces are numbered from 1 to 5. What is the number of ways in which a sum of 4 can be achieved?
- Which of the following is similar to Euclidean distance?

Login to Continue

It will take less than 2 minutes

Report MCQ