Explain the basic operation and components of AI systems

Automated and Emerging Technologies – AI Systems (IGCSE Computer Science 0478)

Learning Objective

Explain the basic operation and components of Artificial Intelligence (AI) systems and relate them to the wider Cambridge IGCSE Computer Science syllabus (Topics 1‑10).

---

1. Computer Systems (Syllabus Topics 1‑6)

1.1 Data Representation

• Number systems – binary, octal, hexadecimal; conversion methods (e.g., decimal → binary).
• Text – ASCII (7‑bit) and Unicode (UTF‑8) codes.
• Images – bitmap, colour depth (bits per pixel), resolution.
• Sound – sampling rate, bit depth, mono vs stereo.

1.2 Data Storage & Compression

• Primary (RAM, registers) vs secondary storage (HDD, SSD, optical media).
• File formats – text, image (JPEG, PNG), audio (MP3, WAV).
• Lossless compression (ZIP, PNG) and lossy compression (JPEG, MP3).

1.3 Data Transmission

• Packet structure – header, payload, trailer.
• Error detection – parity bit, checksum, CRC.
• Simple encryption – Caesar cipher, XOR.
• Network hardware – NIC, router, switch, hub.

1.4 Hardware Architecture

• CPU cycle – fetch, decode, execute.
• Memory hierarchy – registers, cache, RAM, ROM.
• I/O devices – keyboards, mice, displays, sensors, actuators.
• Special‑purpose processors – GPU, TPU, FPGA (used for AI).

1.5 Software & Operating Systems

• System software vs application software.
• OS functions – process management, memory management, file system, security.
• Interrupts – hardware and software interrupts.

1.6 Internet & Cyber‑Security

• Web basics – URLs, HTTP/HTTPS, browsers, cookies.
• Security measures – firewalls, strong passwords, anti‑virus, two‑factor authentication.
• Common threats – phishing, malware, denial‑of‑service.

1.7 Emerging Technologies (Topic 6)

• Automated systems – sensor → microcontroller/CPU → actuator (e.g., smart thermostat).
• Robotics – chassis, motors/servos, sensors, control unit; applications in manufacturing, medicine, domestic use, space exploration.
• Artificial Intelligence – see Section 4.
• Digital currency & blockchain – basic idea of a distributed ledger, cryptographic hash, decentralised verification.

---

2. Algorithm Design & Problem Solving (Topic 7)

• Program Development Cycle – Analyse, Design, Write, Test & Debug, Document & Maintain.
• Decomposition – Break a problem into smaller, manageable sub‑problems.
• Validation vs Verification
  • Validation – does the program do the right thing?
  • Verification – is the program written correctly?
• Trace tables – show the change of variable values step‑by‑step.

Example – Finding the maximum of three numbers

Step	Pseudocode
1	READ a, b, c
2	max ← a
3	IF b > max THEN max ← b
4	IF c > max THEN max ← c
5	PRINT "Maximum =", max

---

3. Programming (Topic 8)

3.1 Core Constructs

• Variables & constants – integer, real, Boolean, character, string.
• Selection – IF … THEN … ELSE, SWITCH.
• Iteration – FOR, WHILE, REPEAT … UNTIL.
• Arrays – one‑dimensional, index starts at 0 (or 1 depending on language).
• Procedures / functions – parameters (call‑by‑value, call‑by‑reference), return values.
• File handling – OPEN, READ, WRITE, CLOSE.

3.2 Sample Pseudocode (Average of three numbers)

READ a, b, c
total ← a + b + c
average ← total / 3
PRINT "Average =", average

3.3 Simple File‑Handling Example

OPEN "scores.txt" FOR WRITE AS f
WRITE f, "Alice,85"
WRITE f, "Bob,78"
CLOSE f

---

4. Databases (Topic 9)

• Single‑table design – choose a primary key that uniquely identifies each record.
• Data types – INTEGER, REAL, TEXT, DATE.
• Basic SQL statements – SELECT, INSERT, UPDATE, DELETE.

Example – Students table

CREATE TABLE Students (
    StudentID   INTEGER PRIMARY KEY,
    FirstName   TEXT,
    LastName    TEXT,
    Grade       CHAR(1)
);

SELECT FirstName, LastName
FROM Students
WHERE Grade = 'A'
ORDER BY LastName;

---

5. Boolean Logic & Logic Gates (Topic 10)

• Truth tables – show output for all possible input combinations.
• Logical operators – AND, OR, NOT, NAND, NOR, XOR, XNOR.
• Gate symbols – standard shapes for each operator.
• From expression to circuit: write the Boolean expression, create the truth table, then draw the gate diagram.

Example – Expression (A AND B) OR NOT C

A	B	C	(A AND B) OR NOT C
0	0	0	1
0	0	1	0
0	1	0	1
0	1	1	0
1	0	0	1
1	0	1	0
1	1	0	1
1	1	1	1

Simple circuit diagram (text description): Connect inputs A and B to an AND gate; the output of that gate and the inverted input C (through a NOT gate) go to an OR gate. The OR gate output is the final result.

---

6. AI Systems – Basic Understanding (Topic 6)

6.1 What is an AI System?

An AI system is a computer‑based solution that can perform tasks that normally require human intelligence, such as recognising patterns, making simple decisions, or understanding natural language.

6.2 Core Components (simplified for IGCSE)

• Data – raw examples (e.g., pictures of cats, text messages labelled as “spam”).
• Algorithm – a set of instructions that learns from the data (e.g., decision tree, simple neural network).
• Model – the result after the algorithm has been trained; it stores the learned patterns.
• Hardware – CPU for small tasks; GPU or specialised chips for larger training jobs.
• Interface – how users or other programs give input and receive output (GUI, API, sensor).

6.3 Basic Operation Cycle

1. Collect data – sensors, databases, or user input.
2. Pre‑process – clean data, normalise values, extract useful features.
3. Train – run the algorithm on the prepared data to create a model.
4. Validate – test the model on unseen data and record its accuracy.
5. Deploy (Inference) – use the trained model to make predictions on new inputs.
6. Monitor & Update – check performance over time and retrain if needed.

6.4 Simple Example – Spam‑filter

1. Gather a set of emails labelled “spam” or “not spam”.
2. Convert each email to a list of word frequencies (pre‑processing).
3. Train a decision‑tree algorithm to separate the two classes.
4. Validate using a separate batch of emails; obtain, for example, 95 % accuracy.
5. Deploy the model in an email client – new messages are classified as spam or not.
6. Periodically add newly labelled emails and retrain to keep accuracy high.

---

7. Quick Reference Summary

Topic	Key Points	Typical Example
Data Representation	Binary, hex, ASCII/Unicode, image & sound basics	Convert 156₁₀ to binary → 10011100₂
Data Transmission	Packet structure, error detection, simple encryption	Parity bit for a 7‑bit byte
Hardware Architecture	CPU cycle, memory hierarchy, I/O devices, GPU for AI	Cache vs RAM speed comparison
Software & OS	Process management, file system, interrupts	Opening a file, reading a line, closing
Internet & Cyber‑Security	HTTP/HTTPS, firewalls, phishing, encryption	Strong password policy
Algorithm Design	PD cycle, decomposition, trace tables	Maximum‑of‑three algorithm
Programming	Variables, selection, iteration, arrays, functions, file I/O	Pseudocode for average of three numbers
Databases	Single‑table design, primary key, basic SELECT	SQL query for students with grade ‘A’
Boolean Logic	Truth tables, gate symbols, simple circuit conversion	Expression (A AND B) OR NOT C
AI Systems	Data, algorithm, model, hardware, interface; operation cycle	Spam‑filter example
Emerging Tech	Robotics, digital currency, blockchain basics	Decentralised ledger concept

---

8. Alignment with Assessment Objectives (AO1‑AO3)

Section	AO1 – Knowledge	AO2 – Application	AO3 – Evaluation
Data Representation & Transmission	Identify binary, hexadecimal, ASCII, packet fields.	Convert numbers; decode a simple packet.	Discuss advantages of error‑detecting codes.
Hardware & Software	Recall CPU cycle, memory hierarchy, OS functions.	Explain how a sensor signal reaches an actuator.	Evaluate CPU vs GPU for a given task.
Algorithm Design & Programming	List the stages of the program development cycle.	Write pseudocode for a given problem; produce a trace table.	Critique an algorithm for efficiency and readability.
Databases	Define primary key, data types, basic SQL syntax.	Design a simple table and write a SELECT query.	Assess the impact of data redundancy.
Boolean Logic & Logic Gates	Construct truth tables; recognise gate symbols.	Convert a problem statement into a circuit.	Compare hardware cost of different gate implementations.
AI Systems	Identify data, algorithm, model, hardware, interface.	Apply the AI operation cycle to a new scenario (e.g., speech‑to‑text).	Discuss ethical issues such as bias, privacy, and resource use.
Emerging Technologies	Describe sensor‑processor‑actuator loop; name blockchain basics.	Design a simple automated garden‑watering system.	Evaluate societal impact of robots and digital currencies.

---

9. Summary

The Cambridge IGCSE Computer Science syllabus interlinks fundamental computer‑systems knowledge, algorithmic problem solving, programming skills, databases, Boolean logic, and emerging technologies such as AI, robotics and blockchain. Understanding each topic, how they relate to one another, and being able to apply, test and evaluate solutions equips learners to meet all assessment objectives for the 0478 examination.