0% found this document useful (0 votes)
6 views7 pages

OLevel Checklist Strategy

The document outlines a comprehensive 39-day study plan for O-Level subjects Mathematics, Physics, and Computer Science, with a focus on achieving top grades. It includes a detailed checklist of topics to cover, exam tips, and strategies for effective revision and practice. The plan emphasizes understanding concepts, targeted practice, and efficient note-taking methods to optimize study time leading up to the first exam on April 29, 2026.

Uploaded by

sameelbilalkhan
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
0% found this document useful (0 votes)
6 views7 pages

OLevel Checklist Strategy

The document outlines a comprehensive 39-day study plan for O-Level subjects Mathematics, Physics, and Computer Science, with a focus on achieving top grades. It includes a detailed checklist of topics to cover, exam tips, and strategies for effective revision and practice. The plan emphasizes understanding concepts, targeted practice, and efficient note-taking methods to optimize study time leading up to the first exam on April 29, 2026.

Uploaded by

sameelbilalkhan
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

O-LEVEL MASTER SYLLABUS CHECKLIST

Mathematics • Physics • Computer Science | 39-Day Sprint to A/A* | First Exam: 29 April

HOW TO USE THIS CHECKLIST

■ Untouched — not started / (slash) In progress — lectures watched / notes read ✓ Done — fully revised + at least 5
past-paper questions attempted ★ Mastered — can solve exam questions without any hints

■ COMPUTER SCIENCE (0478 / 2210)


1. Data Representation 6. Automated & Emerging Technologies
Binary, denary & hexadecimal number systems Automated systems (sensors → microprocessor → actuator)
Binary addition & overflow Artificial intelligence: machine learning, neural networks
Two's complement (negative numbers) Robotics
Binary shifts (left/right) Expert systems
Text: ASCII & Unicode 7. Algorithm Design & Problem Solving
Images: pixels, resolution, colour depth, file size Decomposition, abstraction, pattern recognition
Sound: sampling rate, sample resolution, file size Flowchart symbols & construction
Lossless vs lossy compression Pseudocode conventions (CAIE style)
Run-length encoding (RLE) Trace tables
2. Data Transmission Linear search
Serial vs parallel transmission Binary search
Simplex, half-duplex, full-duplex Bubble sort
USB, Ethernet, Wi-Fi, Bluetooth (characteristics) Identifying & fixing logic/syntax/runtime errors
Parity bits (odd/even) 8. Programming
Checksum Variables, constants, data types
Echo check Input/Output
Encryption: symmetric vs asymmetric Sequence, selection (IF/ELSE/CASE)
SSL/TLS basics Iteration: FOR, WHILE, REPEAT…UNTIL
3. Hardware Arrays (1D and 2D)
CPU components: ALU, CU, registers (PC, MAR, MDR, ACC) Procedures & functions (with/without parameters)
Fetch-decode-execute cycle String handling functions (LENGTH, SUBSTRING, etc.)
Clock speed, cores, cache — effect on performance File handling (open, read, write, close)
Primary memory: RAM vs ROM Library routines & built-in functions
Secondary storage types & characteristics 9. Databases
Virtual memory Flat-file vs relational database
Input devices (scanner, microphone, etc.) Tables, fields, records, primary key
Output devices (actuator, LCD, etc.) SQL: SELECT … FROM … WHERE … ORDER BY …
Sensors & their uses SQL: AND/OR in queries
4. Software Data validation vs data verification
System software vs application software DBMS advantages
Operating system functions 10. Boolean Logic
Utility software examples AND, OR, NOT gates — truth tables
High-level vs low-level languages NAND, NOR, XOR gates
Compiler vs interpreter vs assembler Constructing logic circuits from expressions
IDE features (editor, debugger, translator) Writing Boolean expressions from circuits
5. The Internet & its Uses Simplifying expressions using Boolean algebra
Internet vs World Wide Web
IP addresses (IPv4/IPv6), MAC address
DNS — how domain names resolve
HTTP vs HTTPS
HTML basics (tags, hyperlinks)
Cloud storage & cloud computing
Cookies
Cyber security threats: malware types, phishing, pharming,
brute-force
Firewall, anti-malware, authentication methods
Digital certificates

■ Computer Science (0478 / 2210) EXAM TIPS


Always show working in conversions (binary ↔ hex ↔ denary). In pseudocode questions write EXACTLY to CAIE
conventions — no Python/Java syntax. Trace tables: use one column per variable, fill row-by-row. SQL: memorise SELECT,
FROM, WHERE, ORDER BY, AND/OR — practice 3+ past papers of SQL. Definitions = easy marks; learn key terms
word-for-word (e.g. 'sampling rate', 'pixel'). Logic gates: draw truth tables for every gate from scratch until automatic.
■ MATHEMATICS (0580)

1. Number 5. Transformations & Vectors


Types of numbers (natural, integer, rational, irrational, real) Reflection (mirror line)
HCF & LCM Rotation (centre, angle, direction)
Powers, roots & indices laws Translation (column vector)
Standard form (scientific notation) Enlargement (centre, scale factor, negative SF)
Fractions, decimals, percentages — conversion & calculation Vector notation, addition, subtraction
Ratio & proportion Scalar multiplication of vectors
Percentage increase/decrease, reverse percentage Column vectors & position vectors
Rounding: decimal places & significant figures Magnitude of a vector
Estimation & bounds (upper/lower) 6. Probability
Surds — simplifying & rationalising Probability scale (0 to 1)
2. Algebra Theoretical vs experimental probability
Simplifying, expanding, factorising expressions Mutually exclusive events (addition rule)
Solving linear equations & inequalities Independent events (multiplication rule)
Simultaneous equations (elimination & substitution) Tree diagrams
Quadratic equations (factorising, formula, completing the Venn diagrams (union, intersection, complement)
square) Conditional probability
Sequences: nth term (linear & quadratic)
7. Statistics
Indices & algebraic fractions Mean, median, mode, range
Inequalities on number line & region shading Mean from frequency table
Function notation, composite & inverse functions Frequency polygons & histograms
3. Graphs Cumulative frequency curves
Coordinates in all four quadrants Median, quartiles & IQR from cumulative frequency
Straight-line graphs: y = mx + c Box-and-whisker plots
Gradient & y-intercept from equation/graph Scatter diagrams & correlation
Parallel & perpendicular lines Line of best fit
Quadratic curves (parabolas) Pie charts
Cubic, reciprocal & exponential graphs
8. Matrices & Sets
Distance-time & speed-time graphs Set notation: ∈, ⊂, ∩, ∪, A' etc.
Gradient as rate of change Venn diagrams for sets
Area under a speed-time graph Matrix addition & subtraction
4. Geometry & Mensuration Matrix multiplication
Angle properties (parallel lines, polygons, circles) Determinant & inverse of 2×2 matrix
Congruence & similarity — areas/volumes ratio Using matrices for transformations
Perimeter & area: triangle, quad, circle, sector
Surface area & volume: cuboid, prism, cylinder, cone, sphere
Pythagoras' theorem
Trigonometry: sin, cos, tan in right-angled triangles
Sine rule & cosine rule
Area of triangle = ½ab sinC
Circle theorems (all 8)
Arc length & sector area

■ Mathematics (0580) EXAM TIPS


Show ALL working — even if answer is wrong, method marks save you. Circle theorems: write the theorem name next to
every angle you use. Simultaneous equations: always check by substituting back. Vectors: write in column form unless
question uses i/j notation. Statistics: cumulative frequency — plot at UPPER CLASS BOUNDARY. Functions: f■¹(x) swap x
and y then rearrange. Read the question — 'exact form' means leave surds/π in the answer.
■ PHYSICS (0625 / 5054)

1. Motion, Forces & Energy 5. Electricity & Magnetism


Speed, velocity, acceleration (definitions & equations) Static electricity — charging by friction/induction
Distance-time and velocity-time graphs Electric field lines
SUVAT / kinematic equations Current, voltage, resistance (I, V, R)
Newton's First, Second, Third Laws Ohm's Law (V = IR)
Weight = mass × g Series & parallel circuits
Friction & air resistance Power (P = IV = I²R = V²/R)
Resultant force & equilibrium Electrical energy (E = Pt)
Momentum (p = mv) & conservation Internal resistance (EMF = V + Ir)
Work done (W = Fd), energy, power Semiconductor diode — IV characteristic
Kinetic & potential energy; conservation LDR & thermistor
Efficiency Magnetic fields — direction & representation
Pressure (P = F/A); pressure in fluids Electromagnetic induction (Faraday's law)
Moments & principle of moments Lenz's Law
Centre of gravity Transformer (Vp/Vs = Np/Ns)
Hooke's Law (F = kx) Motor effect (F = BIL)

2. Thermal Physics Fleming's left/right hand rules


Kinetic model of matter (solids, liquids, gases) 6. Nuclear Physics
Brownian motion Atomic structure (proton, neutron, electron)
Temperature, heat & internal energy Nuclide notation (mass number, atomic number)
Specific heat capacity (Q = mc∆T) Isotopes
Specific latent heat (Q = mL) Alpha, beta, gamma — nature, penetration, ionisation
Gas laws (P, V, T relationships) & pV/T = constant Half-life (definition, calculation)
Conduction, convection, radiation Background radiation
Evaporation vs boiling Nuclear fusion vs fission

3. Waves Uses & hazards of radioactivity


Wave properties: amplitude, frequency, wavelength, speed 7. Space Physics (if on syllabus)
v = fλ Solar system structure
Transverse vs longitudinal waves Stars — life cycle
Reflection, refraction, diffraction Redshift & expanding universe
Snell's Law & total internal reflection Big Bang theory evidence
Critical angle
EM spectrum (order, properties, uses)
Sound waves — speed, pitch, loudness
Ultrasound applications

4. Light & Optics


Reflection at plane mirrors
Refraction — bending towards/away normal
Converging & diverging lenses
Ray diagrams for lenses
Image types (real vs virtual, magnification)

■ Physics (0625 / 5054) EXAM TIPS


Every numerical answer: write the formula → substitute values → calculate. Units are mandatory — lost marks for missing
units. Practical questions: name the independent variable, dependent variable, control variables. Graphs in practicals:
always start at origin unless data says otherwise; label axes with units. Half-life: practise reading from decay graphs — count
where N halves. Transformer & motors: apply Fleming's rules with clear finger labelling. Waves: sketch a transverse wave to
remind yourself of amplitude vs wavelength.
■ 39-DAY STRATEGY GUIDE

PHASE 1 — Rapid Syllabus Pass (Days 1–18)

Goal: Cover every topic at least once. Do NOT try to memorise everything — just understand it.
• Morning (2–3 hrs): Math or Physics — watch lecture, skim your notes, do 5 textbook questions per chapter.
• Evening (1.5–2 hrs): Computer Science — same approach.
• Use this checklist: tick '/' when you finish a topic.
• NO full past papers yet — only targeted chapter exercises.
• Notes advice: Do NOT copy out long notes. Instead write a half-page 'cheat sheet' per chapter with formulas, key terms,
and 1–2 worked examples. This forces you to think and saves time.

PHASE 2 — Topic Drilling (Days 19–28)

Goal: Hammer weak topics identified in Phase 1.


• Use past paper topic-by-topic questions (Cambridge has these organised by topic).
• Do 10–15 questions per weak topic, mark immediately, note error types.
• Keep a dedicated 'Mistakes Notebook': write the wrong answer, the correct method, and WHY you went wrong.
• CS: Practise pseudocode and trace tables every single day — these are high-mark questions.
• Math: Practise circle theorems, vectors, and quadratics daily — biggest A* discriminators.
• Physics: Practise all formula-based calculations with unit conversion.

PHASE 3 — Full Past Paper Mode (Days 29–39)

Goal: Exam stamina, timing, and confidence.


• Do ONE full past paper per day (rotate subjects: Math → Physics → CS → repeat).
• Strictly timed — use a stopwatch. No extra time.
• Mark using official mark schemes immediately after.
• Spend 30 min reviewing every wrong/missed answer — don't just read the solution, redo it.
• Identify recurring mistakes and revisit your cheat sheets.
• Night before exam: only review your cheat sheets and formula list. NO new material.

DAILY SCHEDULE (Ramadan/Exam Season Optimised)

Suhoor → Light review of previous day's cheat sheet (15 min).


Morning (9–12): Main heavy subject (Math or Physics). Deep focus — phone in another room.
Afternoon (after Dhuhr): Rest / light reading — no heavy study during energy dip.
Evening (after Asr, ~4–6 PM): CS session or topic drilling.
After Iftar (8–9:30 PM): Past paper OR cheat sheet review.
Phone strategy: Delete social media apps. Keep phone in a different room during study blocks. Check it only during fixed
break times.
Post-meal sluggishness: After Iftar, take a 20-min walk or do light stretches before sitting down to study.
NOTES STRATEGY — Should You Copy Notes?

SHORT ANSWER: NO — do not copy out full notes. It wastes time and is passive learning.

DO THIS INSTEAD:
• Read your existing notes/lectures. Understand the concept.
• On a single page (or index card), write: formula / definition / key rule / 1 example.
• This 'cheat sheet' system means you create only what you don't know yet.
• For CS definitions: write the term on front of card, definition on back — test yourself.
• For Math: write all formulas + one worked example per topic on one A4 sheet.
• For Physics: same as Math. Add diagrams (ray diagrams, circuit diagrams) as mini sketches.
• Review cheat sheets every 3 days. The act of making and reviewing them = revision.

Prepared for Sameel — O-Level Sprint 2026 | First exam 29 April | Inshallah A/A* in Mathematics, Physics & Computer Science

You might also like