Syllabus Overview

Course Information

Qualification: Cambridge IGCSE (9-1) Computer Science

Syllabus Code: 0984

Examination Years: 2026, 2027, 2028

Grading: Grades 9-1 (9 is the highest)

Topics
10
Core Topics
Papers
2
Written Exams
Duration
1:45
Each Paper

About This Course

Cambridge IGCSE Computer Science helps learners develop an interest in computational thinking and an understanding of the principles of problem-solving using computers. Students apply this understanding to create computer-based solutions to problems using algorithms and a high-level programming language.

Learners also develop a range of technical skills, and the ability to effectively test and evaluate computing solutions.

What You'll Learn

Computer Systems (Paper 1):

  • Data representation and binary systems
  • Data transmission and networking
  • Hardware components and architecture
  • Software types and operating systems
  • The internet and cyber security
  • Automated and emerging technologies

Algorithms, Programming and Logic (Paper 2):

  • Algorithm design and problem-solving
  • Programming concepts and techniques
  • Database design and SQL
  • Boolean logic and logic circuits

Skills You'll Develop

  • Computational thinking: Breaking down complex problems
  • Programming: Writing code in Python, VB.NET, or Java
  • Problem-solving: Using algorithms and logic
  • Analysis: Testing and evaluating solutions
  • Technical skills: Working with databases, networks, and systems

Computer Systems (Paper 1)

1. Data Representation

Number Systems:

  • ▶ Understanding binary, denary, and hexadecimal number systems
  • ▶ Converting between number systems (up to 16-bit binary)
  • ▶ Binary addition and understanding overflow errors
  • ▶ Logical binary shifts and their effects
  • ▶ Two's complement for representing negative numbers

Text, Sound and Images:

  • ▶ Character sets: ASCII and Unicode
  • ▶ Sound representation: sample rate and resolution
  • ▶ Image representation: pixels, resolution, and colour depth
  • ▶ Calculating file sizes for images and sound

Data Storage and Compression:

  • ▶ Units: bit, byte, KiB, MiB, GiB, TiB, PiB, EiB
  • ▶ Lossy compression (reducing quality)
  • ▶ Lossless compression (e.g., Run Length Encoding)
  • ▶ Purpose and impact of data compression
2. Data Transmission

Methods of Transmission:

  • ▶ Packet switching: headers, payloads, and trailers
  • ▶ Serial vs parallel transmission
  • ▶ Simplex, half-duplex, and full-duplex communication
  • ▶ Universal Serial Bus (USB)

Error Detection:

  • ▶ Parity checks (odd and even)
  • ▶ Checksum and echo check
  • ▶ Check digits (ISBN, barcodes)
  • ▶ Automatic Repeat Query (ARQ)

Encryption:

  • ▶ Symmetric encryption
  • ▶ Asymmetric encryption (public and private keys)
  • ▶ Purpose of encryption in data transmission
3. Hardware

Computer Architecture:

  • ▶ CPU components: ALU, Control Unit, registers
  • ▶ Fetch-Decode-Execute (FDE) cycle
  • ▶ Von Neumann architecture
  • ▶ Cores, cache, and clock speed
  • ▶ Embedded systems vs general-purpose computers

Input/Output Devices:

  • ▶ Input devices: scanners, keyboards, mice, touch screens
  • ▶ Output devices: printers, screens, speakers, actuators
  • ▶ Sensors: temperature, pressure, light, motion, etc.

Data Storage:

  • ▶ Primary storage: RAM and ROM
  • ▶ Secondary storage: magnetic, optical, solid-state
  • ▶ Virtual memory
  • ▶ Cloud storage
4. Software

Types of Software:

  • ▶ System software vs application software
  • ▶ Operating system functions
  • ▶ Hardware, firmware, and OS interaction
  • ▶ Interrupts and interrupt handling

Programming Languages and Translators:

  • ▶ High-level vs low-level languages
  • ▶ Assembly language and assemblers
  • ▶ Compilers vs interpreters
  • ▶ Integrated Development Environments (IDEs)
5. The Internet and Its Uses

Internet Fundamentals:

  • ▶ Difference between internet and world wide web
  • ▶ URLs, HTTP, and HTTPS
  • ▶ Web browsers and their functions
  • ▶ How web pages are located and displayed
  • ▶ Cookies: session and persistent

Digital Currency and Blockchain:

  • ▶ Understanding digital currency
  • ▶ Blockchain technology

Cyber Security:

  • ▶ Threats: malware, phishing, hacking, DDoS attacks
  • ▶ Protection: firewalls, encryption, authentication
  • ▶ Security best practices
6. Automated and Emerging Technologies

Automated Systems:

  • ▶ Sensors, microprocessors, and actuators working together
  • ▶ Applications: industry, transport, agriculture, weather
  • ▶ Advantages and disadvantages

Robotics:

  • ▶ Characteristics of robots
  • ▶ Applications in various fields
  • ▶ Benefits and risks

Artificial Intelligence:

  • ▶ Expert systems
  • ▶ Machine learning
  • ▶ AI characteristics and applications

Algorithms, Programming and Logic (Paper 2)

7. Algorithm Design and Problem-Solving

Program Development:

  • ▶ Analysis: identifying requirements
  • ▶ Design: structure diagrams, flowcharts, pseudocode
  • ▶ Coding: writing and testing program code
  • ▶ Testing: using test data effectively

Standard Algorithms:

  • ▶ Linear search
  • ▶ Bubble sort
  • ▶ Totalling and counting
  • ▶ Finding maximum, minimum, and average values

Validation and Verification:

  • ▶ Validation checks: range, length, type, presence, format
  • ▶ Verification: visual check, double entry
  • ▶ Test data: normal, abnormal, extreme, boundary
8. Programming

Basic Concepts:

  • ▶ Programming: Data types
  • ▶ Programming: Variables and constants
  • ▶ Programming: Operators (arithmetic, logical, comparison)
  • ▶ Input and output

Control Structures:

  • ▶ Programming: Selection (IF statements)
  • ▶ Programming: Iteration (loops - FOR, WHILE, REPEAT UNTIL)

Data Structures:

  • ▶ Programming: Arrays and lists

Modular Programming:

  • ▶ Programming: Procedures and functions

String Manipulation:

  • ▶ Programming: String manipulation

Problem Solving & Design:

  • ▶ Design: structure diagrams, flowcharts, pseudocode
  • ▶ Coding: writing and testing program code
  • ▶ Testing: using test data effectively

Standard Algorithms:

  • ▶ Linear search
  • ▶ Bubble sort
  • ▶ Totalling and counting
  • ▶ Finding maximum, minimum, and average values

Validation and Verification:

  • ▶ Validation checks: range, length, type, presence, format
  • ▶ Verification: visual check, double entry
  • ▶ Test data: normal, abnormal, extreme, boundary
9. Databases

Database Fundamentals:

  • ▶ Database concepts and terminology
  • ▶ Primary and foreign keys
  • ▶ Database relationships (one-to-one, one-to-many, many-to-many)

SQL Commands:

  • ▶ SQL: SELECT and FROM statements
  • ▶ SQL: WHERE clause for filtering
  • ▶ SQL: ORDER BY sorting and aggregate functions (SUM, COUNT, AVG)
10. Boolean Logic

Logic Gates:

  • ▶ Logic gates: NOT, AND, OR
  • ▶ Logic gates: NAND, NOR, XOR (EOR)

Truth Tables and Boolean Expressions:

  • ▶ Truth tables and Boolean expressions

Logic Circuits:

  • ▶ Creating logic circuits from problem statements and expressions

Assessment Information

Examination Structure

All candidates take two written papers. No calculators are permitted in either exam.

Paper 1: Computer Systems

Duration: 1 hour 45 minutes

Marks: 75

Weighting: 50% of qualification

Content: Topics 1-6 (all Computer Systems topics)

Question Types: Short-answer and structured questions

Format: All questions are compulsory

Paper 2: Algorithms, Programming and Logic

Duration: 1 hour 45 minutes

Marks: 75

Weighting: 50% of qualification

Content: Topics 7-10 (algorithms, programming, databases, Boolean logic)

Question Types: Short-answer, structured questions, and a 15-mark scenario question

Special Note: The final question requires writing an algorithm using pseudocode or program code (approximately 30 minutes)

Format: All questions are compulsory

Assessment Objectives

AO1 (40%): Demonstrate knowledge and understanding of computer science principles and concepts

AO2 (40%): Apply knowledge to given contexts, including analysis and design of problems

AO3 (20%): Evaluate systems, make reasoned judgements, and present conclusions

Grading

Candidates are awarded grades 9 to 1, where:

  • Grade 9: Highest grade
  • Grades 9-4: Well prepared for further study
  • Grade 1: Lowest passing grade
  • Ungraded: Performance did not meet grade 1 standard

Programming Languages

Students should practice programming in one of these languages:

  • Python
  • VB.NET
  • Java

Important: Knowledge of programming language syntax is not examined. The logic is more important than the syntax. You can write answers in pseudocode or any of the accepted programming languages.

Preparation Tips

  • Practice programming regularly: Write, test, and debug your own programs
  • Learn pseudocode: Familiarize yourself with the standard pseudocode format
  • Master number systems: Practice binary, denary, and hexadecimal conversions
  • Understand algorithms: Know how linear search and bubble sort work
  • Learn SQL: Practice writing SELECT queries with different conditions
  • Draw logic circuits: Practice creating circuits and completing truth tables
  • Review past papers: Familiarize yourself with question styles and command words