{"id":5706,"date":"2016-01-27T22:43:27","date_gmt":"2016-01-27T21:43:27","guid":{"rendered":"https:\/\/mathedup.co.uk\/?page_id=5706"},"modified":"2017-04-29T20:36:37","modified_gmt":"2017-04-29T19:36:37","slug":"decision-takeaway","status":"publish","type":"page","link":"https:\/\/www.mathedup.co.uk\/a-level-takeaways\/decision-takeaway\/","title":{"rendered":"Decision Takeaway"},"content":{"rendered":"

AQA Decision\u00a01<\/h1>\n\n\n\n\n\n\n\n\n\n\n\n\n
1<\/td>\nSorting algorithms<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
2<\/td>\nPseudo code<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
3<\/td>\nGraphs and networks<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
4<\/td>\nMinimum connector<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
5<\/td>\nShortest path<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
6<\/td>\nMatching<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
7<\/td>\nRoute inspection<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
8<\/td>\nTravelling salesperson<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
9<\/td>\nLinear programming<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

AQA Decision 2<\/h1>\n\n\n\n\n\n\n\n\n\n
10<\/td>\nAllocation<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
11<\/td>\nNetwork flows<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
12<\/td>\nCritical path analysis<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
13<\/td>\nDynamic programming<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
14<\/td>\nThe Simplex algorithm<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
15<\/td>\nGame theory<\/a><\/td>\nRevise<\/a><\/td>\nLearn<\/a><\/td>\nChallenge<\/a><\/td>\nAns<\/a><\/td>\n<\/tr>\n
<\/td>\n<\/tr>\n<\/tbody>\n<\/table>\n

 <\/p>\n