Menu
Exam Questions

Edexcel GCSE Computer Science (1CP2) Exam Questions

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

10 questions · 18 marks

Pick again
Print
1Multiple choice1 markBinary and Hexadecimal Basics Swap Remove

A computer stores data using binary patterns.

Identify the number of unique states that can be represented by a 4-bit binary pattern.

[1 mark]
  • A4
  • B8
  • C16
  • D32
Mark scheme
  • C 16 (1)
  • The only correct answer is C. The correct answer is 16.
  • A is not correct because 4 is the number of bits in the pattern, not the number of states it can represent
  • B is not correct because 8 is the number of states a 3-bit pattern can represent
  • D is not correct because 32 is the number of states a 5-bit pattern can represent
Example answers and how they were marked
Full marks1/1

C 16

Why: Correct option: a 4-bit pattern can represent 2^4 = 16 unique states (1).

No marks0/1

B 8

Why: Near-miss: 8 is the number of states a 3-bit pattern can represent, not a 4-bit pattern (0).

No marks0/1

A 4

Why: Misconception: 4 is the number of bits in the pattern, not the number of unique states it can represent (0).

2Multiple choice1 markBinary and Hexadecimal Basics Swap Remove

Programmers often use hexadecimal notation.

Identify why programmers use hexadecimal notation.

[1 mark]
  • AIt uses fewer digits than binary to represent the same value
  • BIt can represent a wider range of values than binary
  • CIt is processed directly by the computer without conversion
  • DIt uses only the digits 0 to 9
Mark scheme
  • A It uses fewer digits than binary to represent the same value (1)
  • The only correct answer is A. The correct answer is that hexadecimal uses fewer digits than binary to represent the same value.
  • B is not correct because binary can represent the same range of values for a given number of bits
  • C is not correct because a computer processes binary data and instructions, so hexadecimal must be converted before it is processed
  • D is not correct because hexadecimal uses the digits 0 to 9 and the letters A to F
Example answers and how they were marked
Full marks1/1

A It uses fewer digits than binary to represent the same value

Why: Correct option: one hexadecimal digit represents four bits, so fewer digits are needed than binary (1).

No marks0/1

B It can represent a wider range of values than binary

Why: Near-miss: for a given number of bits, binary and hexadecimal represent the same range of values, so this is not the reason (0).

No marks0/1

D It uses only the digits 0 to 9

Why: Misconception: hexadecimal also uses A to F; using only 0 to 9 describes denary (0).

3Convert1 markBinary to Denary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the binary pattern 0110 1001 to denary.

[1 mark]
Mark scheme

Award one mark for:

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

105

Why: Correct: 64 + 32 + 8 + 1 = 105 (1).

No marks0/1

150

Why: Reads the place values from the wrong end (the left-hand bit as 1), so the value is wrong.

No marks0/1

4

Why: Counts the 1s instead of adding their place values.

4Convert2 marksDenary to Binary Conversion Swap Remove

Computers manipulate binary patterns.

Convert the denary number 72 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 0100 (1)
  • 1000 (1)

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

Example answers and how they were marked
Full marks2/2

0100 1000

Why: 72 = 64 + 8: both nibbles are correct (2).

Some marks1/2

0100 1001

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

No marks0/2

0001 0010

Why: The bits are written in reverse, smallest place value first. Neither nibble is correct.

5Convert2 marksDenary to Binary Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the denary number 13 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 0000 (1)
  • 1101 (1)

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

Example answers and how they were marked
Full marks2/2

0000 1101

Why: 13 = 8 + 4 + 1: both nibbles are correct (2).

Some marks1/2

0000 1110

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

No marks0/2

1011 0000

Why: The bits are written in reverse, smallest place value first. Neither nibble is correct.

6Convert2 marksDenary to Hexadecimal Conversion Swap Remove

Computer systems manipulate bit patterns.

Convert the denary number 244 to hexadecimal.

[2 marks]
Mark scheme

Award one mark for each correct digit in the correct position:

  • F (1)
  • 4 (1)

Answer: F4

Example answers and how they were marked
Full marks2/2

F4

Why: 244 ÷ 16 = 15 remainder 4, so the digits are F and 4: both digits are correct (2).

Some marks1/2

154

Why: One digit is correct (1), but a digit over 9 is written in denary instead of as a letter.

No marks0/2

4F

Why: The digits are the wrong way round, so neither is in the correct position.

7Convert2 marksHexadecimal to Binary Conversion Swap Remove

Binary, denary and hexadecimal patterns represent numbers.

Convert the hexadecimal number B7 to 8-bit binary.

[2 marks]
Mark scheme

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

  • 1011 (1)
  • 0111 (1)

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

Example answers and how they were marked
Full marks2/2

1011 0111

Why: Each digit is 4 bits: B = 1011, 7 = 0111 (2).

Some marks1/2

1011 1000

Why: Converts 7 as if it were the next digit up. The first nibble is correct (1); the second is not.

No marks0/2

0111 1011

Why: The nibbles are in the wrong order. Neither nibble is correct.

8Calculate2 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.

9Calculate2 marksBinary Shifts Swap Remove

Computer systems manipulate bit patterns.

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

[2 marks]
Binary patternShift8-bit binary result
1000 0111Logical shift right by 1
Mark scheme

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

  • 0100 (1)
  • 0011 (1)

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

Example answers and how they were marked
Full marks2/2

0100 0011

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

Some marks1/2

0100 0010

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

No marks0/2

0000 1110

Why: Shifts the bits the wrong way. Neither nibble is correct.

10Calculate3 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
10111001
10111100
Mark scheme

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

  • 0111 (1)
  • 0101 (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

0111 0101

Why: 185 + 188 = 373, which needs 9 bits; the 8 bits that are kept are both correct (2).

Some marks1/2

0000 0101

Why: Forgets to carry the 1s. The second nibble is correct (1); the first is not.

No marks0/2

1011 1101

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

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.