The Cambridge O Level Computer Science (2210) syllabus is designed to introduce
students to the theoretical and practical aspects of computer science. It covers problem-
solving, programming, data representation, and computer systems fundamentals.
Syllabus Overview
1. Theory of Computer Science
Data Representation
o Binary, hexadecimal, and denary number systems
o Data encoding (ASCII, Unicode, images, sound)
o Data storage (units, compression)
Communication & Internet Technologies
o Networking (LAN, WAN, protocols, IP/MAC addresses)
o Internet & cybersecurity (encryption, firewalls, phishing)
Hardware & Software
o Input/output devices, storage, and sensors
o Operating systems, utility software, and compilers/interpreters
Security & Ethics
o Cyber threats (malware, hacking)
o Digital privacy, copyright, and ethical issues
Algorithm Design & Problem-Solving
o Flowcharts, pseudocode
o Algorithm efficiency (searching & sorting algorithms)
2. Practical Problem-Solving & Programming
Programming Concepts
o Variables, data types, operators
o Control structures (loops, conditionals)
o Functions, arrays, and file handling
Programming Languages
o Typically Python (though other languages may be used)
o Writing, testing, and debugging code
Databases
o SQL queries (SELECT, INSERT, UPDATE, DELETE)
o Database design (primary keys, normalization)
Assessment Structure
Paper Format Marks Duration
Paper
Theory (short & structured questions) 75 1h 45m
1
Paper
Problem-solving & programming (Python/SQL tasks) 75 1h 45m
2
Exam Preparation Tips
✔ Practice past papers (available on the Cambridge website)
✔ Understand pseudocode & flowchart logic
✔ Master Python basics (loops, functions, file handling)
✔ Revise SQL commands (SELECT, WHERE, JOIN)
✔ Learn binary/hex conversions
Would you like specific topic notes or past paper solutions? 😊
Computer Science (2210)
Notes
Here are some concise O Level Computer Science (2210) notes organized by key
topics to help you prepare effectively:
1. Data Representation
Binary & Hexadecimal:
o Binary ↔ Decimal conversions (use place values).
o Hex digits (0-9, A-F); 1 hex digit = 4 binary digits (nibble).
Data Storage Units: Bit → Byte → KB → MB → GB → TB.
Text Representation:
o ASCII (7-bit for 128 chars) vs. Unicode (16-bit, supports emojis/languages).
Images:
o Pixels, resolution, color depth (bits per pixel).
o File size = width × height × color depth (in bits).
Sound:
o Sampling (sample rate, bit depth), file size = rate × depth × duration.
2. Hardware & Software
CPU Components:
o ALU (calculations), CU (instructions), registers (e.g., PC, ACC).
o Fetch-Decode-Execute cycle.
Storage:
o Primary: RAM (volatile), ROM (non-volatile, stores BIOS).
o Secondary: HDD (magnetic), SSD (flash), optical (CD/DVD).
Software:
o System Software: OS (e.g., Windows), utilities (disk cleanup).
o Application Software: Word processors, browsers.
3. Networks
Types:
o LAN (local, e.g., school) vs. WAN (global, e.g., internet).
Topologies:
o Star (central switch, reliable) vs. Bus (single cable, cheap).
Protocols:
o HTTP (web), FTP (file transfer), TCP/IP (data routing).
Security:
o Firewalls, encryption, strong passwords.
4. Algorithms & Programming
Pseudocode Basics:
o Input/output (INPUT, PRINT), loops (FOR, WHILE), conditionals (IF).
Flowcharts:
o Symbols: oval (start/end), rectangle (process), diamond (decision).
Sorting Algorithms:
o Bubble sort (compares neighbors), insertion sort (builds sorted list stepwise).
Searching Algorithms:
o Linear (checks each item) vs. Binary (requires sorted data, halves search space).
5. Databases
Key Terms:
o Table (entities), record (row), field (column), primary key (unique ID).
SQL Basics:
sql
Copy
Download
SELECT name FROM Students WHERE age > 15;
INSERT INTO Students VALUES (101, 'Ali');
6. Internet & Cybersecurity
Threats:
o Malware, phishing, DDoS attacks.
Protection:
o Antivirus, biometrics, 2FA (two-factor authentication).
7. Ethics & Legislation
Laws:
o Data Protection Act (personal data privacy), Copyright Act (protects IP).
Impacts of Tech:
o Automation (job loss), AI (bias in algorithms).
Exam Tips:
1. Paper 1 (Theory): Focus on definitions (e.g., RAM vs. ROM) and scenarios (e.g.,
choosing a network topology).
2. Paper 2 (Problem-Solving): Practice writing pseudocode/flowcharts for
sorting/searching tasks.
3. SQL: Memorize basic commands (SELECT, INSERT, UPDATE).
Recommended Resources:
Book: "Cambridge O Level Computer Science" by David Watson.
Past Papers: Solve them on PastPapers.co .
Good luck! Revise actively by drawing mind maps or teaching concepts to others. 🚀
