Mining Engineering > GATE 2025 > Geometry
Three villages P, Q, and R are located in such a way that the distance PQ=13 km, QR=14 km, and RP=15 km as shown in the figure. A straight road joins Q and R. It is proposed to connect P to this road QR by constructing another road. What is the minimum possible length (in km) of this connecting road?
Note: The figure shown is representative.
A
10.5
B
11.0
C
12.0
D
12.5

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science