Curricula Cambridge International Education

Cambridge IGCSE Computer Science (0478)

Cambridge’s IGCSE route is common in British-curriculum international schools; IGCSE and A level experience are what the Gulf job advertisements reviewed for this plan ask for. The first priority.

Source

Assessment

  • Paper 1 Computer Systems: 1 hour 45 minutes, 75 marks, 50%, topics 1 to 6, no calculator
  • Paper 2 Algorithms, Programming and Logic: 1 hour 45 minutes, 75 marks, 50%, topics 7 to 10, including a scenario-based question, no calculator
  • Grades A* to G

Coming: A revised syllabus is published for exams in 2029, 2030 and 2031 (https://www.cambridgeinternational.org/Images/763431-2029-2031-syllabus.pdf, not yet read). Cambridge’s page says 0478 is the paper-based route and 0265 the digital-only route with the same content.

1 Data representation · Computer systems

  • 1.1 Number systems

    Why computers use binary; denary, binary and hexadecimal, with conversions between each pair (positive integers, binary up to 16 bits); why hexadecimal is used; adding two 8-bit integers and overflow; logical shifts; two’s complement for 8-bit integers.

    Content confirmed from the document.

    Binary Addition and Overflow teaches part of this point. Provisional: not yet verified Teaches point 4: adding two positive 8-bit binary integers and understanding overflow (a value greater than 255 in an 8-bit register) and why it occurs. Hexadecimal is in the lesson before this one; logical shifts and two’s complement are in the two lessons after it.

    Hexadecimal teaches part of this point. Provisional: not yet verified Teaches hexadecimal for point 2 (conversion between hexadecimal and binary, and between hexadecimal and denary, for positive integers of up to 16 bits) and all of point 3 (why and where hexadecimal is used). Binary and denary conversion is in How Computers Count in Binary; adding and overflow, logical shifts and two’s complement are in the three lessons that follow.

    How Computers Count in Binary teaches part of this point. Provisional: not yet verified Covers why computers use binary (point 1 of 1.1) and conversion both ways between positive denary and positive binary (point 2(b)(i)) up to 8 bits; 1.1 allows up to 16 bits, and also requires hexadecimal, adding 8-bit integers and overflow, logical shifts and two’s complement.

    Logical Binary Shifts teaches part of this point. Provisional: not yet verified Teaches point 5: logical left and right shifts of a positive 8-bit integer, multiple shifts, the bits lost and the zeros shifted in, and the effect of multiplying or dividing by powers of two. Hexadecimal and binary addition are in the two lessons before this one; two’s complement is in the lesson after it.

    Two’s Complement teaches this point. Provisional: not yet verified Full with the four lessons before it in this module: why binary and binary–denary conversion (How Computers Count in Binary), hexadecimal with 16-bit conversions both directly and through hexadecimal and why hexadecimal is used (Hexadecimal), adding 8-bit integers and overflow, and logical shifts. This lesson teaches point 6: positive and negative 8-bit integers in two’s complement, converting both ways from binary and from denary, and the range −128 to 127.

  • 1.2 Text, sound and images

    Why and how text is represented, with character sets: ASCII and Unicode (Unicode has a greater range, including other languages and emojis, and needs more bits per character); sound sampled, with sample rate (samples per second) and sample resolution (bits per sample); images as pixels, with resolution (number of pixels) and colour depth (bits per pixel); how each affects quality or accuracy and file size.

    Content confirmed from the document.

    Representing Images teaches this point. Provisional: not yet verified Teaches point 3 of 1.2: an image as a series of pixels converted to binary, resolution as the number of pixels, colour depth as the number of bits for each pixel’s colour, and the rise in file size and quality as each increases. With Representing Text (point 1) and Representing Sound (point 2), the three lessons teach every bullet of 1.2. Calculating file sizes is point 2 of 1.3, in Measuring Storage and File Sizes.

    Representing Sound teaches part of this point. Provisional: not yet verified Teaches point 2 of 1.2 in full: a sound wave sampled and converted to binary, sample rate (samples per second), sample resolution (bits per sample), and the rise in accuracy and file size as each increases. Text (point 1) is in Representing Text and images (point 3) in Representing Images; the three lessons together teach every bullet of 1.2.

    Representing Text teaches part of this point. Provisional: not yet verified Teaches point 1 of 1.2 in full: text converted to binary, character sets, ASCII and Unicode, Unicode’s greater range (other languages and emojis) and its need for more bits per character. Sound (point 2) is in Representing Sound and images (point 3) in Representing Images; the three lessons together teach every bullet of 1.2.

  • 1.3 Data storage and compression

    Units of storage: bit, nibble, byte, KiB, MiB, GiB, TiB, PiB, EiB, using 1024 (not 1000) and answering in the units asked; calculating image file size (resolution × colour depth) and sound file size (sample rate × resolution × length); the purpose of compression (less bandwidth, less storage, shorter transmission time); lossy (data permanently removed, e.g. reducing resolution, colour depth, sample rate or resolution) and lossless (no permanent loss, e.g. run-length encoding).

    Content confirmed from the document.

    Data Compression teaches this point. Provisional: not yet verified Teaches points 3 and 4 of 1.3: the purpose of compression (less bandwidth, less storage space, shorter transmission time), lossy compression (permanently removing data, for example reducing resolution, colour depth, sample rate or sample resolution) and lossless compression (no permanent loss, for example run-length encoding). With Measuring Storage and File Sizes (points 1 and 2), the two lessons teach every bullet of 1.3.

    Measuring Storage and File Sizes teaches part of this point. Provisional: not yet verified Teaches points 1 and 2 of 1.3: the units bit, nibble, byte, KiB, MiB, GiB, TiB, PiB and EiB with 1024 and not 1000, the number of the previous unit in each, answering in the units asked for, and calculating the file size of an image and of a sound from the information given. The purpose of compression (point 3) and lossy and lossless compression (point 4) are in Data Compression, which with this lesson teaches every bullet of 1.3.

2 Data transmission · Computer systems

  • 2.1 Types and methods of data transmission

    Data broken into packets; packet structure (header with destination address, packet number and originator’s address; payload; trailer); packet switching (packets may take different routes, routers choose routes, packets may arrive out of order and are reordered); serial, parallel, simplex, half-duplex and full-duplex transmission, with advantages, disadvantages and suitability for a scenario; the USB interface, its use and its benefits and drawbacks.

    Content confirmed from the document.

    Data Transmission Methods teaches this point. Provisional: not yet verified Full with Lesson 1, Packets and Packet Switching (2.1 point 1). This lesson teaches points 2 and 3: serial, parallel, simplex, half-duplex and full-duplex transmission with advantages, disadvantages and suitability for a scenario, and the USB interface, how it transmits data and its benefits and drawbacks.

    Packets and Packet Switching teaches part of this point. Provisional: not yet verified Teaches 2.1 point 1 in full: data broken into packets, the structure of a packet (header with destination address, packet number and originator’s address; payload; trailer) and the process of packet switching (different routes, a router controls the route, packets may arrive out of order and are reordered once the last has arrived). Serial, parallel, simplex, half-duplex and full-duplex transmission and USB (points 2 and 3) are in Data Transmission Methods.

  • 2.2 Methods of error detection

    Why errors occur after transmission (interference: data loss, gain and change); parity checks (odd and even, parity byte and parity block), checksum and echo check; check digits for data entry (ISBN, bar codes); automatic repeat query (ARQ) with positive and negative acknowledgements and timeout.

    Content confirmed from the document.

    Error Detection teaches this point. Provisional: not yet verified Teaches every bullet of 2.2: the need to check for errors and how they occur (interference: data loss, gain and change); parity checks, odd and even, including a parity byte and a parity block; checksum; echo check; check digits for data entry, with ISBN-13 and bar codes; and automatic repeat query with positive and negative acknowledgements and timeout.

  • 2.3 Encryption

    The need for and purpose of encryption when transmitting data; symmetric and asymmetric encryption, including public and private keys.

    Content confirmed from the document.

    Encryption teaches this point. Provisional: not yet verified Teaches the need for and purpose of encryption when transmitting data, how data is encrypted with symmetric and with asymmetric encryption, and the public and private keys of asymmetric encryption. A shift cipher is used only as a familiar way in; 0478 does not ask for any particular algorithm.

3 Hardware · Computer systems

  • 3.1 Computer architecture

    Role of the CPU and what a microprocessor is; Von Neumann components: ALU, CU, registers PC, MAR, MDR, CIR and ACC, and the address, data and control buses; the fetch–decode–execute cycle with each component’s role; cores, cache and clock and their effect on performance; the instruction set (machine code commands); embedded systems compared with general-purpose computers.

    Content confirmed from the document.

    CPU Performance and Embedded Systems teaches this point. Provisional: not yet verified 3.1.3 (cores, cache and clock, and their effect on performance), 3.1.4 (the instruction set as the machine-code commands a CPU can process) and 3.1.5 (embedded systems, their characteristics and the devices named in the specification, compared with general-purpose computers). With Lessons 1 and 2, every bullet of the notes and guidance of 3.1 is taught.

    The CPU and Von Neumann Architecture teaches part of this point. Provisional: not yet verified 3.1.1 (the role of the CPU; a microprocessor) and 3.1.2(a) (the purpose of the ALU, the CU, the registers PC, MAR, MDR, CIR and ACC, and the three buses, in a Von Neumann computer). The fetch-decode-execute cycle is Lesson 2; cores, cache, clock, the instruction set and embedded systems are Lesson 3.

    The Fetch-Decode-Execute Cycle teaches part of this point. Provisional: not yet verified 3.1.2(b): the fetch-decode-execute cycle and the role of each register, unit and bus in it, with the notes and guidance on fetching from RAM, storing data and addresses in specific registers, using the buses and using the units to fetch, decode and execute. With Lesson 1 it covers 3.1.1 and 3.1.2; points 3.1.3 to 3.1.5 are Lesson 3.

  • 3.2 Input and output devices

    Input devices (barcode and QR code scanners, digital camera, keyboard, microphone, optical mouse, resistive, capacitive and infra-red touch screens, 2D and 3D scanners) and output devices (actuator, DLP and LCD projectors, inkjet, laser and 3D printers, LED and LCD screens, speaker); sensors and their data: acoustic, accelerometer, flow, gas, humidity, infra-red, level, light, magnetic field, moisture, pH, pressure, proximity, temperature; choosing a suitable sensor.

    Content confirmed from the document.

    Input and Output Devices teaches part of this point. Provisional: not yet verified 3.2.1 and 3.2.2: what input and output devices are and why they are required, and how each device named in the notes and guidance works: barcode scanner, digital camera, keyboard, microphone, optical mouse, QR code scanner, resistive, capacitive and infra-red touch screens, 2D and 3D scanners; and actuator, DLP projector, inkjet printer, laser printer, LED screen, LCD projector, LCD screen, speaker and 3D printer. Sensors (3.2.3) are in Lesson 5, which completes point 3.2.

    Sensors teaches this point. Provisional: not yet verified 3.2.3(a) and (b): what a sensor is and its purposes; the type of data captured by each of the fourteen sensors in the notes and guidance, when each is used, and choosing the most suitable one for a context. With Lesson 4 (3.2.1 and 3.2.2), every bullet of the notes and guidance of 3.2 is taught.

  • 3.3 Data storage

    Primary storage (directly accessed by the CPU): RAM and ROM, why both are needed and how they differ; secondary storage: magnetic (platters, tracks, sectors, electromagnets; HDD), optical (lasers, pits and lands; CD, DVD, Blu-ray) and solid-state (NAND or NOR flash, control and floating gates; SSD, SD card, USB drive); virtual memory (pages moved between RAM and secondary storage); cloud storage and its advantages and disadvantages compared with local storage.

    Content confirmed from the document.

    Primary Storage and Virtual Memory teaches part of this point. Provisional: not yet verified 3.3.1 (primary storage as storage the CPU accesses directly, with RAM and ROM, why both are needed, and how they differ) and 3.3.4 (virtual memory: what it is, how it is created and used, why it is necessary, and the movement of pages between RAM and virtual memory). Secondary storage is introduced only to contrast it with primary storage; 3.3.2, 3.3.3, 3.3.5 and 3.3.6 (the operation of magnetic, optical and solid-state storage, and cloud storage) are not taught in this lesson.

    Secondary and Cloud Storage teaches this point. Provisional: not yet verified 3.3.2 (secondary storage is not accessed directly by the CPU and is needed for permanent storage), 3.3.3 (magnetic storage: platters, tracks, sectors, electromagnets and the HDD; optical storage: lasers, pits and lands, CD, DVD and Blu-ray; solid-state storage: NAND and NOR flash, control and floating gates, SSD, SD card and USB drive), 3.3.5 (cloud storage is accessed remotely) and 3.3.6 (its advantages and disadvantages against local storage, with the physical servers it needs). With Lesson 6 (3.3.1 and 3.3.4), every bullet of the notes and guidance of 3.3 is taught.

  • 3.4 Network hardware

    A network interface card (NIC) is needed to access a network; MAC addresses (assigned at manufacture, usually written in hexadecimal, manufacturer code and serial code); IP addresses (allocated by the network, static or dynamic; IPv4 and IPv6); the router’s role (sends data to a destination, can assign IP addresses, connects a local network to the internet).

    Content confirmed from the document.

    Network Hardware and Addresses teaches this point. Provisional: not yet verified Teaches every bullet of 3.4: the NIC needed to access a network; the MAC address, assigned at manufacture, usually written in hexadecimal, made from a manufacturer code and a serial code; the IP address, allocated by the network, static or dynamic; the characteristics of and differences between IPv4 and IPv6; and the router sending data to a destination, assigning IP addresses and connecting a local network to the internet.

4 Software · Computer systems

  • 4.1 Types of software and interrupts

    System software (operating system, utilities) and application software; the operating system’s functions (managing files, interrupts, an interface, peripherals and drivers, memory, multitasking, a platform for applications, security, user accounts); applications run on the OS, the OS on firmware, the bootloader on hardware; interrupts: how one is generated and handled by an interrupt service routine, and its result; software and hardware interrupts.

    Content confirmed from the document.

    Firmware, Booting and Interrupts teaches this point. Provisional: not yet verified 4.1.3 (hardware, firmware and the operating system are all required to run application software: applications run on the operating system, the operating system on the firmware, and the bootloader, which is firmware, on the hardware) and 4.1.4 (how an interrupt is generated, how it is handled by an interrupt service routine and what results, with software interrupts such as division by zero and two processes using the same memory location, and hardware interrupts such as a key press and a mouse movement). With Lesson 8 (4.1.1 and 4.1.2), every bullet of the notes and guidance of 4.1 is taught.

    System Software and Operating Systems teaches part of this point. Provisional: not yet verified 4.1.1 (system software, including the operating system and utility software, and application software, with examples) and 4.1.2 (the role and basic functions of an operating system: managing files, handling interrupts, providing an interface, managing peripherals and drivers, managing memory, managing multitasking, providing a platform for running applications, providing system security and managing user accounts). Hardware, firmware and the operating system (4.1.3) and interrupts in detail (4.1.4) are in Lesson 9.

  • 4.2 Types of programming language, translators and integrated development environments (IDEs)

    High-level and low-level languages and their advantages and disadvantages; assembly language and the assembler; compilers and interpreters (translation, error reporting, advantages and disadvantages, an interpreter for development and a compiler for the final program); an IDE’s functions (code editor, run-time environment, translators, error diagnostics, auto-completion, auto-correction, prettyprint).

    Content confirmed from the document.

    Programming Languages and Translators teaches this point. Provisional: not yet verified 4.2.1 (high-level and low-level languages and their advantages and disadvantages: ease of reading and writing, ease of debugging, machine independence and direct manipulation of hardware), 4.2.2 (assembly language, mnemonics and the assembler), 4.2.3 and 4.2.4 (how a compiler and an interpreter translate and report errors, their advantages and disadvantages, and the interpreter for development and the compiler for the final program) and 4.2.5 (the IDE: code editor, run-time environment, translators, error diagnostics, auto-completion, auto-correction and prettyprint). Every bullet of the notes and guidance of 4.2 is taught.

5 The internet and its uses · Computer systems

  • 5.1 The internet and the world wide web

    The internet (the infrastructure) and the world wide web (websites and pages accessed over it); URLs (protocol, domain name, page or file name); HTTP and HTTPS; the browser’s purpose (rendering HTML) and functions (bookmarks, history, tabs, cookies, navigation tools, address bar); how a page is located, retrieved and displayed (browser, IP addresses, DNS, web server, HTML); session and persistent cookies and their uses.

    Content confirmed from the document.

    How a Web Page Is Loaded teaches this point. Provisional: not yet verified With the previous lesson, teaches every bullet of 5.1. This lesson covers 5.1.5, how a page is located, retrieved and displayed after a URL is entered, including the roles of the browser, IP addresses, the domain name server, the web server and HTML; and 5.1.6, what cookies are, session and persistent cookies, and cookies used for saving personal details, tracking user preferences, holding items in a shopping cart and storing login details.

    The Internet and the Web teaches part of this point. Provisional: not yet verified Teaches 5.1.1 to 5.1.4: the internet as the infrastructure and the web as the websites and pages accessed through it; the URL and its protocol, domain name and page or file name; the purpose and operation of HTTP and HTTPS; and the browser’s purpose (rendering HTML) and its functions (bookmarks and favourites, history, tabs, cookies, navigation tools, address bar). How a page is located and retrieved (5.1.5) and the two kinds of cookie (5.1.6) are in the next lesson.

  • 5.2 Digital currency

    Digital currency (exists only electronically) and its use; blockchain as a digital ledger, a time-stamped series of records that cannot be altered, used to track transactions.

    Content confirmed from the document.

    Digital Currency and Blockchain teaches this point. Provisional: not yet verified Teaches both bullets of 5.2: a digital currency is one that only exists electronically, and how digital currencies are used; and blockchain, in its basic form, as a digital ledger, a time-stamped series of records that cannot be altered, and how it is used to track digital currency transactions. Hashes are taught only as far as the chain of blocks needs them. The lesson gives no advice about buying, selling or holding any currency.

  • 5.3 Cyber security

    Threats, their processes and aims: brute force, data interception, DDoS, hacking, malware (virus, worm, Trojan horse, spyware, adware, ransomware), pharming, phishing and social engineering; and solutions: access levels, anti-malware, authentication, automatic updates, checking the spelling and tone of messages and the URL of links, firewalls, privacy settings, proxy servers and SSL.

    Content confirmed from the document.

    Cyber Security Threats teaches part of this point. Provisional: not yet verified Teaches 5.3.1 in full: the process and aim of a brute-force attack, data interception, a DDoS attack, hacking, malware (virus, worm, Trojan horse, spyware, adware, ransomware), pharming, phishing and social engineering. The solutions of 5.3.2 are in the next lesson.

    Keeping Data Safe teaches this point. Provisional: not yet verified With the previous lesson, teaches every bullet of 5.3. This lesson covers 5.3.2: how access levels, anti-malware (anti-virus and anti-spyware), authentication (username and password, biometrics, two-step verification), automating software updates, checking the spelling and tone of communications, checking the URL attached to a link, firewalls, privacy settings, proxy servers and the secure socket layer (SSL) security protocol help to keep data safe.

    Protecting Your Online Identity supports this point. Provisional: not yet verified Introduces, at Key Stage 3 level, passwords, two-step verification and privacy settings as ways to keep data safe; the threats (phishing and others) and the full set of solutions are taught in Cyber Security Threats and Keeping Data Safe.

    Recognising and Reporting Online Risks supports this point. Provisional: not yet verified Phishing and social engineering seen from a learner’s point of view, with the habit of pausing and checking a message; the full threats and solutions are in Cyber Security Threats and Keeping Data Safe.

    Using AI Well and Responsibly supports this point. Provisional: not yet verified A weak link, for the owner to keep or remove: the lesson’s rule on personal data and its note on prompt injection relate only loosely to 5.3, which lists named threats and solutions that the lesson does not teach.

6 Automated and emerging technologies · Computer systems

  • 6.1 Automated systems

    How sensors, microprocessors and actuators work together in automated systems, and the advantages and disadvantages of an automated system in a given scenario (industry, transport, agriculture, weather, gaming, lighting, science).

    Content confirmed from the document.

    Automated Systems teaches this point. Provisional: not yet verified 6.1.1 (how sensors, microprocessors and actuators work together to make an automated system) and 6.1.2 (advantages and disadvantages of an automated system for a given scenario), with scenarios from industry, transport, agriculture, weather, gaming, lighting and science. Every bullet of the notes and guidance of 6.1 is taught, through scenarios that the learner evaluates.

  • 6.2 Robotics

    What robotics is (design, construction and operation of robots); a robot’s characteristics (a mechanical structure, electrical components such as sensors, microprocessors and actuators, programmable); the roles robots perform in industry, transport, agriculture, medicine, the home and entertainment, with advantages and disadvantages.

    Content confirmed from the document.

    Robotics teaches this point. Provisional: not yet verified 6.2.1 (robotics as the branch of computer science that includes the design, construction and operation of robots), 6.2.2 (the characteristics of a robot: a mechanical structure or framework, electrical components such as sensors, microprocessors and actuators, and being programmable) and 6.2.3 (the roles of robots in industry, transport, agriculture, medicine, domestic settings and entertainment, with factory equipment, domestic robots and drones, and their advantages and disadvantages). Every bullet of the notes and guidance of 6.2 is taught.

  • 6.3 Artificial intelligence

    What AI is; its main characteristics (data and rules for using it, the ability to reason, and possibly to learn and adapt); the basic operation and components of AI systems, limited to expert systems (knowledge base, rule base, inference engine, interface) and machine learning.

    Content confirmed from the document.

    Expert Systems and Machine Learning teaches this point. Provisional: not yet verified All of 6.3, together with What Counts as AI? (points 1 and 2 in part: what AI is, rules and data, and learning from examples). This lesson completes them: AI as the simulation of intelligent behaviour, its characteristics (data and rules, reasoning, learning and adapting), and, as the syllabus limits point 3, the components of an expert system (knowledge base, rule base, inference engine, interface) and machine learning as a program automatically adapting its own processes and/or data.

    How Language Models Write supports this point. Provisional: not yet verified Machine learning as a program adapting from data, in the context of language models; expert systems are not taught.

    What Counts as AI? supports this point. Provisional: not yet verified What AI is, rules and data, and learning from examples (points 1 and 2 of 6.3, in part). Point 3 asks for the basic operation and components of AI systems, which the syllabus limits to expert systems (knowledge base, rule base, inference engine, interface) and machine learning; the expert-system components and machine learning as adaptation are taught in Lesson 5, Expert Systems and Machine Learning, which together with this lesson covers all of 6.3.

7 Algorithm design and problem-solving · Algorithms, programming and logic

8 Programming · Algorithms, programming and logic

  • 8.1 Programming concepts

    Variables and constants; data types integer, real, char, string, Boolean; input and output; sequence, selection (IF, CASE), iteration (count-controlled, pre-condition and post-condition loops), totalling and counting, string handling (length, substring, upper, lower); arithmetic (+ − / * ^ MOD DIV), relational and logical (AND, OR, NOT) operators; nested statements (up to three levels); procedures, functions and parameters (up to three); local and global variables; library routines (MOD, DIV, ROUND, RANDOM); maintainable programs (meaningful identifiers, comments, subroutines).

    Content confirmed from the document.

    Finding and Fixing Errors teaches this point. Provisional: not yet verified Full with Lessons 3 to 11 of this module, which teach variables, constants, data types, input and output, operators and sequence (3), selection (4), iteration and nesting (5), totalling and counting (6), string handling (8), procedures, functions, parameters, scope and library routines (9). This lesson teaches point 8.1.8, how to create a maintainable program.

    Iteration teaches part of this point. Provisional: not yet verified Point 8.1.4(c) (count-controlled loops, including STEP, pre-condition loops and post-condition loops) and the nested iteration of 8.1.5. Selection is in Lesson 4, totalling and counting (8.1.4(d)) in Lesson 6; string handling, subroutines, library routines, arrays and files are not taught here.

    Procedures and Functions teaches part of this point. Provisional: not yet verified Points 8.1.6 (procedures, functions and parameters; defining and using them with or without parameters, up to three; local and global variables), 8.1.7 (the library routines MOD, DIV, ROUND and RANDOM) and, in part, 8.1.8 (maintainable programs: meaningful identifiers, comments, procedures and functions). Arrays (8.2) are in Lesson 10.

    Python Loops, Lists and Functions supports this point. Provisional: not yet verified Count-controlled and pre-condition loops, and procedures and functions with parameters, written in Python. The 0478 papers are answered in Cambridge pseudocode, and Python is accepted only in the scenario question of Paper 2.

    Selection teaches part of this point. Provisional: not yet verified Point 8.1.4(b) (IF statements, with and without ELSE, and CASE statements with OTHERWISE) and the nested selection of 8.1.5, to the syllabus’s limit of three levels of nesting. Iteration and nested iteration are in Lesson 5; totalling and counting in Lesson 6; the rest of 8.1 (string handling, subroutines, library routines) is not taught here.

    String Handling teaches part of this point. Provisional: not yet verified Point 8.1.4(e), string handling: length, substring, upper case and lower case, with the first character at position 1 in pseudocode, and a note that the position of the first character can be zero or one. Combining the operations with loops is practised. Procedures, functions, parameters and library routines (8.1.6, 8.1.7) are in Lesson 9, and arrays (8.2) in Lesson 10.

    Tackling a Programming Scenario supports this point. Provisional: not yet verified Applies sequence, selection, iteration, totalling, counting, input and output and maintainable names from point 8.1 in one program; each is taught in an earlier lesson.

    Totalling, Counting and Finding Extremes teaches part of this point. Provisional: not yet verified Point 8.1.4(d), totalling and counting, within programs that use loops and selection. The other parts of 8.1 (string handling, subroutines, library routines) are not taught here.

    Validation and Verification supports this point. Provisional: not yet verified Uses iteration (REPEAT … UNTIL), selection and string handling (LENGTH, SUBSTRING) from point 8.1 to write the checks; it teaches no new programming construct.

    Variables, Data Types and Operators teaches part of this point. Provisional: not yet verified Points 8.1.1 (declaring and using variables and constants), 8.1.2 (INTEGER, REAL, CHAR, STRING, BOOLEAN), 8.1.3 (input and output), 8.1.4(a) (sequence) and 8.1.4(f) (arithmetic including MOD and DIV, relational and logical operators). Selection (8.1.4(b)) is in Lesson 4, iteration (8.1.4(c)) in Lesson 5 and totalling and counting (8.1.4(d)) in Lesson 6; string handling (8.1.4(e)), subroutines and library routines (8.1.6, 8.1.7), arrays and files are not taught here.

    Writing Your First Python Programs supports this point. Provisional: not yet verified The programming concepts of 8.1 (variables, data types, input and output, arithmetic and selection) written in Python. The 0478 papers are answered in Cambridge pseudocode, and Python is accepted only in the scenario question of Paper 2, so this lesson supports the concepts and not the exam notation.

  • 8.2 Arrays

    Declaring and using one-dimensional and two-dimensional arrays; their uses; writing values into and reading values from an array with iteration, including variables as indexes and nested iteration; the first index can be zero or one.

    Content confirmed from the document.

    Arrays teaches this point. Provisional: not yet verified Declaring and using one-dimensional and two-dimensional arrays, their uses, writing values into and reading values from an array with iteration, variables as indexes, nested iteration, and the first index being zero or one, with standard algorithms practised on arrays. Searching and sorting an array are in Lesson 11.

    Python Loops, Lists and Functions supports this point. Provisional: not yet verified Python lists beside the one-dimensional arrays of 0478 (Lesson 10); a list can grow and an array has a fixed size.

  • 8.3 File handling

    The purpose of storing data in a file for a program; opening, closing and using a file for reading and writing single items of data and lines of text.

    Content confirmed from the document.

    File Handling teaches this point. Provisional: not yet verified Teaches every bullet of 8.3: the purpose of storing data in a file for a program, and opening, closing and using a file for reading and writing, including single items of data and lines of text, with OPENFILE, READFILE, WRITEFILE and CLOSEFILE as in the syllabus’s pseudocode guide.

9 Databases · Algorithms, programming and logic

10 Boolean logic · Algorithms, programming and logic

  • 10.1 Identify and use the standard symbols for logic gates

    Topic 10 point 1. The symbols (NOT, AND, OR, NAND, NOR, XOR (EOR)) are printed under “Logic gate symbols” in section 4, Details of the assessment, page 34.

    Content confirmed from the document.

    Designing Logic Circuits teaches this point. Provisional: not yet verified Full with Lesson 2, More Logic Gates: Lesson 2 teaches and identifies the six standard symbols; this lesson uses them to draw circuits.

    More Logic Gates teaches part of this point. Provisional: not yet verified All six standard symbols, predicted, identified and sketched; Lesson 3 reads them in circuits and Lesson 4 uses them to draw circuits.

  • 10.2 Define and understand the functions of logic gates

    NOT, AND, OR, NAND, NOR and XOR (EOR); NOT has one input, every other gate exactly two.

    Content confirmed from the document.

    Introduction to Logic Gates teaches part of this point. Provisional: not yet verified NOT, AND and OR: their functions and truth tables. NAND, NOR and XOR are in Lesson 2.

    More Logic Gates teaches this point. Provisional: not yet verified With Lesson 1: the functions and truth tables of NOT, AND, OR, NAND, NOR and XOR (EOR); NOT has one input and the others two.

  • 10.3 Create logic circuits, complete truth tables and write logic expressions, each from a problem statement, a logic expression, a truth table or a logic circuit

    Topic 10 point 3, lettered by the syllabus: 3(a) create a logic circuit from (i) a problem statement, (ii) a logic expression, (iii) a truth table; 3(b) complete a truth table from (i) a problem statement, (ii) a logic expression, (iii) a logic circuit; 3(c) write a logic expression from (i) a problem statement, (ii) a logic circuit, (iii) a truth table. Circuits are drawn for the statement given, without simplification, with at most three inputs and one output.

    Content confirmed from the document.

    Designing Logic Circuits teaches this point. Provisional: not yet verified Full with Lesson 3, Logic Expressions and Truth Tables: together the two lessons practise all nine conversions, with at most three inputs and one output, drawn without simplification. This lesson: a logic expression from a problem statement (3c i) and from a truth table (3c iii); a logic circuit from a problem statement (3a i), from an expression (3a ii) and from a truth table (3a iii).

    Logic Expressions and Truth Tables teaches part of this point. Provisional: not yet verified Four of the nine conversions, each practised by the learner: a truth table from a circuit (3b iii), from an expression (3b ii) and from a problem statement (3b i), and an expression from a circuit (3c ii), all with at most three inputs. The other five are in Lesson 4.

    More Logic Gates supports this point. Provisional: not yet verified One gate feeding another, traced for a single row; the conversions themselves are Lessons 3 and 4.