Edexcel Further Maths Decision D1 Revision Quiz 1

Flowcharts are used to describe.....

This algorithm considers the items in the order they are given

• First-fit

• First-fit decreasing

• Full-bin

Which algorithm requires a pivot

• Flow chart

• Bubble sort

• Quick sort

• Bin packing

When using the pivot, when you have a choice you would choose the item on the....

• Left

• Right

Where every vertex is directly connected to all other vertices by a single edge is a....

• simple graph

• tree

• spanning tree

• complete graph

A graph where no two edges meet except at a vertex is....

An edge that starts and finishes at the same vertex is a ....

The algorithm that finds a minimum spanning tree by selecting arcs in order of their size is...

• Kruskal's

• Prim's

• Dijkstra's

• Floyd's

A minimum spanning tree returns to the initial vertex

• True

• False

The algorithm used with a matrix is...

• Kruskal's

• Prim's

• Dijkstra's