CIE Pseudocode Interpreter

Basic I/O

Hello World

Simple output statement

Input and Output

Getting user input and displaying output

Variables & Data Types

Variable Declarations

Declaring variables of different types

Constants

Using constants for fixed values

Operators

Arithmetic Operators

Basic math operations

Comparison & Logic Operators

Boolean operations and comparisons

Selection (IF/CASE)

IF-THEN-ELSE

Conditional branching

CASE Statement

Multiple choice selection

Loops

FOR Loop

Count-controlled iteration

FOR Loop with STEP

FOR loop with custom increment

WHILE Loop

Pre-condition loop

REPEAT-UNTIL Loop

Post-condition loop

Arrays

1D Array

Working with one-dimensional arrays

2D Array

Working with two-dimensional arrays

Procedures & Functions

Procedure

Defining and calling procedures

Function

Defining and using functions

Recursive Function

Factorial using recursion

Built-in Functions

String Functions

LENGTH, RIGHT, MID, LCASE, UCASE

Numeric Functions

INT, RAND

IGCSE Exam-Style Questions

Finding Maximum

Find the maximum value in an array

Linear Search

Search for a value in an array

Counting Occurrences

Count how many times a value appears

Validating Input

Keep asking until valid input received

READ/PRINT Commands

IGCSE alternative to INPUT/OUTPUT

Calculate Average

Calculate mean of array values

Simple Menu System

Menu-driven program with options

Finding Minimum

Find the minimum value in an array

A-Level Topics

User-Defined Type (Record)

Define and use a record type

File Handling

Read and write text files

Bubble Sort

Sort an array using bubble sort

A-Level ADTs - Stack

Stack (PUSH/POP)

Stack implementation with LIFO operations

A-Level ADTs - Queue

Queue (ENQUEUE/DEQUEUE)

Queue implementation with FIFO operations

A-Level ADTs - Linked List

Linked List Node

Linked List node with pointer type

A-Level Algorithms

Binary Search

Efficient search in sorted array

Insertion Sort

Efficient for small/nearly sorted data

A-Level Recursion

Fibonacci Sequence

Recursive Fibonacci calculation

Binary Search (Iterative)

Iterative binary search implementation

Factorial (Recursive)

Calculate factorial using recursion

A-Level OOP Concepts

Class Definition

Object-oriented programming with classes

Record Type (Structure)

User-defined record type

Press Tab to indent • Interactive input modeTab to indent

Pseudocode Editor

Console(Interactive I/O)

Output will appear here... Click Run to execute your code.