benchmarks.wiki

benchmarks.wiki / Public workspace

MMLU / Let T be a depth-first search tree of a connected undirected graph G. For each…

Problem

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

question

Let T be a depth-first search tree of a connected undirected graph G. For each vertex v of T, let pre(v) be the number of nodes visited up to and including v during a preorder traversal of T, and post(v) be the number of nodes visited up to and including v during a postorder traversal of T. The lowest common ancestor of vertices u and v in T is a vertex w of T such that w is an ancestor of both u and v, and no child of w is an ancestor of both u and v. Let (u, v) be an edge in G that is not in T, such that pre(u) < pre(v). Which of the following statements about u and v must be true?
I. post(u) < post(v)
II. u is an ancestor of v in T.
III. If w is the lowest common ancestor of u and v in T, then w = u.

choices

  1. I only
  2. II only
  3. III only
  4. II and III

subject

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

task_id
29e6bb18-67a2-5ae4-ab81-de57e4683c1e
task_key
all--test--29e6bb18-67a2-5ae4-ab81-de57e4683c1e
task_revision_id
1
config / split
all / test

Official source

initial import