Edexcel GCSE Computer Science (1CP2) Exam Questions

• A Address bus (1)
• The only correct answer is A. The correct answer is address bus. Do not accept 'address' on its own.
• B is not correct because the control bus carries control signals in both directions between the CPU and other components
• C is not correct because the data bus carries data in both directions between the CPU and main memory
• D is not correct because the system bus is the collection of all three buses

Award one mark for:

• Laser (1)

Allow laser beam

Do not accept read/write head

Do not accept pits

Do not accept lands

Do not accept reflective surface

Do not accept magnet/magnetic

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

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

• Makes a file/files smaller (1) so less storage space is needed on the disk (1)
• Reduces the size of the data (1) so it takes less time to upload/download/transfer the file (1)
• Compresses files/folders into a single file (1) so an attachment is under the size limit for email (1)
• Reduces the size of the files (1) so more of them fit onto a storage device/backup media (1)

Do not accept 'it compresses the files' on its own, as this repeats the question.

Do not accept responses about protecting files from malware/viruses or about deleting files.

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

• The compiler translates the whole program/complete source code in one go (1) whereas the interpreter translates one line/statement at a time (1)
• The compiler translates all of the source code before any of it is run/executed (1) but the interpreter translates each line/statement as it reads it (1)
• The interpreter translates one line/statement at a time (1) and the compiler translates the whole program/source code together (1)

Accept the compiler point and the interpreter point in either order.

Do not accept responses about object code/executable files, when the translated code is executed, how errors are reported, or speed/memory use.

Do not accept 'the interpreter executes/runs each line' on its own, without saying that it translates one line/statement at a time.

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

• Each router chooses the best route at the time (1) so when a route becomes busy/congested or fails, later packets are forwarded along a different path (1)
• Routers forward each packet separately (1) so the path a packet takes depends on the traffic conditions when that packet arrives (1)
• A router may send a packet to a different next router (1) if its routing table shows a better/less congested route for that packet (1)
• Traffic on the internet changes (1) so no single path is kept for the file and each packet can use whichever route is best when it is sent (1)

For both marks, the expansion must follow/associate with the statement.

Allow reference to a routing table, or to how a router decides the route, as part of the linked reason.

Do not accept 'the packets have different IP addresses' because all packets from the same file have the same destination IP address, even though their routes can differ.

Do not accept 'the internet is busy' or 'there is a lot of traffic' on its own without linking this to the router choosing a different route.

Do not accept 'different routers send the packets' on its own without a reason why a different router/route is chosen.

Do not accept an answer that only says the packets take different routes without explaining why.

Indicative content

Ease of learning, use and debug

• High-level language statements are written in English-like words and mathematical symbols, so the students can read the quiz game code and understand what each line does.
• The language is easier to learn than a low-level language, so students who are new to programming can start writing the quiz game quickly.
• Errors are easier to find and fix because the code is readable; for example, the students can check a line that updates a score against the rule they intended.
• The students do not need to know how the processor carries out each statement, so they can concentrate on the quiz questions and rules.

Data structures

• High-level languages provide lists or arrays, so the names and scores of all the players can be stored under one name and processed with a loop.
• A record can store a player's name and score as one item; in some languages a dictionary or class can be used instead, which keeps related data together.
• Using a data structure makes the code shorter and easier to understand than separate variables for every player's name and score.

Built-in functions and library routines

• High-level languages provide built-in functions such as print and input, so the students can display a question and read a player's answer without writing the underlying code.
• Library routines such as a random number generator can be used to choose quiz questions, saving the students time.
• String-handling routines can check or compare a player's answer, so the students do not have to write these routines themselves.
• Reusing tested routines reduces the amount of code the students write and can reduce errors in the quiz game.

Levels

• Level 0 (0 marks): No rewardable content.
• Level 1 (1–2 marks): Basic, independent points are made, showing elements of understanding of key concepts/principles of computer science. (AO1) The discussion will contain basic information with little linkage between points made or application to the context. (AO2)
• Level 2 (3–4 marks): Demonstrates adequate understanding of key concepts/principles of computer science. (AO1) The discussion shows some linkages and lines of reasoning with some structure and application to the context. (AO2)
• Level 3 (5–6 marks): Demonstrates comprehensive understanding of key concepts/principles of computer science to support the discussion being presented. (AO1) The discussion is well developed, with sustained lines of reasoning that are coherent and logically structured, and which clearly apply to the context. (AO2)

Additional guidance: Credit only points applied to the quiz game and the students; comparison with low-level languages is not required, but a correct contrast may support a point if it is applied. Do not award generic claims such as 'high-level programs run faster', 'work on any computer' or 'students do not need to learn syntax' unless they are justified for the quiz game.

Level 3 responses must cover all three bullet areas with linked reasoning that explains why the characteristic helps the students finish the game quickly with few errors; an answer covering only two bullet areas is limited to Level 2. Do not award the idea that high-level code is already machine code or is understood directly by the processor. Accept dictionaries or classes as equivalents of records.