Menu

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

3 questions · 5 marks

Pick again
Print
1Multiple choice1 markAddressing Swap Remove

A technician is checking the IP addresses of the devices on a network.

Identify the valid IPv4 address.

[1 mark]
  • A192.168.1
  • B192.168.1.1
  • C192.168.1.1.1
  • D192.168.1.256
Mark scheme
  • B 192.168.1.1 (1)
  • The only correct answer is B. The correct answer is 192.168.1.1.
  • A is not correct because it is an incomplete address with only three numbers, not four
  • C is not correct because it is an address with five numbers, not four
  • D is not correct because it contains 256, which is outside the range 0 to 255
Example answers and how they were marked
Full marks1/1

B 192.168.1.1

Why: Correct option (1): an IPv4 address is four numbers, each from 0 to 255, separated by dots.

No marks0/1

D 192.168.1.256

Why: Near miss: it has four numbers but 256 is outside the range 0 to 255 (mark scheme line D), so no mark.

No marks0/1

A 192.168.1

Why: It has only three numbers, so it is not a complete IPv4 address (mark scheme line A), so no mark.

2Describe2 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.

3Convert2 marksDenary to Binary Conversion Swap Remove

Binary patterns can represent numbers.

Convert the denary number 199 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1100 (1)
  • 0111 (1)

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

Example answers and how they were marked
Full marks2/2

1100 0111

Why: 199 = 128 + 64 + 4 + 2 + 1: both nibbles are correct (2).

Some marks1/2

1100 1000

Why: Converts 200 instead (a slip in adding up the place values). The first nibble is correct (1); the second is not.

No marks0/2

1110 0011

Why: The bits are written in reverse, smallest place value first. 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.