Scribd
Upload
4 views3 pages

Algorithm Basics

An algorithm is a defined sequence of steps to solve a problem, which can be expressed using structured English, pseudocode, or flowcharts. Structured English uses natural language and logic structures, while pseudocode follows specific syntax and resembles programming languages. Flowcharts visually represent algorithms using standard symbols to illustrate the flow of control, and identifier tables help track variable names and ensure consistent naming in pseudocode.

Uploaded by

haileymwenye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views3 pages

Algorithm Basics

An algorithm is a defined sequence of steps to solve a problem, which can be expressed using structured English, pseudocode, or flowcharts. Structured English uses natural language and logic structures, while pseudocode follows specific syntax and resembles programming languages. Flowcharts visually represent algorithms using standard symbols to illustrate the flow of control, and identifier tables help track variable names and ensure consistent naming in pseudocode.

Uploaded by

haileymwenye
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Algorithm Basics

Definition of algorithm
What is an algorithm?
• An algorithm is a solution to a problem expressed as a sequence of defined steps
• Methods of writing an algorithm before attempting to program a solution include:
o Structured English
o Pseudocode
o Flowcharts

Structured English

• Structured English is a human-readable method for describing algorithms using a


combination of natural English language and programming logic
o It uses clear English phrases to describe each step
o Logic structures like IF...THEN, REPEAT, and WHILE may appear, but
without strict syntax rules
o Often used in the early planning stages before converting to pseudocode

Ask the user to enter their age


If the age is 18 or over
→ Display a welcome message
Otherwise
→ Display an access denied message
Pseudocode

• Pseudocode is a precise, structured, and language-independent way of describing an


algorithm that resembles a programming language
• It follows specific exam-board-defined syntax
o It includes formal elements like IF, THEN, ELSE, WHILE, REPEAT, DECLARE,
and ← for assignment
o Students must follow CIE’s pseudocode format in exams

INPUT Age
IF Age >= 18 THEN
OUTPUT "Welcome to the site"
ELSE
OUTPUT "Sorry, this site is for users 18 and over"
ENDIF
Flowcharts

• Flowcharts are a visual tool that uses shapes to represent different


functions to describe an algorithm
• Used to visualise the flow of control in a system
• Standard symbols include:
o Oval for Start/End
o Parallelogram for Input/Output
o Rectangle for Processes
o Diamond for Decisions
• Arrows show the sequence of operations

Identifier tables
What is an identifier table?

• An identifier table is used when writing pseudocode to keep track of all


the identifier names used in an algorithm
• An identifier is the name given to a variable, constant, array, procedure,
or any other named element in the pseudocode

Why use an identifier table?

• It helps you stay organised when designing an algorithm


• Ensures consistent naming
• Makes it easier to understand what each identifier stores or does
• Useful in exam questions when you are asked to declare variables clearly

Identifier naming rules

• Must start with a letter (A–Z or a–z)


• Can include letters, digits (0–9), and underscores (_)
• Accented characters and symbols are not allowed
• Identifiers are case insensitive (e.g. Total and total are treated the same)
Identifier Description
StudentName Stores a student’s full name
TestScore Holds a test score value
MAX_SCORE Maximum score allowed
FormList Stores names in a form group

You might also like