Computer Science · May / June 2023 · Paper 1 TZ2 HL · Question 13
Adapt for 2027Recursion (B2.4.4, HL only) and stacks and queues (B2.2) are covered, but this recursion has two calls, which goes beyond the simple recursion students trace; rewrite in Python or Java.
IBCS
As printed in the paper
The question as text
13. Consider the following recursive method: func(X) if X>1 then return func(X-1) + func(X-2) else return X end if end func
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
13(a)[4]
13(b)[4]
13(c)[2]
13(d)[5]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.