Quiz Space

Programming, Data Structures and Algorithms using Python · Quiz 2 · 24 Mar 2024 · January 2024 term

Question 6: Apply the divide and conquer strategy to find the closest…

Question 6

+3 marksOne correct option

Apply the divide and conquer strategy to find the closest pair of points in a set. After dividing the set into two halves and recursively finding the closest pairs in each half, what additional step is required?

  1. A

    Combine the results directly

  2. B

    Perform a linear search for the closest pair

  3. C

    Consider pairs that span both halves

  4. D

    Sort the points by their distances

Show answer

Correct answer

  • C

    Consider pairs that span both halves

See the whole paperTake it as a mock test

Question 6 of 16 in the IIT Madras BS Programming, Data Structures and Algorithms using Python (PDSA) Quiz 2 paper sat on 24 Mar 2024, in the January 2024 term (IIT M DIPLOMA AN EXAM QDD2 24 Mar 2024). It carries 3 marks.

This question was also asked in

More questions from this paper

  1. Q1In the context of the Floyd-Warshall algorithm, what does it mean if the distance matrix has a negative value in its di…
  2. Q2Figure question
  3. Q3You have a max-heap with the following set of elements:\ {10, 5, 15, 3, 8, 12}\ Which of the following elements is guar…
  4. Q4Consider the following sequence of numbers inserted into an empty Binary Search Tree(BST): 50, 30, 20, 40, 70, 60, 80, …
  5. Q5Which of the following traversals would visit the nodes of a binary search tree in the following order?\ 10, 5, 3, 8, 1…
  6. Q7Figure question
  7. Q8Figure question
  8. Q9For a set of symbols with probabilities of occurrence, which of the following statement(s) about the Huffman tree is/ar…
  9. Q10Define the slope of a node as the absolute difference in height between the left subtree and the right subtree of the n…
  10. Q11Consider the following statements and choose the correct ones.
  11. Q12Figure question
  12. Q13Consider a binary tree with 21 nodes. The maximum number of leaves possible in tree is _.
  13. Q14Figure question
  14. Q15Figure question
  15. Q16Figure question