01
CHOOSE THE APPROACH
INSIDE EVERY ROUTELesson objective + Skill Check
Decide what algorithm or technique the problem actually requires before writing pseudocode.
CS
Computer Science
CAIE · IAL · A Level
Understanding someone else’s code is easier thanwriting your own.
Learn how to move from understanding the logic to tracing it, debugging it and writing solutions yourself.
AS Computer ScienceInformation representation, networking, hardware, programming, databases
A2 Computer ScienceAlgorithm design, data structures, OOP, system software, security
Live availableScheduled group teaching with recorded access
Open the course, not a brochure
Select a chapter. Watch the lesson. Try the Skill Check.
The full course route is visible below. Click any chapter to load the lesson, then move through the four-step sequence.
HOW ZAIN READS A COMPUTER SCIENCE QUESTION
Before solving, find the five things hidden inside the question.
A syllabus tells you what can be examined. The paper decides how algorithms are combined, which data structure matters, and what implementation earns the mark.
01
The algorithmWhich approach does the question require?02
The data structureWhat structure fits the data?03
The implementationWhat code or pseudocode must be shown?04
The checkHow do you verify the answer?05
The answerWhat form does the examiner expect?01 / THE ALGORITHM
The right approach is not always the obvious one.
A question that looks like recursion may need iteration. A question about efficiency may need a different data structure first. Read the constraints before reaching for a pattern.
02 / THE DATA STRUCTURE
The structure determines the solution shape.
Arrays, linked lists, stacks, queues, and trees each serve different access patterns. Choose the wrong one and the algorithm cannot work efficiently.
03 / THE IMPLEMENTATION
Pseudocode must be precise enough to run.
The examiner reads pseudocode as if executing it. Missing initialisations, wrong loop bounds, and unclear variable names all cost marks.
04 / THE CHECK
Trace through the solution before moving on.
A trace table or dry run catches off-by-one errors, infinite loops, and boundary failures. The examiner expects evidence that the solution was tested mentally.
05 / THE ANSWER
Match the output to the question format.
Some questions ask for pseudocode, some for a diagram, some for a written explanation. Giving the right answer in the wrong form loses marks.
ORIGINAL PRACTICE QUESTION
[4]Write pseudocode for a binary search algorithm that returns the index of a target value in a sorted array, or returns -1 if the value is not found. [4 marks]
PLAUSIBLE, BUT INSUFFICIENT WORKING
A linear search that checks every element.
A MORE EXACT ANSWER
A binary search with low, high, mid pointers that halves the search space each iteration, returning the correct index.
The better answer is not valuable because it runs faster. It shows the student understood why binary search is the correct choice and can implement it step by step.
FROM READING TO BUILDING
Recognising the algorithm is easier than implementing it.
Choose the approach, pick the right data structure, trace the logic and then build the solution without the answer sitting beside you.
02
PICK THE STRUCTURE
BUILT INTO PRACTICEWorked examples + worksheets
Choose the data structure that fits how the data needs to be stored, accessed and changed.
03
TRACE THE LOGIC
VISIBLE AFTER ATTEMPTPast-paper questions + corrections
Dry-run the solution and catch loop, boundary and variable errors before they become the final answer.
04
WRITE THE SOLUTION
CONNECTED TO NEXT STEPRevision resources + return
Turn the idea into precise pseudocode or code without relying on a worked example beside you.
Zain Merchant · Computer Science
Zain teaches Computer Science as problem-solving, not just theory.
His course is built around a recurring problem: a student can recall the algorithm, remember the theory, and still lose the mark through weak implementation, missing trace work, or a generic explanation.
The standard
Progress is not recognising an algorithm. It is being able to choose it, trace it, implement it and explain why it works.
01Theory and Architecture
Understand how processors, memory, logic gates, and system architecture work together to execute programs.
02Programming and Problem Solving
Learn to translate problems into structured pseudocode and working programs — then test them under exam conditions.
03Data and Databases
Model data correctly using normalisation, entity-relationship diagrams, and SQL with the precision the mark scheme expects.
Student messages published by Alt
The Computer Science has to work after the explanation ends.
"
CS · A Level
Hands down all I could ask for in one place. Amazing teachers and an amazing journey for sure. Keep up the amazing work and keep helping us students out.
"
CS · Platform
I had no teacher, no one to advise on how to approach papers. Alt was there. The lectures are a godsend. I got no one to thank other than this platform.
"
CS · Course progress
The help I have received is unparalleled. I studied for my A Levels at home due to personal financial reasons.
01Can I self-study A Level Computer Science with this course?
The route is designed for independent study: teaching, chapter notes, Skill Checks, worksheets, revision resources, and past-paper support are connected in sequence. The student still has to attempt the work and return to mistakes.
02Does every chapter include more than video?
Yes. The product route connects focused lessons with checks, notes, worksheets, questions, and corrections. Exact resource coverage can vary by chapter, so the course player should remain the source of truth.
03What is the difference between Solo Monthly and Solo Exam Pass?
Both cover one subject. Monthly is billed one month at a time and does not require a fixed sitting. Exam Pass is one payment for access through one named sitting.
04When does All Access make more sense?
When the student needs two or more of the included A Level subjects. It covers the full included set and can be selected as Monthly or a sitting-specific Exam Pass.
05Do I buy Recorded again with Live?
No. Matching recorded Computer Science access is included in the Live plan. The cart deliberately keeps one plan at a time so the student is not charged twice.
06Does the course teach programming technique specifically?
Yes. Programming is taught as a skill throughout — not just as isolated exercises. The course practises structured pseudocode and implementation using the terminology and depth the 9618 mark scheme rewards.