Quelpr

Algorithm Design and Representation · CAPE Computer Science Unit 1

26 past-paper questions on Algorithm Design and Representation, part of Problem-Solving with Computers, from every CAPE Computer Science Unit 1 paper on Quelpr.

  1. 3(a)2 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2What is an algorithm?
  2. 3(b)3 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2Name THREE basic control constructs used in structured programming.
  3. 3(d)11 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2Construct a flowchart to represent the algorithm shown.
  4. 3(a)3 marks· CAPE Computer Science Unit 1 · 2010 · Paper 2State THREE basic control structures.
  5. 3(b)6 marks· CAPE Computer Science Unit 1 · 2010 · Paper 2Using the algorithm in Figure 1, give an explanation of EACH control structure stated in (a).
  6. 3(c)7 marks· CAPE Computer Science Unit 1 · 2010 · Paper 2Provide a graphical representation (flowchart) of the algorithm in Figure 1.
  7. 3(b)11 marks· CAPE Computer Science Unit 1 · 2011 · Paper 2Construct a flowchart to represent the given algorithm that finds the average age of a set of students.
  8. 4(a)3 marks· CAPE Computer Science Unit 1 · 2011 · Paper 2State THREE properties of a well-designed algorithm.
  9. 4(c)(ii)3 marks· CAPE Computer Science Unit 1 · 2011 · Paper 2Indicate whether 'bounded' or 'unbounded' iteration was used in your response for 4(c)(i) and state ONE reason for its use.
  10. 3(b)(i)3 marks· CAPE Computer Science Unit 1 · 2012 · Paper 2Which of the algorithms illustrates bounded iteration? Justify your answer.
  11. 3(b)(ii)3 marks· CAPE Computer Science Unit 1 · 2012 · Paper 2Which of the algorithms illustrates unbounded iteration? Justify your answer.
  12. 4(a)12 marks· CAPE Computer Science Unit 1 · 2012 · Paper 2Construct a flow chart to represent the given algorithm calculating commission based on numDays and numItemsSold.
  13. 3(c)(i)8 marks· CAPE Computer Science Unit 1 · 2013 · Paper 2Construct a flowchart that reads student data (each line having a student ID followed by scores in 3 subjects, terminated by ID 9999) and, for each student, calculates and prints the average scored across the 3 subjects.
  14. 3(c)(ii)5 marks· CAPE Computer Science Unit 1 · 2013 · Paper 2In the same flowchart or problem solution, count and print the total number of students in the class (e.g., 'There are 3 students in the class').
  15. 4(c)6 marks· CAPE Computer Science Unit 1 · 2013 · Paper 2Explain THREE properties of well-designed algorithms, using an example in EACH case.
  16. 3(a)(i)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Sequence
  17. 3(a)(ii)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Selection
  18. 3(a)(iii)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Iteration
  19. 4(b)6 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Construct a flow chart to represent the algorithm given in 4(a) above.
  20. 3(b)(i)1 mark· CAPE Computer Science Unit 1 · 2015 · Paper 2Identify which of the two algorithms illustrates unbounded iteration.
  21. 3(b)(ii)1 mark· CAPE Computer Science Unit 1 · 2015 · Paper 2Identify which of the two algorithms illustrates bounded iteration.
  22. 3(b)(iii)2 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Explain how the loop in Algorithm 1 is expected to terminate.
  23. 3(b)(iv)2 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Explain how the loop in Algorithm 2 is expected to terminate.
  24. 4(b)13 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Construct a flowchart representing the given looping and branching algorithm.
  25. 3(b)4 marks· CAPE Computer Science Unit 1 · 2016 · Paper 2Distinguish between 'bounded iteration' and 'unbounded iteration'.
  26. 4(a)11 marks· CAPE Computer Science Unit 1 · 2016 · Paper 2Construct a flowchart to represent the provided pseudocode algorithm for reading customer sales until 'enddata'.