Edexcel GCSE Computer Science (1CP2) Exam Questions

• B Copying a file (1)
• The only correct answer is B. The correct answer is Copying a file.
• A is not correct because allocating processor time is process management
• C is not correct because managing user accounts is user management
• D is not correct because sending data to a printer is peripheral management

• B At the end of translating the program (1)
• The only correct answer is B. The correct answer is at the end of translating the program.
• A is not correct because a compiler translates the whole program and does not report an error after each line; reporting after each line is how an interpreter behaves
• C is not correct because a compiler does not stop at the first error; it finishes translating and reports the errors it finds at the end
• D is not correct because syntax errors are found during translation, before the object code is run

• B Latency (1)
• The only correct answer is B. The correct answer is latency.
• A is not correct because bandwidth is the capacity of a connection, not a measure of time
• C is not correct because range is the maximum distance a signal can travel, not a measure of time
• D is not correct because speed is the rate at which data is transferred, not a delay

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

• The program instructions and data are stored together in main memory/RAM (1)
• The same memory is used for both instructions and data (1)
• The instructions are fetched from main memory and executed by the CPU (1)
• The instructions are fetched and executed one at a time / in sequence (1)
• The program can be changed/replaced by loading new instructions into memory, without changing the hardware (1)

Do not accept the program is stored in secondary storage / on the hard disk.

Do not accept the program is stored in the CPU / in registers.

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:

• The codes run in alphabetical order/consecutively (1) so each letter has a code one more than the letter before it (1)
• A has the code 65 and Z has the code 90 (1) so the codes for the letters in between increase by 1 each time (1)
• The letters are stored in sequence (1) so B is A + 1, C is B + 1 and so on (1)

Accept the codes given in denary (65, 90) or as 7-bit binary (1000001, 1011010).

Do not accept 'the codes go up' or 'the codes are in order' on its own, as neither gives the step of 1 or links one letter to the next.

Do not accept 'each uppercase letter has a different code' on its own, as this does not describe the arrangement.

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

• 0001 (1)
• 1111 (1)

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

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

• The address (of the next instruction) is sent from the CPU to main memory / placed on the address bus (1)
• The (next) instruction is fetched/read from main memory (RAM) (1)
• The instruction is brought/copied into the CPU / received into the MDR (1)
• The program counter (PC) is incremented/updated to hold the address of the next instruction (1)

Allow 'the PC/MAR is placed on the address bus' for the address being sent to main memory.

Allow 'the MDR receives the instruction' for the instruction being brought into the CPU.

Do not award a second mark for the instruction being fetched from main memory and the instruction being brought into the CPU; these are the same point.

Do not award 'the instruction is transferred along the data bus' on its own; this is the same point as the instruction being fetched from main memory.

Do not accept answers about decoding the instruction, e.g. 'the instruction is fetched from RAM and decoded', as decoding happens in the decode stage.

Do not accept answers about the execute stage, e.g. 'the ALU carries out the calculation' or 'the result of a calculation is stored in a register', as these happen in the execute stage.

Indicative content

How characters are mapped to codes

• Each character in a book title or author name is given a unique 7-bit binary code from the ASCII character set.
• The letter A, for example, is stored as the code 1000001 and the letter B as 1000010, so the catalogue can store letters as binary.
• Uppercase letters, lowercase letters, digits, punctuation and the space character each have their own ASCII code.
• The same character always uses the same code, so the text can be stored and read back correctly by the library system.

Why 7 bits are used for each character

• Seven bits give 2 to the power of 7, which is 128 different bit patterns, and this is enough to represent the letters, digits and punctuation needed in the catalogue.
• A standard keyboard has around 98 characters, so 6 bits would give only 64 codes and would not be enough.
• Using a fixed 7 bits per character means every character takes the same amount of storage, which makes the catalogue file simple to process.

Benefits of using ASCII for the catalogue

• ASCII is a standard character set, so the catalogue data can be exchanged between different computers and software.
• Author names and titles entered on one system will display correctly on another system that uses ASCII.
• ASCII uses only 7 bits per character, so the catalogue takes less storage than a character set that uses more bits.
• It is simple to encode and decode because each character has a single fixed code.

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)

Do not accept 8 bits or 256 characters as features of 7-bit ASCII; these are extended ASCII.

Indicative content

Machine independence

• A high-level language is machine independent, so the same source code can be run on different types of computer with few or no changes.
• The company can write the program once and sell it to users with different computers, without rewriting the code for each type of computer.
• Only one version of the program needs to be written and maintained, so development takes the company less time.

Processor specificity

• A low-level language is processor-specific, so a program written for one processor will not run on a different processor without being rewritten.
• Assembly language instructions depend on the instruction set of the particular processor, so the company would need a separate version of the program for each type of computer.
• Writing a separate low-level version for every type of computer would take the company much longer than writing one high-level program.
• Low-level code gives direct control of the hardware of one processor, so it is better suited to device drivers than to a program that must run on many different computers.

Translation

• High-level source code is translated for each type of computer by a compiler or an interpreter, so one version of the source code is enough for all the users.
• Assembly language is translated into machine code by an assembler, and the assembler produces machine code for one specific processor only.
• Machine code is already in a form that one particular processor can execute directly, but the same machine code will not run on a different processor.
• Each high-level statement translates into several machine code instructions, so the programmer does not need to know the instruction set of the processor.

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

• Level 3 responses must cover both high-level machine independence and low-level processor specificity, with the effect on the company's decision.
• Do not award low-level language, assembly language or machine code as portable, or 'high-level languages are written in English/like English' as a reason for machine independence.