Teachers' Portal  /  IGCSE Computer Science 0478  /  Scheme of work
Scheme of work · Cambridge IGCSE Computer Science 0478

Computer Science scheme of work

70 lessons in 10 topics, in syllabus order: 52 hours 30 minutes of teaching at 45 minutes a lesson. Set your lessons per week and the week numbers follow. Every lesson links to its pack, every topic to its lab, question bank and notes.

Lesson packs
24 weeks for the course at 3 a weekRemembered in this browser.
At a glance

The course in numbers

Lessons
70, one 45-minute lesson pack each
Teaching time
52 hours 30 minutes
Weeks
24 at 3 lessons a week
Topics
10, in syllabus order
Assessment points
10 topic question banks, assignable in the app
Labs
10 full-screen topic labs to project

How to read it. One row is one 45-minute lesson; its pack holds the plan, worksheet and quiz. The week column counts 3 lessons a week until you change the control above; the sheet you download uses the same numbers. Each topic ends at an assessment point, its question bank, which you can assign in the app for a marked score. The learning intention is the first idea of each lesson in the students' own pages; the traps are the examiner traps those pages pre-empt.

The topics in syllabus order

Weeks 1 to 24

Topic 1Data representation

Weeks 1 to 4
WeekRefLessonLearning intention
11.1Why computers use binary: binary and denaryClick the bits in the lab to switch them on and off.
11.1Hexadecimal and where it is usedIn the lab, flip the bits and watch each group of four turn into a single hex digit.
11.1Binary addition and overflowIn the lab, set two 8-bit numbers and step through the addition one column at a time.
21.1Logical binary shiftsIn the lab, choose a number and press the left shift button.
21.1Two's complement for negative numbersIn the lab, switch the bits on and off.
21.2Representing text: ASCII and UnicodeType some text into the lab and watch each character turn into its code and then into binary.
31.2Representing sound: sample rate and resolutionIn the lab, look at the smooth sound wave and the samples taken from it.
31.2Representing images: resolution and colour depthIn the lab, paint a few pixels and read off the binary stored for each row.
31.3Measuring data storage and calculating file sizesIn the lab, type a value, pick its unit and step it up or down the ladder.
41.3Lossy and lossless compressionSmaller files help everyone who stores or sends them.
4Assessment pointTopic question bank, 60 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • "Computers use binary because it is easier for them" earns nothing.
  • Leaving out leading zeros changes nothing in value, but if the question says "8-bit" you must give all 8 bits: 00111010, not 111010.
  • Do not write 12 as the hex digit for twelve.

Topic 2Data transmission

Weeks 4 to 6
WeekRefLessonLearning intention
42.1Packets and packet switchingA large file is split into many small packets of data before it is sent.
42.1Serial and parallel, simplex, half-duplex and full-duplexSend the same byte both ways in the lab.
52.1The universal serial bus (USB)Each word in the name matters.
52.2Parity checks, checksums and echo checksSender and receiver first agree on even or odd parity.
52.2Check digits and automatic repeat query (ARQ)Check digits protect data entry: a person typing a code, or a scanner reading one.
62.3Symmetric and asymmetric encryptionData travelling across networks passes through many devices and can be intercepted by a hacker.
6Assessment pointTopic question bank, 36 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • Packets do not make the data itself smaller.
  • The packet number goes in the header, not the trailer.
  • It is the router that controls the route a packet takes.

Topic 3Hardware

Weeks 6 to 9
WeekRefLessonLearning intention
63.1The CPU and Von Neumann architectureExplore each part in the lab to see its job.
63.1The fetch-decode-execute cycleStep through the cycle in the lab and watch the values move between registers.
73.1Cores, cache and clock speedIn the lab, change the clock speed, the cache size and the number of cores, and watch how long the same set of tasks takes.
73.1Instruction sets and embedded systemsIn the lab, pick an opcode and see how the instruction is built from binary.
73.2Input and output devicesEach input device converts something from the real world (a key press, light, sound, a pattern) into binary data the computer can process.
83.2Sensors and how they are usedPeople can check a temperature now and then; a sensor can check it every second, day and night, without mistakes or getting tired.
83.3Primary storage: RAM and ROMWhen you open an app, it is copied from secondary storage (such as an SSD) into primary storage so the CPU can fetch its instructions.
83.3Magnetic, optical and solid-state storageA hard disk drive (HDD) contains one or more circular platters coated in a magnetic material, spinning at thousands of revolutions per minute.
93.3Virtual memory and cloud storageThe CPU can only use instructions and data that are in RAM.
93.4NICs, MAC addresses, IP addresses and routersIn the lab, look at a device's MAC address and IP address, and see what changes when it joins a different network.
9Assessment pointTopic question bank, 60 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • "The CPU stores all the files" is wrong.
  • Do not mix up the MAR and the MDR.
  • The data bus carries instructions as well as data, because in a Von Neumann computer both are stored in the same memory.

Topic 4Software

Weeks 9 to 11
WeekRefLessonLearning intention
94.1System software and application softwareSystem software runs the computer and keeps it working well.
104.1The operating system, firmware and the hardwareLearn the nine functions in the syllabus, and for each one be ready to say what the OS actually does.
104.1InterruptsIn the lab, trigger different interrupts while a program runs and watch the processor respond to them in order of priority.
104.2High-level and low-level languagesHigh-level languages are designed for people.
114.2Assemblers, compilers and interpretersWhich translator you need depends on the language the source code is written in.
114.2Integrated development environments (IDEs)Without an IDE a programmer would type code in one program, translate it in another and run it in a third.
11Assessment pointTopic question bank, 36 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • Naming a brand ("Windows") is fine as an example, but when asked to describe system software you must say what it does: it provides the services the computer needs, such as managing hardware and running applications.
  • A web browser is application software, even though it feels like part of the computer.
  • "It manages memory" on its own often scores nothing.

Topic 5The internet and its uses

Weeks 11 to 13
WeekRefLessonLearning intention
115.1The internet, the world wide web and URLsThink of the internet as the road network and the web as one kind of traffic that uses the roads.
125.1HTTP, HTTPS and web browsersIn the lab, watch the request leave the browser and the response come back from the web server.
125.1How a web page is located and retrieved: DNSRun the lab from start to finish.
125.1Session and persistent cookiesHTTP on its own does not remember anything between one request and the next.
135.2Digital currency and blockchainYou may already pay by card or phone, but a digital currency goes further: the money itself is only ever data.
135.3Cyber security threatsThese three threats are about getting at data without permission.
135.3Keeping data safe from security threatsAuthentication checks that users are who they claim to be; access levels then decide what each user may do.
13Assessment pointTopic question bank, 42 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • "The web is the internet" or "the internet is a website" earns nothing.
  • A URL is not the same as an IP address.
  • HTTPS does not stop data being intercepted.

Topic 6Automated and emerging technologies

Week 14
WeekRefLessonLearning intention
146.1Automated systems: sensors, microprocessors and actuatorsEvery automated system in an exam answer works the same way.
146.2RoboticsExam questions often ask you to describe the characteristics of a robot.
146.3Artificial intelligence: expert systems and machine learningAI does not mean a computer that is conscious or truly understands.
14Assessment pointTopic question bank, 18 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • "The sensor turns on the heater" earns nothing.
  • Name the right sensor for the scenario.
  • "It is more efficient" on its own is too vague to earn a mark.

Topic 7Algorithm design and problem-solving

Weeks 15 to 17
WeekRefLessonLearning intention
157 (1-2)The program development life cycleBefore anyone designs anything, they must know exactly what the program has to do.
157 (1-2)Decomposition, structure diagrams, flowcharts and pseudocodeA games console is one system, but inside it are a controller sub-system, a graphics sub-system, a storage sub-system and more.
157 (3-4)Standard methods: linear search and bubble sortStep through the search in the lab.
167 (3-4)Standard methods: totalling, counting, maximum, minimum and averageIn the lab, choose the totalling and counting programs and run them.
167 (5-6)Validation and verification checksType different values into the validation tab of the lab and see which check accepts or rejects each one.
167 (5-6)Normal, abnormal, extreme and boundary test dataIn the lab's test data mode, pick values for each category and run the validation routine.
177 (7-9)Dry-running algorithms with trace tablesLoad a program in the lab, enter the test data and step through it line by line.
177 (7-9)Finding and correcting errors in algorithmsTry the find-the-error tab in the lab.
177 (7-9)Writing and amending algorithmsExaminers can only award marks for statements a computer could follow.
17Assessment pointTopic question bank, 54 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • Abstraction is not the same as decomposition.
  • Iterative testing belongs to the coding stage: small parts are tested and corrected repeatedly while they are being written.
  • A structure diagram is not a flowchart.

Topic 8Programming

Weeks 18 to 21
WeekRefLessonLearning intention
188.1Variables, constants and data typesRun the totalling program in the lab one line at a time.
188.1Sequence and selection: IF and CASEIn the lab, choose the Nested IF program and step through it.
188.1Iteration: count-controlled, pre-condition and post-condition loopsIn the lab, try the Nested FOR with STEP and REPEAT UNTIL programs.
198.1String handlingIn the lab, choose the String handling program.
198.1Arithmetic, relational and logical operatorsWork out each expression using the normal mathematical order: brackets, then powers, then multiplication and division, then addition and subtraction.
198.1Procedures, functions, parameters and scopeIn the lab, choose Procedure with a parameter and step through it.
208.1Library routines: MOD, DIV, ROUND and RANDOMIn the lab, choose MOD, DIV and ROUND.
208.1Writing maintainable programsCompare the two versions of the same algorithm.
208.2One-dimensional arraysThe declaration gives the identifier, the range of indexes and the data type of every element.
218.2Two-dimensional arrays and nested loopsThe two bounds in the declaration give the number of rows and the number of columns.
218.3Reading from and writing to filesIn the lab, choose Write a file, then read it.
21Assessment pointTopic question bank, 66 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • "A constant never changes" is not enough on its own.
  • A phone number is a STRING, not an INTEGER: storing it as a number would lose the leading zero, and nobody adds or multiplies phone numbers.
  • OUTPUT "Total" displays the word Total; OUTPUT Total displays the value stored in the variable Total.

Topic 9Databases

Weeks 21 to 22
WeekRefLessonLearning intention
219 (1-3)Single-table databases: fields, records and data typesIn the lab, click a column heading to highlight a field and click a row to highlight a record.
229 (1-3)Primary keysIn the lab, try each field of the Books table as the primary key.
229 (4)SQL: SELECT, FROM, WHERE and ORDER BYIn the lab, build a query on the Books table: tick fields for SELECT and run it.
229 (4)SQL: SUM, COUNT, AND and ORIn the lab, run a SUM or COUNT query on the Books table and compare it with the same query without them: the list of rows collapses into one number.
22Assessment pointTopic question bank, 24 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • Do not mix the two words up.
  • "Number" and "string" are not accepted as answers.
  • A range check on Weight would still accept 21.5 when the dog really weighs 12.5.

Topic 10Boolean logic

Weeks 23 to 24
WeekRefLessonLearning intention
2310 (1-2)The six logic gatesPick a gate in the lab and click its input switches.
2310 (3)Drawing logic circuitsChoose an expression in the lab and watch it become a circuit.
2310 (3)Completing truth tablesEach row of inputs is a binary number.
2410 (3)Writing logic expressionsPick an expression in the lab and study the circuit it draws.
24Assessment pointTopic question bank, 24 multiple-choice questions: print or review, or assign in the app for a marked score.
Examiner traps to pre-empt:
  • Draw the shapes carefully: an AND gate has a straight back, an OR gate a curved back.
  • Learn the six output columns by heart in the order 00, 01, 10, 11: AND 0001, OR 0111, NAND 1110, NOR 1000, XOR 0110.
  • Do not draw a three-input AND gate: at IGCSE every gate except NOT has exactly two inputs.
Also for this course

Beyond the scheme

Original work by the TheLucidSTEM team. Week numbers assume 3 lessons a week unless you change the control; the download carries the numbers shown.