Algorithms (Exam Qs 1) Decision 1 EDEXCEL A-Level

[BudskiiHD]

Great video thanks!

Why are the answers on the same line in the second question? at 7:27

but not in first question?

[nailachoudhury]

Does it matter how you fill out your answers on the table in the answer booklet. Because in the first question you wrote the values on a separate line for every step but in the second question you filled out the row before starting a new line. Is there a reason why you did it like that or does it not matter as long as the numbers are correct?

[OtterChef]

Hi HegartyMaths, I don't suppose you could provide links for the answer booklets? I've looked on the Edexcel website and can't seem to find them on both the question papers or the mark schemes. Thank you for uploading these videos they're really helpful! :)

[willben]

For the first algorithm, the trace table started a new line at every instruction/decision but for the second algorithm, the trace table displayed multiple results on each line. Whys is this so? Is it permitted to use either way or is there a specific rule regarding when each trace table format is appropriate?

[amosnc]

Decision is basically all the stuff i was taught at GCSE computer science

[HEGARTYMATHS]

Please see my youtube channel - the playlist on Quadratic Equations. Also see my unit 2 past paper videos on the Unit 2 Higher playlist. Hope this helps. Mr H

[CLUDO]

Do these videos still apply for the edexcel D1 2016?

[waynebrehaut]

Note that instead of a "set of ordered instructions" you mean an "ordered set (i.e., sequence) of instructions". That is, it's the set of instructions that must be ordered, not the individual instructions--in fact there's no clear definition for an "ordered instruction".

Also, an algorithm need not "solve a problem": it may, instead, give a clear indication that the given problem has no solution. Consider, for example, applying an algorithm for finding a perfect matching in a bipartite graph to one that has no perfect matching: instead of ending with a perfect matching it must end with a statement that the graph has no perfect matching (and, preferably, sufficient information to indicate why it can't).