D1 Definitions
- Created by: jroe99
- Created on: 14-06-18 20:29
| B | O | M | M | A | T | C | H | I | N | G | A | L | G | O | R | I | T | H | M | T |
| I | N | U | K | N | B | P | B | C | N | B | N | D | X | K | I | M | N | C | F | X |
| N | M | L | S | O | X | C | R | O | T | R | M | V | M | A | S | I | K | R | B | R |
| P | U | I | E | N | I | U | U | M | K | E | O | Q | G | A | O | N | P | I | T | W |
| A | B | N | C | T | R | U | S | P | G | Q | M | F | V | I | M | I | G | T | T | G |
| C | R | E | I | R | T | A | A | L | K | J | U | H | A | O | O | M | O | I | C | E |
| K | O | A | T | A | A | E | K | E | K | U | O | B | N | H | R | U | R | C | O | E |
| I | H | R | R | V | M | M | S | T | D | L | H | F | Y | T | P | M | A | A | W | N |
| N | H | P | E | E | Y | T | V | E | Q | I | X | Q | I | L | H | S | N | L | T | I |
| G | C | R | V | R | C | R | Y | M | I | G | X | D | Q | B | I | P | Q | A | W | Y |
| F | A | O | D | S | N | N | C | A | E | Y | B | X | A | D | C | A | B | C | X | B |
| U | E | G | E | I | E | L | Y | T | S | W | H | O | C | N | G | N | B | T | K | U |
| L | C | R | T | B | C | I | T | C | V | U | C | T | M | D | R | N | G | I | M | H |
| L | F | A | C | L | N | X | O | H | O | B | K | Y | X | U | A | I | A | V | K | E |
| B | E | M | E | E | A | U | R | I | V | E | V | Y | O | D | P | N | D | I | A | H |
| I | A | M | N | G | J | S | A | N | T | X | H | P | I | V | H | G | E | T | U | X |
| N | A | I | N | R | D | N | R | G | O | J | N | O | T | S | S | T | B | Y | A | D |
| I | H | N | O | A | A | V | B | I | P | T | M | Q | H | U | Y | R | N | C | W | B |
| J | Q | G | C | P | S | X | I | I | E | J | E | B | Q | Q | M | E | I | Q | X | R |
| S | K | U | E | H | T | P | W | X | V | Q | D | G | V | C | Y | E | X | O | P | M |
| Q | N | Q | K | E | E | Q | K | Y | X | M | M | T | U | P | N | R | P | R | Q | D |
Clues
- A graph with more than two odd vertices. (3, 11, 5)
- A matching in of two setsm each containing n nodes, which has n arcs. (8, 8)
- A matrix recording the number of direct links between vertices. (10, 6)
- A method of optimising a function given various constraints. Starts by formulating constraints & sketching the feasible region & can be completed using either the ruler or vertex method. (6, 11)
- A spanning tree such that the total length of the arcs is as small as possible. (7, 8, 4)
- An activity for which an increase in its duration results in a corresponding increse in the duration of the project. Critical activities have no float. (8, 8)
- An algorithm for improving one to one pairing of elements of one set with elements of another set represented by a bipartite graph. (8, 9)
- Graphs which show the same information but are drawn differently. (10, 6)
- Place the items into the bins by eye in order to fill as many bins as possible. It leads to a good solution but is difficult. (3, 7, 4, 3)
- Vertices with a path between them. (9, 8)
Comments
No comments have yet been made