AQA A-Level Further Mathematics Discrete mathematics overview quiz quiz

Twice the number of edges

Exactly the number of edges

Half of the total number of edges

The total number of vertices

$5$

$10$

$20$

$25$

Every vertex has odd degree

It has exactly two odd-degree vertices

Every vertex has even degree

It is a tree

$5$

$6$

$7$

$8$

Choose any starting vertex at random and then build outwards from there

Select the single edge of greatest weight anywhere in the whole network

Delete the most expensive edge from the network before doing anything else

Select the edge of least weight that does not form a cycle

Dijkstra's algorithm

Prim's algorithm

Kruskal's algorithm

The simplex algorithm

The latest time it can occur

The total float of the project

The earliest time it can occur

The number of workers needed

One day

Equal to its duration

Undefined

Zero

At a vertex (corner point) of the region

Always at the exact geometric centre of the feasible region

Always at the origin where both variables are equal to zero

At any point at all lying somewhere inside the feasible region

Replace the $\leq$ sign with an $=$ sign directly and change nothing else at all

Add a slack variable: $2x + 3y + s = 12$ with $s \geq 0$

Subtract a surplus variable from the left-hand side: $2x + 3y - s = 12$

Square both sides of the inequality to remove the inequality sign entirely

Choose the row with the smallest maximum (minimax)

Choose the row with the largest entry

Choose the row with the largest minimum (maximin)

Choose randomly

The game has no solution at all and so it cannot be analysed any further

Both players are forced to use mixed strategies rather than a single pure one

The game is heavily biased in favour of the column player over the row player

The game has a saddle point and a stable solution with value $4$