Computer Science · May / June 2016 · Paper 1 HL · Question 15
Adapt for 2027B2.4.4-B2.4.5 recursion (HL), B2.2.3 stacks; algorithms must be written in Python/Java.
IBCS
As printed in the paper
The question as text
15. The letters F0, F1, F2, …, FN , …, where N 0, are used to identify the N th term of the sequence of Fibonacci numbers that starts as follows. 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , … With the exception of the leading 0 and 1 (the zeroth term and 1st term), the terms in the sequence are the sum of the two preceding terms. For example, F5 is the 5th term of the sequence, which is 5, and is the sum of the 3rd and 4th terms, which are 2 and 3 respectively.
Read automatically from the paper; the printed page above is exact.
Show the answer and mark scheme
15(a)[1]
15(b)[3]
15(c)[6]
15(d)[3]
15(e)[2]
Make a free account to save your answers and see your weak topics and ask the AI why a wrong answer is wrong.