Quelpr

Algorithm Design and Representation · CAPE Computer Science Unit 1

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

Practise Algorithm Design and Representation
  1. 6(a)(i)3 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Explain what is meant by an 'expert system'.
  2. 6(a)(ii)2 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Discuss briefly how an expert system can assist management in making decisions.
  3. 6(b)(i)3 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Explain what constitutes a data warehouse.
  4. 6(b)(ii)2 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Discuss briefly the processes that take place during data mining.
  5. 8(a)4 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Describe two distinct forms of data security.
  6. 8(b)3 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Using an example, explain how a system backup is conducted to enhance data security.
  7. 8(c)3 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Using an example, explain what is meant by the phrase 'real-time updating of files'.
  8. 10(a)(i)2 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Explain the concept of telecommuting.
  9. 10(a)(ii)2 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1State two advantages associated with telecommuting.
  10. 10(b)2 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1State two ways in which computers have altered how individuals entertain themselves.
  11. 10(c)4 marks· CAPE Computer Science Unit 1 · 2006 · Paper 1Describe two ways in which computers have transformed the ways people communicate with one another.
  12. 4(a)6 marks· CAPE Computer Science Unit 1 · 2006 · Paper 2Describe TWO techniques that Caribbean banks offering Web-based financial services can employ to prevent or deter unauthorized access to their systems.
  13. 4(b)6 marks· CAPE Computer Science Unit 1 · 2006 · Paper 2A singer found someone making copies of his music, resulting in the person's arrest. Explain why this person was arrested for making copies of the music.
  14. 4(c)9 marks· CAPE Computer Science Unit 1 · 2006 · Paper 2Using examples, describe THREE ways in which an organization can benefit from automation.
  15. 4(d)9 marks· CAPE Computer Science Unit 1 · 2006 · Paper 2Discuss THREE ways in which computer applications have affected the job market.
  16. 4(e)4 marks· CAPE Computer Science Unit 1 · 2008 · Paper 2State TWO advantages of videoconferencing over email as a means of communicating information.
  17. 3(b)(i)2 marks· CAPE Computer Science Unit 1 · 2008 (second paper) · Paper 2Explain the meaning of 'telecommuting'.
  18. 3(b)(ii)8 marks· CAPE Computer Science Unit 1 · 2008 (second paper) · Paper 2Describe TWO benefits and TWO challenges of telecommuting from the employer's perspective.
  19. 3(b)(iii)4 marks· CAPE Computer Science Unit 1 · 2008 (second paper) · Paper 2Describe TWO conditions necessary for telecommuting to be successful.
  20. 3(c)(i)4 marks· CAPE Computer Science Unit 1 · 2008 (second paper) · Paper 2Discuss TWO methods that Internet users can employ to protect themselves from identity theft.
  21. 3(c)(ii)4 marks· CAPE Computer Science Unit 1 · 2008 (second paper) · Paper 2Discuss TWO precautions to take when completing online purchases using a credit card.
  22. 3(a)2 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2What is an algorithm?
  23. 3(b)3 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2Name THREE basic control constructs used in structured programming.
  24. 3(d)11 marks· CAPE Computer Science Unit 1 · 2009 · Paper 2Construct a flowchart to represent the algorithm shown.
  25. 3(a)3 marks· CAPE Computer Science Unit 1 · 2010 · Paper 2State THREE basic control structures.
  26. 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).
  27. 3(c)7 marks· CAPE Computer Science Unit 1 · 2010 · Paper 2Provide a graphical representation (flowchart) of the algorithm in Figure 1.
  28. 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.
  29. 4(a)3 marks· CAPE Computer Science Unit 1 · 2011 · Paper 2State THREE properties of a well-designed algorithm.
  30. 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.
  31. 3(b)(i)3 marks· CAPE Computer Science Unit 1 · 2012 · Paper 2Which of the algorithms illustrates bounded iteration? Justify your answer.
  32. 3(b)(ii)3 marks· CAPE Computer Science Unit 1 · 2012 · Paper 2Which of the algorithms illustrates unbounded iteration? Justify your answer.
  33. 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.
  34. 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.
  35. 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').
  36. 4(c)6 marks· CAPE Computer Science Unit 1 · 2013 · Paper 2Explain THREE properties of well-designed algorithms, using an example in EACH case.
  37. 3(a)(i)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Sequence
  38. 3(a)(ii)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Selection
  39. 3(a)(iii)2 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Iteration
  40. 4(b)6 marks· CAPE Computer Science Unit 1 · 2014 · Paper 2Construct a flow chart to represent the algorithm given in 4(a) above.
  41. 3(b)(i)1 mark· CAPE Computer Science Unit 1 · 2015 · Paper 2Identify which of the two algorithms illustrates unbounded iteration.
  42. 3(b)(ii)1 mark· CAPE Computer Science Unit 1 · 2015 · Paper 2Identify which of the two algorithms illustrates bounded iteration.
  43. 3(b)(iii)2 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Explain how the loop in Algorithm 1 is expected to terminate.
  44. 3(b)(iv)2 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Explain how the loop in Algorithm 2 is expected to terminate.
  45. 4(b)13 marks· CAPE Computer Science Unit 1 · 2015 · Paper 2Construct a flowchart representing the given looping and branching algorithm.
  46. 3(b)4 marks· CAPE Computer Science Unit 1 · 2016 · Paper 2Distinguish between 'bounded iteration' and 'unbounded iteration'.
  47. 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'.

Related topics in Problem-Solving with Computers