D1 Maths Definitions
- Created by: Lizzy Day
- Created on: 08-03-15 18:26
X | K | Q | T | C | O | N | N | E | C | T | E | D | G | R | A | P | H | J | B | N |
I | L | G | W | Y | R | D | U | K | P | P | D | H | M | D | X | M | P | A | V | O |
S | E | M | I | E | U | L | E | R | I | A | N | G | R | A | P | H | E | M | D | H |
X | F | U | L | L | B | I | N | P | A | C | K | I | N | G | B | G | V | M | I | D |
A | Y | I | Q | O | Y | R | E | U | W | M | S | I | V | O | N | Q | J | E | N | Y |
H | M | E | F | K | P | P | R | J | L | C | L | O | W | D | L | Q | F | L | C | U |
P | O | V | M | U | D | X | Y | N | Y | W | G | O | U | P | T | J | O | G | I | D |
A | L | X | R | F | X | L | O | R | O | N | I | F | Y | Q | V | B | I | N | A | C |
R | D | E | G | R | E | E | O | F | A | V | E | R | T | E | X | A | A | I | K | B |
G | P | T | F | K | X | U | G | A | X | T | H | Y | O | K | U | R | A | K | S | D |
E | K | N | O | N | E | U | L | E | R | I | A | N | G | R | A | P | H | A | X | V |
T | C | C | U | N | X | C | F | L | X | D | O | R | A | E | Q | I | N | H | M | Y |
I | W | P | D | X | J | W | P | F | L | P | P | J | X | B | M | S | J | S | X | V |
T | V | A | L | E | N | C | Y | O | F | A | V | E | R | T | E | X | X | D | B | G |
R | C | E | X | O | G | C | Y | D | X | K | Y | P | E | D | K | V | C | N | F | J |
A | V | K | E | N | K | R | N | C | U | Q | Y | R | M | Y | Q | Y | L | A | U | M |
P | H | A | Q | C | N | G | K | L | Y | H | I | Y | T | O | K | O | P | H | J | S |
I | I | F | I | R | S | T | F | I | T | A | L | G | O | R | I | T | H | M | O | G |
B | C | O | N | N | E | C | T | E | D | V | E | R | T | E | X | I | A | W | M | S |
M | A | R | J | Y | L | H | F | Y | N | U | P | U | U | X | Q | A | S | U | I | S |
F | A | T | P | R | U | X | K | E | L | V | I | E | N | V | T | R | C | R | M | A |
Clues
- a bin-packing routine which relies on intelligence. The user spots combinations of items that will fit together and then fits remaining items by using the first-fit algorithm. It is slow but often results in an optimal solution (4, 3, 7)
- a graph is connected if all possible pairs of vertices in it are connected (9, 5)
- a graph which contains two sets of vertices, X and Y in which all the edges join a vertex in set X to a vertex in set Y (9, 5)
- a quick, but often sub-optimal, bin-packing algorithm in which unsorted items are placed in the first bin possible (5, 3, 9)
- all odd nodes (3, 8, 5)
- another name for the degree of a vertex (7, 2, 1, 6)
- exactly 2 odd nodes (4, 8, 5)
- is the number of edges incident to it. The degree of a node is the number of arcs coming from it (6, 2, 1, 6)
- the sum of the degrees of all vertices in a graph must be even since we count each edge twice- once from each end of the 'handshake' between it's vertices. (11, 5)
- two vertices are connected if there is a path between them. (9, 6)
Similar Mathematics resources:
Teacher recommended
Comments
No comments have yet been made