How often Algorithm design and planning (IPO) is asked

Where it was asked

• May/Jun 201957 marks
• May/Jun 201836 marks
• May/Jun 20172 marks

The questions

1. May/Jun 2019, Q2.131 mark · multiple choice

   Which chart do programmers use to enable them to do better and more comprehensive planning, allowing them to write complete algorithms without errors?

2. May/Jun 2019, Q3.91 mark

   Complete the statement: it is very important to test the ____ of an algorithm for correctness and readability.

3. May/Jun 2019, Q455 marks

   For Programming 3, the final mark awarded to a student is built up from several assessments, each carrying its own weighting: Test 1 counts 15%, Test 2 counts 20%, the better of two class test marks counts 15%, and the examination counts 50%. You must plan and then write an algorithm that calculates this final mark. A function must be coded to work out and return whichever of the two class test marks is the higher one. One subprocedure must use this information, together with the other assessment marks, to calculate the final mark and to decide and generate a pass/fail message, while a second, separate subprocedure must be responsible for displaying both the final mark and that pass/fail message. Your answer must include a hierarchy chart showing how the main procedure, the function and the two subprocedures relate to one another; full planning tables for the main procedure, the function and each of the two subprocedures, each table listing, for every input, intermediate and output variable required, its description, data type and variable name; and finally the complete algorithm that solves the problem, incorporating the main procedure, the function and the two subprocedures as planned.

4. May/Jun 2018, Q1.21 mark

   State whether it is true or false that, when writing an algorithm for a calculation, the programmer needs to ensure that the calculation has been done correctly, but does not necessarily need to know the result.

5. May/Jun 2018, Q1.31 mark

   State whether it is true or false that deleting all unnecessary information from the problem statement can help you arrive at the crux of the problem.