ml-recall

#chordal-graph

2 questions from Probabilistic & Graphical Models

Timed test

2 questions · 2 min · score and explanations at the end

Take a test

Q 1 / 2Score 0 / 0

Shuffle questions

Question 1: Single choice

hardAI-checkedProbabilistic & Graphical Models

$H$ is the undirected five-cycle below ( $x_1 - x_2$ , $x_2 - x_4$ , $x_4 - x_5$ , $x_5 - x_3$ , $x_3 - x_1$ ). Build the directed minimal I-map of $H$ for the ordering $(x_1, x_2, x_3, x_4, x_5)$ . Which edges does it have beyond the five edges of $H$ ?

Undirected graph with edges x1-x2, x1-x3, x2-x4, x3-x5 and x4-x5, forming a five-cycle.

$x_2 \to x_3$ and $x_3 \to x_4$ 1
None; orienting the cycle along the ordering is enough2
$x_2 \to x_3$ only3
$x_1 \to x_4$ and $x_1 \to x_5$ 4

Keys: 1–9 select · Enter check / next