Scribd
Upload
125 views3 pages

Recursive Question

The document discusses iterative and recursive functions to calculate the total of all divisors of an integer number. It provides pseudocode for an iterative function called IterativeCalculate and an incomplete recursive function called RecursiveValue. It asks the reader to write code to implement these functions and test them by calling the functions with sample parameters and outputting the return values.

Uploaded by

87shf2xx2j
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
125 views3 pages

Recursive Question

The document discusses iterative and recursive functions to calculate the total of all divisors of an integer number. It provides pseudocode for an iterative function called IterativeCalculate and an incomplete recursive function called RecursiveValue. It asks the reader to write code to implement these functions and test them by calling the functions with sample parameters and outputting the return values.

Uploaded by

87shf2xx2j
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

6

2 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.

© UCLES 2023 9618/42/O/N/23


7

(a) (i) Write program code for IterativeCalculate().

Save your program as Question2_N23.

Copy and paste the program code into part 2(a)(i) in the evidence document.
[5]

(ii) Write program code to call IterativeCalculate() with 10 as the parameter and
output the return value.

Save your program.

Copy and paste the program code into part 2(a)(ii) in the evidence document.
[2]

(iii) Test your program.

Take a screenshot of the output.

Save your program.

Copy and paste the screenshot into part 2(a)(iii) in the evidence document.
[1]

(b) IterativeCalculate() has been rewritten as the recursive function RecursiveValue().

A pseudocode algorithm for RecursiveValue() is given. The function is incomplete.

FUNCTION RecursiveValue(Number : INTEGER, ToFind : INTEGER)


RETURNS INTEGER

IF Number = .............. THEN

RETURN 0

ELSE

IF ToFind .............. Number = 0 THEN

RETURN .............. + RecursiveValue(Number - 1, ToFind)

ELSE

.............. RecursiveValue(Number - 1, ..............)

ENDIF

ENDIF

ENDFUNCTION

© UCLES 2023 9618/42/O/N/23 [Turn over


8

(i) Write program code for RecursiveValue().

Save your program.

Copy and paste the program code into part 2(b)(i) in the evidence document.
[7]

(ii) Write program code to call RecursiveValue() with 50 as the first parameter and 50
as the second parameter and output the return value.

Save your program.

Copy and paste the program code into part 2(b)(ii) in the evidence document.
[1]

(iii) Test your program.

Take a screenshot of the output.

Save your program.

Copy and paste the screenshot into part 2(b)(iii) in the evidence document.
[1]

© UCLES 2023 9618/42/O/N/23

You might also like