Consider supporting us on Patreon. Help us keep revisedeck free.
19.2. Recursion
A subsection of Computer Science, 9618, through 19. Computational thinking and Problem-solving
Listing 2 of 2 questions
Describe what is meant by recursion. A Fibonacci sequence is a series of numbers formed by adding together the two preceding numbers, for example: 0, 1, 1, 2, … This function calculates and returns values in the Fibonacci sequence and uses recursion. FUNCTION Fib(Number : INTEGER) RETURNS INTEGER IF Number <= 1 THEN Result ← Number ELSE Result ← Fib(Number – 1) + Fib(Number – 2) ENDIF RETURN Result ENDFUNCTION Complete the trace table for the function when it is called as Fib(5). Call number Function call Number Result Return value
9618_s23_qp_31
THEORY
2023
Paper 3, Variant 1
View
Describe what is meant by recursion. A Fibonacci sequence is a series of numbers formed by adding together the two preceding numbers, for example: 0, 1, 1, 2, … This function calculates and returns values in the Fibonacci sequence and uses recursion. FUNCTION Fib(Number : INTEGER) RETURNS INTEGER IF Number <= 1 THEN Result ← Number ELSE Result ← Fib(Number – 1) + Fib(Number – 2) ENDIF RETURN Result ENDFUNCTION Complete the trace table for the function when it is called as Fib(5). Call number Function call Number Result Return value
9618_s23_qp_33
THEORY
2023
Paper 3, Variant 3
View
Questions Discovered
2