You will see the pseudocode rules and the syllabus limits that save revision time. Attacking the 15 mark scenario question comes after.
How Is O Level Computer Science 2210 Assessed?
Two written papers, equally weighted, with no practical examination. Candidates answer on the question paper and every question is compulsory.
| Feature | Paper 1 Computer Systems | Paper 2 Algorithms, Programming and Logic |
|---|---|---|
| Duration | 1 hour 45 minutes | 1 hour 45 minutes |
| Marks | 75 | 75 |
| Weighting | 50 percent | 50 percent |
| Topics covered | Topics 1 to 6 | Topics 7 to 10 |
| Question style | Short answer and structured | Short answer, structured, plus a scenario |
| Calculators | Not allowed | Not allowed |
Note that last row very carefully indeed. Computer Science bans calculators in both of its papers, unlike Physics, Chemistry and Biology.
There is no coursework and no practical exam. The syllabus still expects real programming practice, because Paper 2 assumes it.
Both papers reward practice at a keyboard followed by writing by hand. Structured O Level classes in Lahore should include both activities weekly.
Programming access matters more here than in most subjects. Any Cambridge O Level qualification candidate needs a computer to practise on.
Why Does Writing Python Score Zero in Paper 2?
Because the syllabus states it directly and without hedging. Where a solution involves coding, candidates are required to write pseudocode.
Solutions written in programming code will not be awarded marks. That exact sentence appears in the syllabus without any qualification.
One single exception exists here, and only one. The final 15 mark scenario question accepts either pseudocode or program code.
Even there the language choice is restricted. Only Python, Visual Basic or Java are accepted, and other languages earn nothing.
So a confident C++ or JavaScript programmer scores zero on that question. Check your language before the exam, not after.
The reassuring half of the rule follows. Syllabus states that language syntax is not examined, because logic matters more than syntax.
Why Are Calculators Banned in Both Papers?
Because the arithmetic is deliberately part of the assessment. Number system work must be done by hand under time pressure.
That affects several question types directly. Binary and hexadecimal conversion, binary addition and logical shifts all appear without a calculator.
File size calculations are the hardest of these. You multiply resolution by colour depth, or sample rate by resolution by length.
One particular rule catches almost everybody out. Storage calculations must use 1024 rather than 1000, so a kibibyte is 1024 bytes.
The unit names follow that same binary convention as well. The syllabus uses kibibyte, mebibyte, gibibyte, tebibyte and pebibyte instead.
Mental arithmetic and powers of two therefore need daily drilling. Weak O Level Mathematics foundations cost real marks in this subject.
Which Ten Topics Split Across the Two Papers?
The syllabus divides cleanly into two separate halves. Each paper tests only its own half, which makes revision planning simple.
| No | Topic | Paper and Content |
|---|---|---|
| 1 | Data representation | Paper 1, binary, hexadecimal, two’s complement, sound, images |
| 2 | Data transmission | Paper 1, packets, methods, error detection, encryption |
| 3 | Hardware | Paper 1, CPU and the fetch decode execute cycle, storage, sensors |
| 4 | Software | Paper 1, operating systems, interrupts, translators, IDEs |
| 5 | The internet and its uses | Paper 1, web pages, cookies, digital currency, cyber security |
| 6 | Automated and emerging technologies | Paper 1, automated systems, robotics, artificial intelligence |
| 7 | Algorithm design and problem solving | Paper 2, flowcharts, trace tables, validation, test data |
| 8 | Programming | Paper 2, variables, loops, arrays, procedures, file handling |
| 9 | Databases | Paper 2, single table design, primary keys, SQL queries |
| 10 | Boolean logic | Paper 2, logic gates, truth tables, logic expressions |
Six topics sit in Paper 1 and four in Paper 2. Comparing that with your full O Level subject list helps you balance the revision load.
What Do the Two Papers Actually Test?
The assessment objectives split very differently across the two papers. That difference should reshape how you prepare for each one.
| Assessment Objective | Overall | Paper 1 | Paper 2 |
|---|---|---|---|
| AO1 Knowledge and understanding | 40 percent | 60 percent | 20 percent |
| AO2 Applying to a given context | 40 percent | 20 percent | 60 percent |
| AO3 Solutions, judgements, conclusions | 20 percent | 20 percent | 20 percent |
Paper 1 is knowledge led, so recall and precise terminology carry it. Paper 2 is application led and rewards logic instead.
That is why memorising Paper 2 answers fails completely. Every scenario is new, so the method has to be practised rather than recalled.
Which Pseudocode Conventions Must You Follow?
Cambridge publishes exactly how pseudocode appears in its own papers. Matching those conventions makes your intention unmistakable to any examiner.
| Convention | Official Requirement |
|---|---|
| Keywords | Written in upper case, such as IF, REPEAT and PROCEDURE |
| Identifiers | Mixed case starting with a capital letter, such as FirstName |
| Identifier characters | Letters and digits only, never underscores or accents |
| Assignment | A left pointing arrow, never an equals sign |
| Comments | Preceded by two forward slashes |
| Indentation | Four spaces, but only two for THEN, ELSE and CASE clauses |
| Data types | INTEGER, REAL, CHAR, STRING and BOOLEAN |
| Character literals | Single quotes, while strings use double quotes |
| Real numbers | At least one digit either side of the decimal point |
| Declarations | DECLARE, then the identifier, then the data type |
| Constants | CONSTANT with a literal value only, never a variable |
| Procedures | Called using CALL, which is never used for functions |
The three loop structures each have their own fixed ending. Use FOR with NEXT, REPEAT with UNTIL, and WHILE with ENDWHILE.
Precision in wording matters too. The syllabus accepts the symbol for greater than but rejects the words, so O Level exam preparation should drill notation.
Which Syllabus Limits Save You Revision Time?
This section is genuinely worth reading twice. Many students revise content that 2210 never examines, and these limits are published.
| Area | The Published Limit |
|---|---|
| Binary conversions | Maximum length of 16 bit |
| Binary addition and two’s complement | 8 bit integers only |
| Overflow | Occurs above 255 in an 8 bit register |
| Logic circuits | Maximum of three inputs and one output |
| Logic gates | NOT takes one input, every other gate takes two |
| Drawing circuits | Drawn exactly as stated, without simplification |
| Nested statements | Never more than three levels required |
| Procedures and functions | Up to three parameters |
| Databases | Single table only, so no joins are needed |
| SQL commands | SELECT, FROM, WHERE, ORDER BY, SUM, COUNT, AND, OR |
| Search and sort methods | Linear search and bubble sort only |
| Test data types | Normal, abnormal, extreme and boundary |
Read the search and sort row again. Binary search, insertion sort and quick sort are simply not on this syllabus.
The database row saves similar time. Multi table joins and foreign keys are not examined, because designs are single table.
How Do You Answer the 15 Mark Scenario Question?
This single question is worth a fifth of Paper 2. Cambridge states that candidates should spend 30 minutes answering it.
It is always unseen and always draws on Topics 7 to 10. You write an algorithm for the context given.
- Read the whole scenario before writing anything, and underline every requirement
- Decide your language first, choosing pseudocode, Python, Visual Basic or Java
- List the inputs, processes and outputs before writing a single line
- Declare your variables and constants with meaningful identifiers
- Write the solution, using comments to signal each requirement you address
- Dry run it with a trace table to catch loop and boundary errors
Budget that time deliberately in advance. Thirty minutes of a 105 minute paper is a large and easily overrun share.
Practise the whole question under timing rather than in pieces. Regular timed O Level past papers build the stamina this question needs.
Which Command Words Appear in 2210 Papers?
Computer Science uses thirteen command words, which is a much smaller set than Chemistry. Two of them carry unusually heavy marks.
| Command Word | Official Meaning |
|---|---|
| State | Express in clear terms |
| Define | Give precise meaning |
| Give | Produce an answer from a source or from recall |
| Identify | Name, select or recognise |
| Describe | State the points of a topic or give main features |
| Outline | Set out the main points |
| Explain | Set out reasons and make relationships clear with evidence |
| Suggest | Apply knowledge where a range of valid responses exist |
| Compare | Identify or comment on similarities and differences |
| Calculate | Work out from given facts, figures or information |
| Show (that) | Provide structured evidence leading to a given result |
| Demonstrate | Show how or give an example |
| Evaluate | Judge the quality, importance, amount or value of something |
Explain and Evaluate carry the extended answers. Both need reasoning developed with because or therefore, not a list of features.
How Should You Prepare for Each Paper?
The two papers need genuinely different weekly routines. Treating them as one subject is the most common mistake in 2210.
| Element | Paper 1 Computer Systems | Paper 2 Algorithms and Logic |
|---|---|---|
| Core demand | Recall of precise terminology | Applying logic to new problems |
| Daily drill | Definitions and process descriptions | One algorithm written by hand |
| Weekly drill | Binary and file size calculations | One trace table and one truth table |
| Biggest risk | Vague terminology losing marks | Writing program code instead of pseudocode |
| Practice source | Topical questions on Topics 1 to 6 | Full Paper 2 attempts with the scenario |
Handwriting code matters because the exam is on paper. Candidates sitting private candidate O Level entries still need real programming practice.
What Is the 12 Week 2210 Study Plan?
This plan works through Paper 1 topics first, then Paper 2. Shift the dates so week 12 lands before your first paper.
| Weeks | Topic Focus | Paper | Checkpoint |
|---|---|---|---|
| Weeks 1 to 2 | Data representation and transmission | Paper 1 | Binary and hexadecimal done by hand |
| Weeks 3 to 4 | Hardware and software | Paper 1 | Fetch decode execute described accurately |
| Weeks 5 to 6 | Internet, security and emerging technologies | Paper 1 | Threats paired with correct solutions |
| Weeks 7 to 8 | Algorithm design and trace tables | Paper 2 | Trace tables completed without errors |
| Weeks 9 to 10 | Programming concepts and arrays | Paper 2 | Pseudocode written to convention |
| Week 11 | Databases and Boolean logic | Paper 2 | SQL and truth tables secure |
| Week 12 | Scenario question practice only | Paper 2 | Full 15 mark answers inside 30 minutes |
Week 12 practises one question type repeatedly by design. Fitting this into an O Level study timetable keeps other subjects moving alongside.
Which Mistakes Cost the Most Marks in 2210?
These appear across almost every weak Computer Science script. Every one of them is avoidable with the syllabus in hand.
- Writing program code where the syllabus requires pseudocode
- Choosing a language outside Python, Visual Basic and Java for the scenario
- Using 1000 instead of 1024 in data storage calculations
- Writing the words greater than instead of the mathematical symbol
- Learning binary search and quick sort, which are not examinable
- Overrunning the scenario question and leaving earlier questions unfinished
Grade thresholds for A star usually sit near 80 to 86 percent. Six marks lost to a rule is often the entire gap.
Rule based errors disappear fastest once someone marks the work. Students working to improve weak O Level grades should start with pseudocode conventions.
Algorithm logic needs teaching rather than more solved questions. A focused online academy for Cambridge students can rebuild trace tables within days.
Frequently Asked Questions
Can I Write Python in O Level Computer Science Paper 2?
Only in the 15 mark scenario question. Everywhere else the syllabus requires pseudocode, and program code earns no marks.
Which Programming Languages Are Accepted?
Python, Visual Basic or Java, and only in the scenario question. Solutions in any other language will not be awarded marks.
Are Calculators Allowed in Computer Science 2210?
No, they are banned in both papers. That differs from Physics, Chemistry and Biology, where calculators are permitted throughout.
How Many Marks Is the Scenario Question?
Fifteen marks, which is a fifth of Paper 2. It is always unseen and always drawn from Topics 7 to 10.
How Long Should I Spend on the Scenario Question?
Cambridge states 30 minutes for it. That leaves about 75 minutes for the rest of a 105 minute paper.
Is Programming Language Syntax Examined?
No. The syllabus states that syntax is not examined, and that in all cases the logic matters more.
Do I Need to Learn Binary Search or Quick Sort?
No. Standard methods are limited to linear search and bubble sort, along with totalling, counting and finding maximum values.
How Many Inputs Can a Logic Circuit Have?
A maximum of three inputs and one output. NOT takes a single input, and every other gate takes two.
Do Storage Calculations Use 1000 or 1024?
Always 1024, never 1000. The syllabus also uses kibibyte and mebibyte rather than the familiar kilobyte and megabyte.
Are Database Questions Multi Table?
No. Database work is limited to a single table, so joins and foreign key relationships are not examined.
Ready to Stop Losing 2210 Marks to the Rules?
Most Computer Science marks are lost to conventions rather than to weak logic. Thinkerzz Online Academy drills pseudocode to the exact Cambridge format and times your scenario answers. Trace tables get rebuilt live and 1 to 1. Book a Free Consultation to begin with a diagnostic paper.
