benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU-Pro / 10414 / Let G = (V, E) be a finite directed acyclic graph with |E| > 0. Which of the…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Let G = (V, E) be a finite directed acyclic graph with |E| > 0. Which of the following must be true?
I. G has a vertex with no incoming edge.
II. G has a vertex with no outgoing edge.
III. G has an isolated vertex, that is, one with neither an incoming edge nor an outgoing edge.

category

computer science

options

  1. I and III only
  2. None of the above
  3. I and II only
  4. II and III only
  5. I, II, and a vertex with one outgoing edge
  6. I, II, and a vertex with one incoming edge
  7. All of the above (I, II, III)
  8. II only
  9. I only
  10. III only

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

upstream_id / Original problem ID
10414
task_id
e11058f6-0998-5f62-b459-8163b3fd7617
task_key
default--test--10414
task_revision_id
1
config / split
default / test

Official source

initial import