Computational Geometry
Quick practice
Question 1 of 5
Which of these is the shortest path to get from D to E, if you are not allowed to move inside the circle?. Assume E lies diametrically opposite to D (i.e. D, A, E lie in a straight line).
A
B
C
D
One of A, B, C depending on the radius and distance between D and E
Concepts
Get unlimited practice with Competitive Programming subscription
Boost your performance with adaptive practice tests
Practice every concept in the syllabus
Compare your speed and accuracy with your peers
Download the app and practice on the go