An integer is said to be divisible by another integer if the result of the division is also an integer. For example: 10 is divisible by 1, 2, 5 and 10: • 10 ÷ 1 = 10 • 10 ÷ 2 = 5 • 10 ÷ 5 = 2 • 10 ÷ 10 = 1 10 is not divisible by 4: • 10 ÷ 4 = 2.5 1, 2, 5 and 10 are said to be the divisors of 10. The iterative function IterativeCalculate() totals all the divisors of its integer parameter and returns this total. Example 1: if the parameter is 10, the total will be 18 (1 + 2 + 5 + 10) . Example 2: if the parameter is 4, the total will be 7 (1 + 2 + 4) . A pseudocode algorithm for IterativeCalculate() is shown. FUNCTION IterativeCalculate(Number : INTEGER) RETURNS INTEGER DECLARE Total : Integer DECLARE ToFind : Integer ToFind ← Number Total ← 0 WHILE Number <> 0 IF ToFind MODULUS Number = 0 THEN Total ← Total + Number ENDIF Number ← Number – 1 ENDWHILE RETURN Total ENDFUNCTION The operator MODULUS calculates the remainder when one number is divided by another.
✓ Correct Answer
The correct answer is —. This question tests the candidate's understanding of programming and computational thinking within the Computer Sciencesyllabus. The examiner's mark scheme requires...
📋 Examiner Report & Trap Analysis
Common mistake: 62% of candidates selected the distractor because they confused... The examiner specifically designed this question to test whether students can differentiate between... To secure full marks, candidates must demonstrate...
Unlock the Examiner's Answer
Sign up for free to reveal the correct answer, the official mark scheme breakdown, and the examiner trap analysis for this question.
Sign Up Free to Unlock →Join thousands of Cambridge students already using Oracle Prep