Decision 2 AQA

?
H L V Y Q S G T K B F V J C T D K H U M A
B D A X K N O N N E G A T I V I T Y Q P S
Y S M J U H W T Y M O D D S P I P R E D G
V F A S F J H J G F H V K I M U G A E L K
P W L N I R H G V M F L V Y E N M X F M C
H W O O C P L T K X M W V D W R C A H V I
F R X I V L E H Y C N C A J Y E I P E D O
R U T T Q O Q S P E H C A A E N Y U A M Y
F W O C I F N M E N S U H D J V M V M N M
I G S A T U N M L A J X N B K N K D I T B
E N A X U N H K C M U X X V V M T P L J I
U A G B D M C K R D B F P G M N C T S W A
B I L X J G G H J H Q P S R K M N H P H B
K R P L A Y S A F E S T R A T E G Y O T X
S A M X I V E U U M V H B B V I D D K P D
T G S W S P K V P G J Q X K S U E E S H P
A N N C P L E Q D S G R F C E R V G N S V
T U E D E H Y I W V D F L T B F O F A S H
E H N H D W L I S S Y C F S N F Q H P V W
S T O Y F O T G E Y K K Y J E D I M I G N
S D A Y W F W W C J X N Y B Y K C S W D U

Clues

  • In dynamic programming, edges of a graph are known as ... (7)
  • In dynamic programming, vertices of a graph are known as ... (6)
  • The maximum flow through a network cannot...the minimum cut (6)
  • The option with the worst outcome which is as good as possible in game theory is the ... (4, 4, 8)
  • This algorithm minimises to create an optimum matching of tasks to workers, for example (9)
  • This diagram is used in critical path analysis (7)
  • What constraints can be assumed in the simplex algorithm (3, 10)

Comments

No comments have yet been made

Similar Mathematics resources:

AQA C4
See all Mathematics resources »See all Networks, algorithms and problem solving resources »