Computer Science 2210 : Olevel : Full Course

Cambridge O-Level Computer Science 2210 Syllabus Overview

The syllabus is divided into two papers:

Paper 1 – Theory (Typically 2 hours)

Paper 1 tests the student’s understanding of fundamental concepts of computer science. It includes multiple-choice, structured, and short-answer questions.

1. Data Representation

• Binary, decimal, and hexadecimal systems.

• Conversion between number systems.

• Binary addition, subtraction, multiplication, and division.

• Representation of characters (ASCII, Unicode).

• Representation of images, sound, and instructions.

• Concept of data compression and encryption.

2. Communication and Internet Technologies

• Computer networks: LAN, WAN, PAN, MAN.

• Network topologies: star, bus, ring.

• Protocols: HTTP, FTP, SMTP, POP, IMAP.

• Wireless technologies: Wi-Fi, Bluetooth, infrared.

• Internet services and uses.

• Client-server and peer-to-peer models.

3. Hardware and Software

• Input, output, storage devices.

• Types of memory: ROM, RAM, cache, virtual memory.

• CPU: ALU, control unit, registers.

• Operating systems: types and functions.

• Utility software vs application software.

4. Security

• Threats: viruses, malware, hacking, phishing.

• Security methods: authentication, encryption, firewalls, backups.

5. Algorithms and Programming

• Algorithms: flowcharts, pseudocode.

• Programming concepts: variables, constants, operators.

• Control structures: sequence, selection, iteration.

• Functions, procedures, and modular programming.

• Recursion and arrays.

• Sorting and searching algorithms (bubble sort, insertion sort, linear and binary search).

6. Databases

• Database concepts: tables, records, fields.

• Primary and foreign keys.

• Queries: SQL basics (SELECT, INSERT, UPDATE, DELETE).

• Normalization basics.

7. Problem Solving

• Steps in problem-solving.

• Decomposition and abstraction.

• Testing and debugging methods.

• Understanding specification and requirements.

Paper 2 – Practical (Typically 2 hours)

Paper 2 tests the ability to apply practical skills in programming and problem-solving. Students are given tasks to implement, usually in a high-level language like Python, Java, or pseudocode.

1. Programming

• Writing programs to solve problems.

• Using variables, constants, and data types effectively.

• Implementing control structures: IF…ELSE, loops (FOR, WHILE).

• Creating functions and procedures.

• Using arrays and records (lists and dictionaries in Python).

• File handling basics: reading and writing text files.

2. Algorithm Implementation

• Translating algorithms from pseudocode or flowcharts into programs.

• Implementing searching and sorting algorithms.

• Debugging and testing programs.

• Writing modular code for readability and reuse.

3. Problem Solving in Practice

• Understanding problem statements.

• Designing solutions: flowcharts, pseudocode.

• Implementing solutions in code.

• Producing correct output for given input.

• Handling exceptions and errors.

4. Data Representation and Manipulation

• Inputting, processing, and outputting data correctly.

• Converting numbers or text as required.

• Performing calculations and data manipulations.

Key Notes

• Paper 1 focuses on knowledge, understanding, and explanation.

• Paper 2 focuses on practical skills and application of programming.

• Both papers complement each other; theory knowledge supports practical work.