Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 693 exam-style questions, each with its mark scheme and example answers. Print it, or answer it on paper and then open the mark schemes. Or browse the questions by topic.

Build a paper

Topics (none ticked: all of them)
Question types (none ticked: all of them)

Practice paper

2 questions · 4 marks

Pick again
Print
1Describe2 marksSound Swap Remove

An analogue sound wave is sampled and stored as binary.

Describe how the amplitude of the sound wave is represented in binary.

[2 marks]
Mark scheme

Award up to two marks for a linked description such as:

  • The height of the wave is measured at each sample (1) and stored as a binary value (1)
  • The amplitude at a sample point is converted into a binary number using the bit depth (1) so each sample stores the height of the wave (1)
  • A larger amplitude is stored as a larger binary value (1) so louder parts of the sound are represented by higher values (1)

Do not accept answers that only define amplitude as the height/loudness of the wave.

Do not accept answers about the number of samples taken each second (sample rate).

Example answers and how they were marked
Full marks2/2

The height of the wave is measured at each sample point and this height is stored as a binary number.

Why: Gives the linked points: amplitude measured at each sample (1) and stored as a binary value (1).

Some marks1/2

The amplitude is measured at each sample.

Why: Gives the first point, measurement at each sample (1), but does not link it to being stored as a binary value.

No marks0/2

The amplitude is the number of samples taken every second.

Why: Confuses amplitude with sample rate; neither creditworthy point is given.

2Explain2 marksCharacter Sets Swap Remove

Characters typed on a keyboard are stored using ASCII.

Explain how the computer encodes the letter A using ASCII.

[2 marks]
Mark scheme

Award up to two marks for a linked explanation such as:

  • The computer looks up the character in the ASCII character set/table (1) to find the code that represents it (1)
  • Each character has its own unique ASCII code (1) so the letter A is converted to and stored as a 7-bit binary pattern (1)
  • ASCII uses 7 bits for each character (1) so A is stored as its ASCII code 1000001 (binary) / 65 (denary) (1)

The second mark requires a linked expansion, so a point on its own (e.g. 'A has the code 65') can only earn one mark.

For both marks, the expansion must follow/associate with the statement.

Accept an 8-bit pattern with a leading 0 (e.g. 01000001) as the binary code for A.

Do not accept 'the character is stored as text' without saying it is changed into a code/binary.

Do not accept a binary value on its own (e.g. 1000001) without saying that it is the ASCII code/that the character is converted to it.

Example answers and how they were marked
Full marks2/2

The computer finds the unique ASCII code for A, which is 65 in denary, and stores it as the 7-bit binary pattern 1000001.

Why: Linked point that A is given its unique ASCII code (1) and reason/expansion that it is converted to and stored as a 7-bit binary pattern (1).

Some marks1/2

The computer changes the letter A into a number.

Why: Gives the point that the character is given a code/number (1) but no linked expansion saying it is converted to binary or stored, so stays on one mark.

No marks0/2

The letter A is stored as the number 1 because it is the first letter of the alphabet.

Why: Wrong reason and no creditworthy point: it does not say that the character is given its ASCII code and converted to binary.

Questions by topic

2.1 Binary

Build a paper on this topic 58
Adding Binary Numbers 6 questions Binary and Hexadecimal Basics 10 questions Binary Shifts 6 questions Binary to Denary Conversion 6 questions Binary to Hexadecimal Conversion 6 questions Denary to Binary Conversion 6 questions Denary to Hexadecimal Conversion 6 questions Denary to Negative Binary Conversion 6 questions Hexadecimal to Binary Conversion 6 questions

2.2 Data representation

Build a paper on this topic 56
Character Sets 18 questions Images 19 questions Sound 19 questions

2.3 Data storage and compression

Build a paper on this topic 24
Compression 18 questions Units & Conversion 6 questions

3.1 Hardware

Build a paper on this topic 77
Embedded Systems 17 questions Fetch Decode Execute Cycle 15 questions Primary Memory 15 questions Secondary Memory 15 questions Stored Program Computers 15 questions

3.2 Software

Build a paper on this topic 124
File Management 18 questions Memory Management 16 questions Peripheral Management 11 questions Process Management 12 questions Purpose & Function of Operating Systems 17 questions Software Basics 13 questions User Management 18 questions Utility Software 19 questions

3.3 Programming languages

Build a paper on this topic 37
Low and High Level Languages 19 questions Translators 18 questions

4.1 Networks

Build a paper on this topic 138
Addressing 16 questions LANs & WANs 16 questions Network Speed 5 questions Packet Switching 16 questions Protocols & Layers 17 questions The Internet 16 questions Topologies 17 questions Wired Connections 17 questions Wireless Connections 18 questions

4.2 Network security

Build a paper on this topic 36
Network Security Risks 18 questions Preventing Network Security Risks 18 questions

5.1 Environmental

Build a paper on this topic 36
E-waste 17 questions Manufacturing Technology 19 questions

5.2 Ethical and legal

Build a paper on this topic 71
Data Protection Act 17 questions Impact of AI 18 questions Intellectual Property 18 questions Software Licences 18 questions

5.3 Cybersecurity

Build a paper on this topic 36
Malware 18 questions Social Engineering 18 questions

More ways to revise Edexcel GCSE Computer Science (1CP2)

Activities Flashcards Revision notes

Teachers: build a paper, print it with the mark schemes at the end, and sign your school up to set your classes activities on every topic.

Fetch Decode Explain isn't affiliated with or endorsed by Pearson Edexcel.