Kramizo
Log inSign up free
Home › CIE IGCSE Computer Science › Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs
CIE · IGCSE · Computer Science

Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs
Practice Questions

20 CIE IGCSE Computer Science questions on Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs, each with instant feedback and a full examiner-style mark scheme.

⚡ Start Quiz on Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs →📖 Read Revision Notes
✨ Revision guide includes key terms, worked examples and exam technique for Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs.

Try 2 sample questions on Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs

Question 1 · 1 mark · Difficulty 1/3

Which pseudocode construct is used to repeat a block of statements a fixed, known number of times?

  1. IF ... THEN ... ENDIF
  2. REPEAT ... UNTIL
  3. FOR ... TO ... NEXT
  4. WHILE ... DO ... ENDWHILE
Show answer & explanation
✓ Answer: C — FOR ... TO ... NEXT
A FOR...TO...NEXT loop is a count-controlled iteration used when the number of repetitions is known in advance. WHILE and REPEAT...UNTIL are condition-controlled loops used when the number of repetitions is not known. IF...THEN...ENDIF is a selection construct, not iteration.
Question 2 · 1 mark · Difficulty 1/3

In Cambridge IGCSE pseudocode, what is the purpose of the ENDIF keyword?

  1. It causes the program to skip back to the IF condition for re-evaluation
  2. It closes the innermost WHILE loop associated with the IF statement
  3. It terminates the ELSE block only, leaving THEN open
  4. It marks the end of the entire IF...THEN...ELSE selection construct
Show answer & explanation
✓ Answer: D — It marks the end of the entire IF...THEN...ELSE selection construct
ENDIF is used to close the complete IF selection construct, including any THEN and ELSE blocks. It does not loop back or selectively close only one branch. Every IF statement requires exactly one matching ENDIF.
⚡ Start a Quiz on Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs →
20 questions · 25 min · free

CIE IGCSE Computer Science: Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs FAQ

Is Kramizo free for CIE IGCSE students preparing for Computer Science?
Yes — completely free. Every student gets 45 questions a day on the free plan, with no card required and no trial countdown. That free quota works across every subject and every topic in our bank, so you can mix Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs practice with other Computer Science topics or even switch to a totally different CIE subject without paying anything. Kramizo's optional Pro plan removes the daily cap and adds detailed progress analytics, but the free tier is the real product — used by thousands of GCSE, IGCSE and CSEC students.
Are the Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs questions aligned to the official CIE IGCSE Computer Science syllabus?
Every question is written against the published CIE IGCSE Computer Science specification, including the exact command words (state, describe, explain, calculate, evaluate, etc.), mark allocations, and difficulty tier you'd see on a real CIE paper. Explanations are written in the style of official examiner mark schemes — they tell you what is being awarded marks and why distractors are wrong, not just whether you got it right. The bank is continually refined to match the latest syllabus updates from CIE.
How is Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs typically tested on CIE IGCSE Computer Science papers?
Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs appears across multiple question types on real CIE IGCSE Computer Science papers — most commonly as multiple-choice questions in the objective section, structured short-answer questions in the main paper, and occasionally as part of an extended response. Kramizo's practice bank reflects that mix: 4-option MCQs, true/false statements, fill-in-the-blank key terms, multi-select questions, and ordering questions. Working through the bank gives you exposure to every question style examiners actually use.

Lock in Algorithm design and problem-solving: pseudocode and flowcharts — sequence, selection and iteration constructs before exam day.

Start practising in 30 seconds — no card required.

⚡ Start Quiz Free →