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

Characters are encoded using 7-bit ASCII.

Identify the number of different characters that can be represented using 7-bit ASCII.

[1 mark]
  • A64
  • B127
  • C128
  • D256
Mark scheme
  • C 128 (1)
  • The only correct answer is C. The correct answer is 128.
  • A is not correct because 6 bits give only 64 different combinations
  • B is not correct because 127 is the largest 7-bit value, not the number of characters that 7 bits can represent
  • D is not correct because 256 characters need 8 bits, as used by 8-bit extended ASCII
Example answers and how they were marked
Full marks1/1

C 128

Why: Selects the only correct option (1): 7 bits give 2 to the power of 7, which is 128 different characters.

No marks0/1

D 256

Why: Near miss scoring 0: 256 is the number of characters that 8 bits give in extended ASCII, not 7-bit ASCII.

No marks0/1

B 127

Why: Misconception scoring 0, the off-by-one error the examiners' report describes: 127 is the largest 7-bit value, but 7 bits give 128 different characters.

2Short recall2 marksCompression Swap Remove

Files can be compressed before they are stored.

Define the term lossless compression.

[2 marks]
Mark scheme

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

  • Reduces/makes the size of a file smaller (1)
  • No data is lost/removed (during compression) (1)
  • The original file/data can be recreated/restored exactly (1)

Allow 'the compressed file takes up less storage space' for the first mark.

The second and third bullets are two ways of making the same point: award a maximum of one mark for them, so a response that says no data is lost and that the original file can be restored, but does not say the file is smaller, scores one mark.

Do not accept descriptions of lossy compression, e.g. 'it removes data that is not needed to make the file smaller'.

Ignore reference to download/transmission times, bandwidth and streaming, as these are benefits of compression and not part of the definition.

Example answers and how they were marked
Full marks2/2

Lossless compression reduces the size of a file without permanently removing any data, so the original file can be restored exactly.

Why: Reduces the size of a file (1) and no data is lost, so the original can be restored exactly (1); maximum of two marks reached.

Some marks1/2

It makes a file smaller so it downloads more quickly.

Why: Reduces the size of a file (1); the faster download is ignored as a benefit, not part of the definition.

No marks0/2

It removes data that is not needed to make the file smaller.

Why: Describes lossy compression, which the do-not-accept line rules out, so the mention of making the file smaller is not credited.

3Describe2 marksLow and High Level Languages Swap Remove

A programmer has written a program in assembly language.

Describe why it is necessary to translate the program into machine code before it can be run.

[2 marks]
Mark scheme

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

  • The processor/CPU can only execute machine code/binary instructions (1) so the assembly instructions must be converted into machine code before the program can run (1)
  • Each assembly instruction/mnemonic matches/corresponds to one machine code instruction (1) so each line must be replaced with the machine code the processor executes (1)
  • The program is written using mnemonics (1) that must be translated into machine code for the processor to carry out the instructions (1)
  • The hardware/processor does not understand assembly language directly (1) so it must be translated into machine code that the processor can execute (1)

Do not accept 'assembly language is a low-level language'.

Do not accept 'it is hard to understand' or 'it is not English'.

Do not accept benefits, such as 'machine code runs faster' or 'the program will run more quickly'.

Do not accept 'an assembler/a translator converts it' on its own, with no reference to the processor only being able to execute machine code/binary.

Do not accept responses about high-level languages or about compilers/interpreters.

Example answers and how they were marked
Full marks2/2

The processor can only execute machine code, so the assembly instructions must be converted into machine code before the program can run.

Why: States what the processor can execute (1) and links it to converting the program's instructions into machine code (1).

Some marks1/2

Each assembly instruction matches one machine code instruction.

Why: Correct point about the one-to-one match (1) but no development saying that this is because the processor only executes machine code.

No marks0/2

Because an assembler translates assembly language into machine code.

Why: Names the translator but gives no reason tied to the processor only being able to execute machine code, so no mark; this is in the 'Do not accept' guidance.

4Calculate2 marksBinary Shifts Swap Remove

Binary, denary and hexadecimal patterns represent numbers.

Complete the table with the result of applying the shift to the binary pattern.

[2 marks]
Binary patternShift8-bit binary result
1010 1100Arithmetic shift right by 1
Mark scheme

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

  • 1101 (1)
  • 0110 (1)

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

Example answers and how they were marked
Full marks2/2

1101 0110

Why: Every bit moves 1 place right, with copies of the sign bit (1) in from the left: both nibbles are correct (2).

Some marks1/2

0101 0110

Why: Fills the gap on the left with 0s, as a logical shift would, instead of copying the sign bit. The second nibble is correct (1); the first is not.

No marks0/2

0101 1000

Why: Shifts the bits the wrong way. 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.