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

Indicative content

What a device driver is and how the operating system uses it

• A device driver is a program that controls a peripheral device such as a graphics tablet by communicating with the operating system.
• The driver translates instructions from the operating system into signals that the graphics tablet understands, and passes the artist's pen movements back to the operating system.
• The operating system loads the driver into memory when the tablet is connected, so that it can then send data to the tablet and receive input from it.
• Without a driver the operating system cannot control the tablet, so the tablet does not work.

Why each peripheral needs its own driver

• Every make and model of peripheral uses its own set of commands, so a driver is written for that particular device.
• The drivers already installed for the studio's older tablets do not work with the new model, even though both are graphics tablets.
• An operating system includes drivers for many common devices, but it does not have one for a brand new model.
• The correct driver means the pen movements are received by the computer in the form the drawing program expects.

What must be done before an artist can use a new tablet

• The new tablet is supplied with its driver on a disc or as a download, and it must be installed on each computer.
• The operating system may need to be updated so that it recognises the new model.
• The driver must be enabled or selected for the tablet once it is installed.
• Drivers are updated later to fix faults or to improve performance.
• If the correct driver is not installed, the tablet does not work or some of its features are not available.

Additional guidance

• Level 3 responses must explain why a driver is specific to a device and what must be done before an artist can use a new tablet, as well as describing what a driver is, all applied to the studio.
• Responses that only state what a driver is, or that state a driver must be installed without explaining why the tablet needs its own driver, are limited to Level 1.
• Accept 'software', 'program' or 'set of instructions' for a driver.
• Do not accept a device driver described only as a cable or a physical connection.
• Do not accept the claim that all drivers are already built into the operating system, or that one driver works for every graphics tablet.

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)

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.