Spec Detail

p1 Paper 1 - Computer Systems

Duration 105 min · Marks 75 · Weighting 50.00 · Structure flexible_structured · Question count flexible_total_marks · Assembly exact_total_marks

Patterns: 5

p2 Paper 2 - Algorithms, Programming and Logic

Duration 105 min · Marks 75 · Weighting 50.00 · Structure flexible_structured_with_scenario · Question count flexible_total_marks · Assembly exact_total_marks

Patterns: 7

1 Data representation

• 1.1 Number systems 5 outcomes
  • 1.1.1 Define binary, denary and hexadecimal number systems. p1
  • 1.1.2 Convert positive integers between binary, denary and hexadecimal. p1
  • 1.1.3 Add binary numbers and identify overflow. p1
  • 1.1.4 Explain why hexadecimal is used to represent binary data. p1
  • 1.1.5 Represent positive and negative integers using two’s complement. p1
• 1.2 Text, sound and images 5 outcomes
  • 1.2.1 Describe how characters are represented using character sets. p1
  • 1.2.2 Explain the purpose of ASCII and Unicode. p1
  • 1.2.3 Calculate file sizes for bitmap images using resolution and colour depth. p1
  • 1.2.4 Describe how sampling resolution and sampling rate affect sound quality. p1
  • 1.2.5 Explain how pixel data and metadata are stored for images. p1
• 1.3 Data storage and compression 5 outcomes
  • 1.3.1 Describe units of data storage from bit to terabyte. p1
  • 1.3.2 Calculate data storage requirements for text, sound and images. p1
  • 1.3.3 Explain the need for data compression. p1
  • 1.3.4 Compare lossy and lossless compression. p1
  • 1.3.5 Describe run-length encoding and how it reduces file size. p1

2 Data transmission

• 2.1 Types and methods of data transmission 5 outcomes
  • 2.1.1 Describe simplex, half-duplex and full-duplex transmission. p1
  • 2.1.2 Compare serial and parallel data transmission. p1
  • 2.1.3 Explain packet switching and the role of packets. p1
  • 2.1.4 Describe packet headers, payload and trailers. p1
  • 2.1.5 Explain how data is transmitted over wired and wireless media. p1
• 2.2 Methods of error detection 4 outcomes
  • 2.2.1 Describe parity check as an error detection method. p1
  • 2.2.2 Explain checksum and how it can detect transmission errors. p1
  • 2.2.3 Describe echo check and ARQ. p1
  • 2.2.4 Compare error detection methods including parity check, checksum and ARQ. p1
• 2.3 Encryption 4 outcomes
  • 2.3.1 Explain why encryption is used when transmitting data. p1
  • 2.3.2 Describe symmetric encryption. p1
  • 2.3.3 Describe asymmetric encryption using public and private keys. p1
  • 2.3.4 Compare symmetric and asymmetric encryption. p1

3 Hardware

• 3.1 Computer architecture 5 outcomes
  • 3.1.1 Describe the purpose of the CPU. p1
  • 3.1.2 Explain the Von Neumann architecture. p1
  • 3.1.3 Describe the fetch–decode–execute cycle. p1
  • 3.1.4 Identify the roles of registers including PC, MAR, MDR, CIR and ACC. p1
  • 3.1.5 Explain how clock speed, cache size and number of cores affect performance. p1
• 3.2 Input and output devices 4 outcomes
  • 3.2.1 Identify suitable input devices for given applications. p1
  • 3.2.2 Identify suitable output devices for given applications. p1
  • 3.2.3 Describe sensors and actuators in monitoring and control systems. p1
  • 3.2.4 Compare advantages and disadvantages of different input and output devices. p1
• 3.3 Data storage 4 outcomes
  • 3.3.1 Describe RAM and ROM. p1
  • 3.3.2 Compare primary, secondary and off-line storage. p1
  • 3.3.3 Explain magnetic, optical and solid-state storage. p1
  • 3.3.4 Select suitable storage media for a given scenario. p1
• 3.4 Network hardware 4 outcomes
  • 3.4.1 Describe the role of routers, switches, hubs, modems and wireless access points. p1
  • 3.4.2 Explain NICs, MAC addresses and IP address use on networks. p1
  • 3.4.3 Compare LAN and WAN. p1
  • 3.4.4 Describe client-server and peer-to-peer networks. p1

4 Software

• 4.1 Types of software and interrupts 4 outcomes
  • 4.1.1 Describe system software and application software. p1
  • 4.1.2 Explain the role of operating systems. p1
  • 4.1.3 Describe interrupts and interrupt handling. p1
  • 4.1.4 Explain utilities including compression, backup and antivirus software. p1
• 4.2 Types of programming language, translators and integrated development environments 4 outcomes
  • 4.2.1 Compare high-level and low-level languages. p1
  • 4.2.2 Describe assembly language and machine code. p1
  • 4.2.3 Explain the roles of compiler, interpreter and assembler. p1
  • 4.2.4 Describe features of an IDE including editor, error diagnostics and run-time environment. p1

5 The internet and its uses

• 5.1 The internet and the World Wide Web 4 outcomes
  • 5.1.1 Describe the internet and the World Wide Web. p1
  • 5.1.2 Explain URL, IP address and DNS. p1
  • 5.1.3 Describe web browsers and web servers. p1
  • 5.1.4 Explain how HTML and CSS are used in web pages. p1
• 5.2 Digital currency 4 outcomes
  • 5.2.1 Describe digital currency and cryptocurrency. p1
  • 5.2.2 Explain blockchain as a distributed ledger. p1
  • 5.2.3 Discuss advantages and disadvantages of digital currency. p1
  • 5.2.4 Explain security issues linked to digital payments. p1
• 5.3 Cyber security 4 outcomes
  • 5.3.1 Describe malware, phishing, pharming and social engineering. p1
  • 5.3.2 Explain brute-force attacks, DoS and data interception. p1
  • 5.3.3 Describe firewalls, passwords, authentication and anti-malware. p1
  • 5.3.4 Evaluate methods used to protect data and systems. p1

6 Automated and emerging technologies

• 6.1 Automated systems 4 outcomes
  • 6.1.1 Describe automated systems using sensors, microprocessors and actuators. p1
  • 6.1.2 Explain feedback in monitoring and control systems. p1
  • 6.1.3 Evaluate benefits and drawbacks of automation. p1
  • 6.1.4 Apply automated system concepts to a given scenario. p1
• 6.2 Robotics 4 outcomes
  • 6.2.1 Describe characteristics of robots. p1
  • 6.2.2 Explain uses of robots in industry, medicine and transport. p1
  • 6.2.3 Evaluate advantages and disadvantages of using robots. p1
  • 6.2.4 Describe how sensors and actuators support robotic operation. p1
• 6.3 Artificial intelligence 4 outcomes
  • 6.3.1 Describe artificial intelligence and machine learning. p1
  • 6.3.2 Explain expert systems and inference engines. p1
  • 6.3.3 Discuss benefits and risks of AI systems. p1
  • 6.3.4 Identify suitable applications for AI. p1

7 Algorithm design and problem-solving

• 7.1 Program development life cycle and decomposition 4 outcomes
  • 7.1.1 Describe analysis, design, coding, testing and maintenance. p2
  • 7.1.2 Use decomposition to break a problem into sub-problems. p2
  • 7.1.3 Identify inputs, processes and outputs for a problem. p2
  • 7.1.4 Produce an algorithm design for a specified problem. p2
• 7.2 Standard algorithms and solution methods 4 outcomes
  • 7.2.1 Describe sequence, selection and iteration. p2
  • 7.2.2 Write algorithms using assignment, input and output. p2
  • 7.2.3 Apply linear search and bubble sort. p2
  • 7.2.4 Use counting, totalling and finding maximum or minimum algorithms. p2
• 7.3 Validation, verification and test data 4 outcomes
  • 7.3.1 Distinguish validation and verification. p2
  • 7.3.2 Select normal, abnormal, boundary and extreme test data. p2
  • 7.3.3 Complete a test plan for an algorithm. p2
  • 7.3.4 Explain validation checks including range, type, length and presence checks. p2
• 7.4 Trace tables, dry runs and error correction 4 outcomes
  • 7.4.1 Complete trace tables for pseudocode algorithms. p2
  • 7.4.2 Dry-run algorithms to determine outputs. p2
  • 7.4.3 Identify syntax, logic and run-time errors. p2
  • 7.4.4 Correct errors in algorithms. p2
• 7.5 Writing and amending algorithms 4 outcomes
  • 7.5.1 Write pseudocode algorithms for a given problem. p2
  • 7.5.2 Amend an existing algorithm to meet changed requirements. p2
  • 7.5.3 Use flowchart symbols to represent algorithms. p2
  • 7.5.4 Explain algorithm efficiency for simple solutions. p2

8 Programming

• 8.1 Programming concepts 5 outcomes
  • 8.1.1 Use constants and variables in programs. p2
  • 8.1.2 Use data types including integer, real, char, string and Boolean. p2
  • 8.1.3 Write code in pseudocode, Python, Visual Basic or Java. p2
  • 8.1.4 Use arithmetic, relational and Boolean operators. p2
  • 8.1.5 Use procedures, functions and parameters. p2
• 8.2 Arrays 4 outcomes
  • 8.2.1 Declare and use one-dimensional arrays. p2
  • 8.2.2 Declare and use two-dimensional arrays. p2
  • 8.2.3 Traverse arrays using loops. p2
  • 8.2.4 Apply arrays to store and process data sets. p2
• 8.3 File handling 4 outcomes
  • 8.3.1 Open, read from, write to and close files. p2
  • 8.3.2 Describe serial file handling operations. p2
  • 8.3.3 Use file handling in an algorithm. p2
  • 8.3.4 Explain common file handling errors. p2

9 Databases

• 9.1 Single-table databases and data types 4 outcomes
  • 9.1.1 Describe fields, records and tables in a single-table database. p2
  • 9.1.2 Select suitable data types for fields. p2
  • 9.1.3 Explain validation checks in databases. p2
  • 9.1.4 Interpret a database table. p2
• 9.2 Primary keys 4 outcomes
  • 9.2.1 Define a primary key. p2
  • 9.2.2 Select a suitable primary key for a table. p2
  • 9.2.3 Explain why primary keys must be unique. p2
  • 9.2.4 Describe problems caused by duplicate keys. p2
• 9.3 SQL queries 4 outcomes
  • 9.3.1 Write SQL SELECT queries. p2
  • 9.3.2 Use WHERE, ORDER BY and simple operators in SQL. p2
  • 9.3.3 Interpret the output from an SQL query. p2
  • 9.3.4 Correct errors in SQL statements. p2

10 Boolean logic

• 10.1 Logic gates and symbols 4 outcomes
  • 10.1.1 Identify AND, OR, NOT, NAND, NOR and XOR gates. p2
  • 10.1.2 Draw standard logic gate symbols. p2
  • 10.1.3 Describe the function of each logic gate. p2
  • 10.1.4 Complete truth tables for individual gates. p2
• 10.2 Logic circuits 4 outcomes
  • 10.2.1 Draw logic circuits from a logic expression. p2
  • 10.2.2 Write a logic expression from a circuit. p2
  • 10.2.3 Trace signals through a logic circuit. p2
  • 10.2.4 Simplify simple logic circuit descriptions. p2
• 10.3 Truth tables and logic expressions 4 outcomes
  • 10.3.1 Complete truth tables for combined logic expressions. p2
  • 10.3.2 Use Boolean operators AND, OR, NOT, NAND, NOR and XOR. p2
  • 10.3.3 Compare equivalent logic expressions. p2
  • 10.3.4 Evaluate a logic expression for given inputs. p2