Algorithm and Flowcharts: JAMB Computer Studies Questions, Answers & Notes

What Algorithm and Flowcharts covers in the JAMB Computer Studies syllabus

An algorithm is a step-by-step procedure (an ordered set of instructions) for solving a problem, and a flowchart is a diagram that shows those steps using standard symbols. An algorithm can also be written as pseudocode — plain, English-like statements that are not a real programming language. Flowchart symbols include the oval (terminator, for start/stop), the rectangle (a process or action), the parallelogram (input or output), the diamond (a decision, a yes/no choice) and arrows or flow lines (which show the order and direction of the steps). A good algorithm must have a clear beginning and end (it must terminate), its steps must be in the correct order (sequence), and it must be unambiguous. Algorithms and flowcharts are prepared before writing the actual program, as a plan. The main point: an algorithm is a clear, ordered set of steps to solve a problem, and a flowchart shows those steps using symbols like the oval, rectangle, parallelogram and diamond.

For Algorithm and Flowcharts, JAMB expects you to be able to:

• Define an algorithm (ordered steps) and flowchart (diagram of steps); recall pseudocode
• Recall flowchart symbols (oval=start/stop, rectangle=process, parallelogram=input/output, diamond=decision, arrows=flow)
• Recall qualities of a good algorithm (clear start/end, correct order, unambiguous) and that it is planned before coding

Key facts & revision notes: Algorithm and Flowcharts

These are the recurring points our Algorithm and Flowcharts questions test — revise them until each feels automatic, then practise the questions above to lock them in.

• An algorithm is a step-by-step procedure (set of instructions) for solving a problem.
• A flowchart is a diagram that shows the steps of a solution using symbols.
• Pseudocode is an algorithm written in plain, English-like statements (not a real programming language).
• In a flowchart, the oval (terminator) shows the start or stop of the program.
• In a flowchart, the diamond shows a decision (a yes/no or true/false choice).
• In a flowchart, the rectangle shows a process (an action or calculation).
• In a flowchart, the parallelogram shows input or output.
• Arrows (flow lines) show the order and direction of the steps.
• A good algorithm must have a clear beginning and a clear end (it must terminate).
• The steps of an algorithm must be in the correct order (sequence).
• Algorithms and flowcharts are prepared before writing the actual program, as a plan.
• An algorithm must be unambiguous — each step clear and not open to confusion.
• An algorithm is a step-by-step procedure.
• A diagram of steps using symbols is a flowchart.
• Plain English-like steps are called pseudocode.
• The diamond shows a decision.
• The rectangle shows a process.
• The oval shows the start/stop.
• Arrows show the order of steps.
• The main point is that an algorithm is a clear, ordered set of steps to solve a problem, and a flowchart shows those steps using symbols like the oval (start/stop), rectangle (process), parallelogram (input/output) and diamond (decision).

Worked examples

Three Algorithm and Flowcharts questions with the answer and a short explanation, so you can see how the topic is set before you practise the full set.

How Algorithm and Flowcharts is tested in JAMB Computer Studies

Our Algorithm and Flowcharts bank holds 20 questions (4 easy, 10 medium, 6 hard). JAMB Computer Studies typically returns to Algorithm and Flowcharts year after year, so steady practice on this topic is high-value revision. Questions are multiple-choice with four options, and at UTME pace you get roughly 40 seconds each — which is why timed practice matters.

How to answer Algorithm and Flowcharts questions

Work the stem first and predict the answer before you look at the options; then eliminate the ones that contradict the key facts above. Watch for “which is not…”, “all of the above” and “except” style stems, which are where rushed candidates lose easy marks on Algorithm and Flowcharts. If a calculation or a precise definition is involved, work it from first principles rather than guessing from a half-remembered rule. When two options look right, re-read the stem for the qualifier that separates them — JAMB rarely repeats an option by accident. If you are still unsure, eliminate the two weakest choices to lift your odds, flag the question, and move on; never burn a full minute on one Computer Studies item when the exam gives you about forty seconds each. Then come back to flagged questions with whatever time remains. The single most reliable way to get faster at Algorithm and Flowcharts is repeated timed practice, so use the button above until the recurring patterns feel automatic.

Common mistakes to avoid in Algorithm and Flowcharts

The errors that cost marks on Algorithm and Flowcharts are usually careless rather than conceptual: misreading a negative stem, confusing two similar terms, or rushing a definition you actually know. Candidates also over-rely on “expo” and last-minute cramming instead of understanding the topic — which fails the moment JAMB rephrases a familiar idea. Treat every option as a claim to be checked against the facts above, keep your working tidy for any calculation, and don’t change a considered answer on a hunch. Above all, revise Algorithm and Flowcharts actively by answering questions, not just by re-reading notes — recall under time is what the exam rewards.

Frequently asked questions

Is Algorithm and Flowcharts part of the JAMB Computer Studies syllabus?

Yes. Algorithm and Flowcharts is a recognised topic in the JAMB Computer Studies syllabus, covering define an algorithm (ordered steps) and flowchart (diagram of steps); recall pseudocode. You should be able to recall its key facts and apply them to multiple-choice questions.

How many Algorithm and Flowcharts questions can I practise on Belmadeng?

There are 20 original, JAMB-standard Algorithm and Flowcharts questions in our free bank, each with the correct answer and a worked explanation. You can practise them untimed or as a timed test.

What are the most important points to know about Algorithm and Flowcharts?

An algorithm is a step-by-step procedure (an ordered set of instructions) for solving a problem, and a flowchart is a diagram that shows those steps using standard symbols. An algorithm can also be written as pseudocode — plain, English-like statements that are not a real programming language. Flowc…

How do I answer Algorithm and Flowcharts questions quickly in JAMB?

Read the stem carefully, eliminate clearly wrong options, and match the remaining choices to the key facts for Algorithm and Flowcharts. Practising timed Algorithm and Flowcharts questions builds the speed you need for UTME's pace of about 40 seconds per question.

Are these JAMB Computer Studies Algorithm and Flowcharts questions past questions or original?

They are original questions written to JAMB (UTME) standard and mapped to the official syllabus — not reproduced past papers. This keeps them legal to use freely while closely mirroring how the real exam tests the topic.

Where can I practise Algorithm and Flowcharts questions free without signing up?

Right here — tap “Start Algorithm and Flowcharts practice” on this page to begin instantly. Belmadeng's CBT practice is completely free and needs no sign-up, download or subscription.

About these questions: original, JAMB-standard items written from the official UTME Computer Studies syllabus (last reviewed 2026-09-18). Belmadeng is an independent study platform and is not affiliated with JAMB. Spotted an error? Use the report link.