An algorithm will: • input 100 integer values, one value at a time • store the first value input into the first location of the array Number • store the next input value in the next unused location of the array Number • output the contents of Number array in the opposite sequence to that in which the values were input. Complete the program flowchart to represent the algorithm. Variable declarations are not required. START END

Mark scheme

Marking points from the official mark scheme (May/June 2025). The mark or mark type is shown in brackets.

1. [6] START SET Count To 1 Is Count = 101? (NO) -> INPUT Value INPUT Value -> Set Number[Count] To Value Set Number[Count] To Value -> Increment Count Increment Count -> Is Count = 101? (YES) Is Count = 101? (YES) -> Set Count To 100 Set Count To 100 -> Is Count = 0? (NO) -> OUTPUT Number[Count] OUTPUT Number[Count] -> Decrement Count Decrement Count -> Is Count = 0? (YES) Is Count = 0? (YES) -> END One mark for each functional group as listed: 1. Initialise Index used for Number to either 1 or 0 before first loop 2. Loop 100 times 3. 4. Input value Increment array index and store value in Number array at element referenced by array index in a loop 5. Output loop starts at last element in Number array 6. Output Number array element referenced by Index in a loop 7. Output all elements of Number array once in reverse order Max 6