A programmer writes the following pseudocode loop to sum all elements in a 1D array Nums of size 5 (indices 0 to 4). Which loop correctly traverses every element exactly once?
FOR counter ← ? TO ? DO
total ← total + Nums[counter]
NEXT counter

Q: How do I try a free CIE Computer Science question?

Just tap any of the four options on this page — no signup, no card, nothing to install. You'll see the correct answer and a full mark-scheme-style explanation within a second. Each visit shows a fresh randomly-picked question from the live CIE IGCSE Computer Science bank, so you can keep refreshing to try different ones before deciding whether to create a free account for daily access.

Q: Is Kramizo really free for CIE Computer Science students?

Yes — completely free. Every student gets 45 questions a day on the free plan, across any board and any subject, with no card required and no trial countdown. Kramizo's optional Pro plan removes the daily cap and adds analytics, but the free plan is genuinely free forever. We make money from the small percentage of students who choose to upgrade — not from selling data or ads.

Q: Are the Computer Science questions aligned to the CIE IGCSE syllabus?

Every question is written against the published CIE IGCSE Computer Science syllabus and reviewed for accuracy before being added to the bank. We match the command words (state, describe, explain, evaluate), mark allocations, and difficulty tier you'll see on real CIE past papers. Explanations are written in the style of official examiner mark schemes so students learn exactly what marks are being awarded for.

Question

A programmer writes the following pseudocode loop to sum all elements in a 1D array Nums of size 5 (indices 0 to 4). Which loop correctly traverses every element exactly once?
FOR counter ← ? TO ? DO
  total ← total + Nums[counter]
NEXT counter

Accepted Answer

FOR counter ← 0 TO 4 — With zero-based indexing and 5 elements, valid indices are 0, 1, 2, 3, 4 so the loop must run FOR counter ← 0 TO 4. Option A starts at 1, skipping index 0. Option C goes up to index 5 which is out of bounds. Option D skips both the first element (index 0) and accesses only up to index 4 but starts at 1, missing the first element.

Answer

FOR counter ← 1 TO 4

Answer

FOR counter ← 1 TO 5

Answer

FOR counter ← 0 TO 4

Answer

FOR counter ← 0 TO 5

One real Computer Science question.No signup. 30 seconds.

One real Computer Science question.
No signup. 30 seconds.