Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

Build a practice paper from 604 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

4 questions · 8 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

ASCII is a character set used for representing text.

Identify the number of bits used to encode each character in ASCII.

[1 mark]
  • A6
  • B7
  • C8
  • D16
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7 bits.
  • A is not correct because 6 bits give only 64 different characters
  • C is not correct because 8 bits are used by extended ASCII to give 256 characters
  • D is not correct because 16 bits give 65 536 different characters, which is far more than the 128 in ASCII
Example answers and how they were marked
Full marks1/1

B 7

Why: B is the only correct answer: each ASCII character is encoded using 7 bits (1).

No marks0/1

C 8

Why: Near miss scoring 0: 8 bits is extended ASCII, and the scheme's C line says extended ASCII, not ASCII, is not the answer.

No marks0/1

A 6

Why: Misconception scoring 0: 6 bits give only 64 different characters, so it cannot be ASCII.

2Short recall2 marksUnits & Conversion Swap Remove

Data storage is measured in binary multiples.

Define the term bit.

[2 marks]
Mark scheme

Award one mark for any of the following up to a maximum of two marks:

  • A binary digit (1)
  • Has the value 0 or 1 (1)
  • The smallest unit of data storage (1)
  • A single 0 or 1 (1)

Allow binary digit/binary place value for binary digit

Allow a single binary digit for a single 0 or 1

Do not accept a group of 8 bits/half a nibble of 4 bits, which describe a byte or a nibble

Do not accept a binary number/binary on its own

Example answers and how they were marked
Full marks2/2

A binary digit that can have the value 0 or 1.

Why: A binary digit (1) and has the value 0 or 1 (1).

Some marks1/2

It is the smallest unit of data storage.

Why: Smallest unit of data storage (1), but does not state that it is a binary digit or that it has the value 0 or 1.

No marks0/2

A group of 8 bits.

Why: Describes a byte, not a bit; no creditworthy point and named in the Do not accept line.

3Describe2 marksUtility Software Swap Remove

A computer can lose power while a file is being saved.

Describe what file repair software does.

[2 marks]
Mark scheme

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

  • Attempts to repair/rebuild the corrupted file (1) so that it can be opened by its program again (1)
  • Recovers/retrieves the parts of the file that can still be read (1) so that the user does not lose all of the data in the file (1)
  • Reconstructs the file from data held in other parts of the disk (1) because part of the file/the disk is corrupted (1)
  • Saves a new/repaired copy of the file (1) as some of the data in it may not be recoverable (1)

Do not accept 'it repairs the file' on its own, as this repeats the question.

Do not accept responses about restoring a backup/previous version of the file, as this is backup software.

Do not accept responses about scanning for or removing malware.

Example answers and how they were marked
Full marks2/2

It recovers the parts of the file that can still be read (1) so that the user does not lose everything that was saved in it (1).

Why: The point (1) and a linked development giving the effect (1).

Some marks1/2

It rebuilds the damaged file from other parts of the disk.

Why: A valid point is made (1) but there is no development of what this achieves, so the second mark is not awarded.

No marks0/2

It restores the last backup of the file so the user gets the data back.

Why: This describes backup software, which the mark scheme does not accept for this question.

4Calculate3 marksAdding Binary Numbers Swap Remove

Computers manipulate binary patterns.

(a)

Complete the table to show the 8-bit result of the binary addition.

[2 marks]
1286432168421
11000001
01100011
Mark scheme

Award one mark for each correct nibble in the correct order:

  • 0010 (1)
  • 0100 (1)

0 marks if the response is not 8-bit binary.

Ignore a carry shown beyond the eighth bit.

Example answers and how they were marked
Full marks2/2

0010 0100

Why: 193 + 99 = 292, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0010 0101

Why: A slip in the last bit. The first nibble is correct (1); the second is not.

No marks0/2

1110 0011

Why: Never carries. Neither nibble is correct.

(b)

State the name of the error that occurs when this addition is carried out.

[1 mark]
Mark scheme

Award one mark for:

  • overflow (error) (1)
Example answers and how they were marked
Full marks1/1

Overflow

Why: The result needs more bits than are available (1).

No marks0/1

Underflow

Why: A near miss: the result is too big for 8 bits, not too small.

No marks0/1

A syntax error

Why: A syntax error is a mistake in a program's code, not in arithmetic.

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 18
Data Protection Act 14 questions Impact of AI 4 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.