Design and Analysis of Algorithms MCQs | Page - 20

 the optimal time for solving using a divide and conquer approach is mathematically found to be o(n log n).

 the time taken for merging the smaller subproblems in a divide and conquer approach is mathematically found to be o(n log n).

 the optimal time obtained through divide and conquer approach is the best class efficiency and it is given by Ω(n log n).

 the above diagram depicts the implementation of divide and conquer. the problem is divided into sub problems and are separated by a line.

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

 cross product is a mathematical operation that is performed on 2 vectors in a 3d plane. it has many applications in computer programming and physics.

 cross product is also known as a vector product. it is a mathematical operation that is performed on 2 vectors in 3d plane.

 the concept of cross product find its application in the field of computer graphics. it can be used to find the winding of polygon about a point.

 the vector product a x b is equal to – (b x a). the minus sign shows that these vectors have opposite directions.

 cross product of two vectors can be used to find the area of parallelogram. for this, we need to consider the vectors as the adjacent sides of the parallelogram.