RaindropA practical guide to choosing decision modelsGitHub ↗

Similar distractors · Add more similar but irrelevant items variant

Original question · Other versions of this question · All variants

This version keeps the original reference answer. Its context, question instructions or answer choices were changed as described below.

Changed fields: context.

How the edits were constructed

Context

«A separate function specification gives g(0) = 1 and g(n + 1) = g(n) + 3 for nonnegative integers n.»

«Another independent specification gives h(1) = 2 and h(2n) = h(n) + 1 for positive integers n.»

«A third separate specification gives r(0) = 0 and r(n + 1) = 2r(n) + 1 for nonnegative integers n.»

Question

Of the following, which gives the best upper bound for the value of f(N) where f is a solution to the recurrence f(2N + 1) = f(2N) = f(N) + log N for N >= 1, with f(1) = 0?

Answer choices

  • A. O(log N)
  • B. O(N log N)
  • C. O(log N) + 0(1)
  • D. O((log N)^2)

Reference answer: D.

Exact evaluated input as JSON
{
  "state": "«A separate function specification gives g(0) = 1 and g(n + 1) = g(n) + 3 for nonnegative integers n.»\n\n«Another independent specification gives h(1) = 2 and h(2n) = h(n) + 1 for positive integers n.»\n\n«A third separate specification gives r(0) = 0 and r(n + 1) = 2r(n) + 1 for nonnegative integers n.»",
  "question": "Of the following, which gives the best upper bound for the value of f(N) where f is a solution to the recurrence f(2N + 1) = f(2N) = f(N) + log N for N >= 1, with f(1) = 0?",
  "choices": {
    "A": "O(log N)",
    "B": "O(N log N)",
    "C": "O(log N) + 0(1)",
    "D": "O((log N)^2)"
  }
}

Recorded model answers

The original column uses the control response paired with this variant. Missing responses and inputs outside a model’s limit remain visible.

Model Original answer Variant answer Change
GLiDE v1.2 D — O((log N)^2) D — O((log N)^2) Same answer
Decider v1.1 D — O((log N)^2) D — O((log N)^2) Same answer
Jev D — O((log N)^2) D — O((log N)^2) Same answer
Microsoft Decision-1 D — O((log N)^2) D — O((log N)^2) Same answer
Clef D — O((log N)^2) D — O((log N)^2) Same answer
Luna Decisions D — O((log N)^2) D — O((log N)^2) Same answer
Clef Flash D — O((log N)^2) D — O((log N)^2) Same answer
Strands Decider D — O((log N)^2) A — O(log N) Different answer
GLiNER2.5 Decide B — O(N log N) A — O(log N) Different answer
Laya C — O(log N) + 0(1) C — O(log N) + 0(1) Same answer
CalDec v1 A — O(log N) C — O(log N) + 0(1) Different answer
Identifiers and recorded conditions

Variant ID: mmlu/f5ccb2b0c61a00da265b/similar_distractors/high/clean-source_first_parallel_b_operations_0302

Input fingerprint: e820cdfd9e786b8c15d66d3963c58441debb367748f5e501fe56038a2c122e41

Change Recorded version
Similar distractors Add more similar but irrelevant items

Source attribution and dataset terms are linked from the original question.

Type to search questions, variants and documentation.