Ace GCSE
GCSEMocksProgressGCSE MathsAI revisionPricing

Free web sample

Try 30 questions here. The full topic has 111 questions in the app.

Download AceGCSE on the App StoreGet AceGCSE on Google Play
1 / 10

Computer Science · Representing Algorithms

Foundation

Look at this pseudocode: count ← 0 FOR i ← 1 TO 10 IF i MOD 3 = 0 THEN count ← count + 1 ENDIF NEXT i OUTPUT count What will be output?

Choose an answer — or press 1234