This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Chan’s Algorithm”. 1. Chan’s algorithm is used for computing _________ a) Closest distance between two points b) Convex hull c) Area of a polygon d) Shortest path between two points 2. What is the running time of Chan’s algorithm? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Quickhull”. 1. ___________ is a method of constructing a smallest polygon out of n given points. a) closest pair problem b) quick hull problem c) path compression d) union-by-rank 2. What is the other name for quick hull problem? a) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Cross Product”. 1. Cross product is a mathematical operation performed between ________________ a) 2 scalar numbers b) a scalar and a vector c) 2 vectors d) any 2 numbers 2. Cross product is also known as? a) scalar product b) … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Closest Pair Problem”. 1. Which of the following areas do closest pair problem arise? a) computational geometry b) graph colouring problems c) numerical problems d) string matching 2. Which approach is based on computing the distance between each pair of … Read more
This set of Data Structures & Algorithms Multiple Choice Questions & Answers (MCQs) focuses on “Line Point Distance”. 1. 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 … Read more
