Menu

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 · 7 marks

Pick again
Print
1Multiple choice1 markCharacter Sets Swap Remove

A new character set must be able to represent 70 different characters.

Identify the minimum number of bits needed to represent each character.

[1 mark]
  • A6
  • B7
  • C8
  • D70
Mark scheme
  • B 7 (1)
  • The only correct answer is B. The correct answer is 7.
  • A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
  • C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
  • D is not correct because 70 is the number of characters needed, not a number of bits
Example answers and how they were marked
Full marks1/1

B 7

Why: The only correct answer: 7 bits give 128 combinations, enough for 70 characters, and it is the smallest number of bits that does (1).

No marks0/1

C 8

Why: Distractor, no credit: a single-tick item has no partial credit, and 8 bits is not the minimum because 7 bits already give 128 combinations, so the scheme's C line gives no mark.

No marks0/1

A 6

Why: Misconception, no credit: 6 bits give only 64 combinations, which cannot represent 70 different characters, so the scheme's A line gives no mark.

2Short recall2 marksStored Program Computers Swap Remove

The central processing unit (CPU) contains an arithmetic logic unit (ALU).

State two types of operation carried out by the ALU.

[2 marks]
Mark scheme

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

  • An arithmetic operation, e.g. addition/subtraction/multiplication/division (1)
  • A logical operation, e.g. comparing two values (is A > B?) / using AND, OR, NOT (1)

Do not accept decoding instructions, fetching instructions or controlling the timing of the CPU, as these are carried out by the control unit.

Example answers and how they were marked
Full marks2/2

It carries out arithmetic operations such as addition and subtraction, and logical operations such as comparing two values to see if one is greater than the other.

Why: Arithmetic operation (1) and logical operation (1).

Some marks1/2

It adds numbers together and works out the result.

Why: Arithmetic operation, addition (1). No logical operation.

No marks0/2

It decodes the instructions that have been fetched from main memory.

Why: Decoding and fetching are the control unit's role; the mark scheme's do-not-accept line covers this.

3Short recall2 marksCompression Swap Remove

Images and sound can be stored using lossy compression.

Define the term lossy compression.

[2 marks]
Mark scheme

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

  • Reduces the size of a file (1)
  • Permanently removes/loses some data (1)
  • The original file cannot be recreated/restored exactly (1)

Allow 'some data is deleted/discarded and cannot be recovered' for the second mark.

Do not award the first mark where the response also states that no data is lost.

Do not accept 'removes repeated data' (this describes lossless compression).

Example answers and how they were marked
Full marks2/2

Lossy compression reduces the size of a file by permanently removing some data, so the original cannot be restored exactly.

Why: Reduces the size of a file (1); permanently removes some data (1); maximum two marks awarded.

Some marks1/2

It makes a file smaller.

Why: Reduces the size of a file (1); no reference to data being permanently lost.

No marks0/2

It makes a file smaller without losing any of the data.

Why: States that no data is lost, which describes lossless compression; the first mark is not awarded.

4Calculate2 marksAdding Binary Numbers Swap Remove

Binary patterns can represent numbers.

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

[2 marks]
1286432168421
10010110
01011100
Mark scheme

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

  • 1111 (1)
  • 0010 (1)

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

Example answers and how they were marked
Full marks2/2

1111 0010

Why: 150 + 92 = 242, carrying where a column adds to 2: both nibbles are correct (2).

Some marks1/2

1111 0011

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

No marks0/2

1101 1110

Why: Writes 1 in every column with a 1 and never carries. Neither nibble is correct.

Questions by topic

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

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.