Edexcel GCSE Computer Science (1CP2) Exam Questions

• B 7 (1)
• The only correct answer is B. The correct answer is 7.
• A is not correct because 6 bits give only 64 combinations, which is not enough for 70 characters
• C is not correct because 7 bits already give 128 combinations, so 8 bits is not the minimum needed
• D is not correct because 70 is the number of characters needed, not a number of bits

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

• The file's entry is removed from the folder/directory (1) so the file no longer appears in the list of files/is no longer listed (1)
• The (disk) space used by the file is marked as free/available/unused (1) so another file can be saved/stored in that space (1)
• The file's data/contents are not erased/removed (1) so the file may still be recovered until the space is overwritten (1)

A point stated without development, e.g. 'the file is removed from the folder', earns one mark only.

For the first mark, accept that the file's entry is removed from the folder/directory; the second mark must state that the file no longer appears/is listed.

Do not accept 'stays on disk' alone for the third point; accept 'data is not erased' or 'contents remain'.

Do not accept 'the file is wiped from the disk straight away' or 'the data is destroyed and can never be recovered'.

Do not accept 'the file is moved to the recycle bin/bin' or 'the file is deleted from the hard drive' on its own, as this does not describe what happens to the file or the disk space.

Do not accept responses about moving the file to another folder.

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

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.