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 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 marksFile Management Swap Remove

File management is one function of an operating system.

Describe what the operating system does to the folder structure when a file is moved to a different folder.

[2 marks]
Mark scheme

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

  • Updates/changes the location/path stored for the file (1) so the file can be found in its new folder/location (1)
  • Removes the file's entry/reference from the old folder (1) so the file no longer appears/is listed there (1)
  • Adds/creates an entry/reference for the file in the new folder (1) so the file appears/is listed in its new location (1)
  • Updates the folder/directory listing/structure (1) to show the file's new location/path (1)

Do not accept descriptions of copying the file or leaving a duplicate in the old folder.

Do not accept deleting and recreating the file, or moving the file's data to a different physical location on the disk; the marks are for updating the folder/directory structure.

Example answers and how they were marked
Full marks2/2

It updates the location stored for the file so the file can be found in its new folder.

Why: Linked point (1) and development/outcome (1).

Some marks1/2

It removes the file's entry from the old folder.

Why: Creditworthy point (1) but no linked development.

No marks0/2

It deletes the file from the old folder and saves it again in the new folder.

Why: Describes deleting and recreating the file, which the mark scheme does not accept.

4Calculate2 marksAdding Binary Numbers Swap Remove

Computer systems manipulate bit patterns.

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

[2 marks]
1286432168421
10111000
00011111
Mark scheme

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

  • 1101 (1)
  • 0111 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0111

Why: 184 + 31 = 215, carrying where a column adds to 2: both nibbles are correct (2).

Some marks1/2

1010 0111

Why: Writes 0 for 1 + 1 but forgets to carry the 1. The second nibble is correct (1); the first is not.

No marks0/2

1011 1111

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.