An algorithm is shown in the pseudocode below.
1 fruits ← ['Apple', 'Banana', 'Cherry']
2 fruit1 ← 'Damson'
3 fruit2 ← 'Elderberry'
4 OUTPUT fruit1
5 OUTPUT LEN(fruits)
6 temp ← SUBSTRING(1, 3, fruit1)
7 OUTPUT temp
Select the option that correctly shows the output of line 5 from this algorithm.
111
333
555
666
89 exam-style questions on AQA GCSE Computer Science String handling operations in a programming language. Each one has a worked solution and a mark scheme showing where the marks go.