Decision 2 AQA

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

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 »