In the closest-pair algorithm in 2 dimensions, why is it not sufficient to recurse on the left half and right half and simply take the smaller of the two distances?

If a set of open intervals has depth `d`, then every valid interval-partitioning schedule needs at least `d` rooms.

Suppose a student proposes the following interval-scheduling rule: “At each step, choose the interval that conflicts with the fewest remaining intervals; if tied, break ties by shortest length.” Which of the following are valid critiques? Select all that apply.

A flawed closest-pair implementation recursively solves the left and right halves, sets `delta` to the better of those two answers, forms the strip, and then compares every strip point to the next 20 points above it. Which statement is the best diagnosis?

Suppose a pivot `w` partitions the input into `S_(w)`, with `|S_

If your only goal is to find the shortest path from source `s` to one target vertex `v`, when is it safe to stop Dijkstra’s algorithm?

In interval scheduling with one shared resource, which greedy rule is guaranteed to produce a maximum-size compatible set of intervals?

Consider the ternary plot in Q22. Should we reject the null hypothesis?

Suppose we have the counts of A, T, C, G in chromosome 1 of some individual. Denote them by nA, nT, nC, nG. Our goal is to check whether the A-T and C-G base pairing rule exists in the human genome by hypothesis testing. Which of the following is the best choice for the test statistic? (Note that |x| denotes the absolute value of x.)

Consider Q19. Suppose that we determine a woman has anemia if her hemoglobin level is less than or equal to x. Which of the following statements is correct?