Revision Library
Choose a subject
Menu
Computer Science
Need a new topic?
Missing a topic, found a bug, or want something added?

A Level Computer Science Essentials

Component 1: Computer Systems, Component 2: Algorithms and Programming

Level
A Level · AQA 7517 · OCR H446
Series
A Level Computer Science
Suitable for
Years 12-13, AQA / OCR

19 topics (Component 1: Computer Systems, Component 2: Algorithms and Programming), each with a short explanation, a worked example and practice questions with answers.

FreePDF download · 2027 edition · 67 A4 pages
  • One file, prints straight to A4
  • No account, no password

Workbooks like this one, with 19 topics, 193 questions and mark schemes at the back, are usually printed and sold by publishers. This one is one of 558 free PDFs on the shelf.

Pages
67 A4 pages
Topics
19 topics
Questions
193 · 268 exam marks
Answers
From page 41
Covers
Component 1: Computer Systems, Component 2: Algorithms and Programming

What is inside

19 topics · answers from p41

Each topic starts with a short method recap and a worked example, followed by practice questions and exam-style questions. All the answers and mark schemes are at the back, by topic, so the book works for homework, timed practice or revision.

  1. 01Structure and Function of the ProcessorComponent 1: Computer Systems - A Levelp3
  2. 02Types of Software and Development MethodologiesComponent 1: Computer Systems - A Levelp4
  3. 03Exchanging Data: Databases, Networks and Web TechnologiesComponent 1: Computer Systems - A Levelp6
  4. 04Data Types, Data Structures and Boolean AlgebraComponent 1: Computer Systems - A Levelp8
  5. 05Legal, Moral, Cultural and Ethical IssuesComponent 1: Computer Systems - A Levelp9
  6. 06Computer Architecture, Assembly and the LMCComponent 1: Computer Systems - A Levelp11
  7. 07Boolean Algebra, Logic Gates and Karnaugh MapsComponent 1: Computer Systems - A Levelp13
  8. 08Databases, SQL and NormalisationComponent 1: Computer Systems - A Levelp15
  9. 09Databases and SQLComponent 1: Computer Systems - A Levelp18
  10. 10Networking and the InternetComponent 1: Computer Systems - A Levelp20
  11. 11Object-Oriented ProgrammingComponent 2: Algorithms and Programming - A Levelp22
  12. 12Recursion and Advanced AlgorithmsComponent 2: Algorithms and Programming - A Levelp24
  13. 13Elements of Computational ThinkingComponent 2: Algorithms and Programming - A Levelp26
  14. 14Problem Solving and ProgrammingComponent 2: Algorithms and Programming - A Levelp28
  15. 15Algorithms: Complexity, Searching and SortingComponent 2: Algorithms and Programming - A Levelp30
  16. 16Programming Paradigms and OOPComponent 2: Algorithms and Programming - A Levelp32
  17. 17Data Structures and Their OperationsComponent 2: Algorithms and Programming - A Levelp34
  18. 18Advanced Algorithms: Searching, Sorting and Path-FindingComponent 2: Algorithms and Programming - A Levelp36
  19. 19Data Representation and Theory of ComputationComponent 2: Algorithms and Programming - A Levelp38
  20. AnswersAnswers and mark schemes for every topicp41

Explore this volume

A Level Computer Science Essentials includes Structure and Function of the Processor (Component 1: Computer Systems); Types of Software and Development Methodologies (Component 1: Computer Systems); Exchanging Data: Databases, Networks and Web Technologies (Component 1: Computer Systems); Data Types, Data Structures and Boolean Algebra (Component 1: Computer Systems); Legal, Moral, Cultural and Ethical Issues (Component 1: Computer Systems); Computer Architecture, Assembly and the LMC (Component 1: Computer Systems); Boolean Algebra, Logic Gates and Karnaugh Maps (Component 1: Computer Systems); Databases, SQL and Normalisation (Component 1: Computer Systems); Databases and SQL (Component 1: Computer Systems); Networking and the Internet (Component 1: Computer Systems); Object-Oriented Programming (Component 2: Algorithms and Programming); Recursion and Advanced Algorithms (Component 2: Algorithms and Programming); Elements of Computational Thinking (Component 2: Algorithms and Programming); Problem Solving and Programming (Component 2: Algorithms and Programming); Algorithms: Complexity, Searching and Sorting (Component 2: Algorithms and Programming); Programming Paradigms and OOP (Component 2: Algorithms and Programming); Data Structures and Their Operations (Component 2: Algorithms and Programming); Advanced Algorithms: Searching, Sorting and Path-Finding (Component 2: Algorithms and Programming); Data Representation and Theory of Computation (Component 2: Algorithms and Programming).

Method recap - Data Representation and Theory of Computation

  1. Recall that all data, including negative numbers via two's complement and real numbers via a normalised mantissa and exponent, is ultimately stored as binary patterns, then extend this to how text and symbols are represented.
  2. Distinguish ASCII, a fixed 7-bit code giving 128 characters stored one byte each, from Unicode, a much larger set of code points intended to cover every written language; recall that UTF-8 stores each Unicode code point using between 1 and 4 bytes, and stays backward compatible with ASCII for the first 128 code points.
  3. Reason about the range/precision trade-off in a floating point representation: for a fixed total number of bits, allocating more bits to the exponent widens the range of representable magnitudes, while allocating more bits to the mantissa improves precision.
  4. For a finite state machine (FSM) question, identify the states, the start state, any accepting (final) states, and the transition for every state/input pair, then trace the given input string one symbol at a time to find which state the machine finishes in.

Worked example - Data Representation and Theory of Computation

A text file contains the string 'CAT' followed by a single Euro sign character (Unicode code point U+20AC). Standard ASCII characters are stored using 1 byte each in UTF-8, and the Euro sign requires 3 bytes in UTF-8. Calculate the total file size in bytes for this string, ignoring any file header.

  1. Identify that 'CAT' consists of 3 characters, each within the basic ASCII range, so each takes 1 byte in UTF-8: 3 x 1 = 3 bytes.
  2. Identify that the Euro sign (U+20AC) falls outside the ASCII range, so UTF-8 encodes it using 3 bytes, as given.
  3. Add the two parts together: 3 bytes (for CAT) + 3 bytes (for the Euro sign).
  4. Calculate the result: 3 + 3 = 6.
  5. Final answer: the string requires 6 bytes in total when stored using UTF-8.

Question 11 - Data Representation and Theory of Computation

9 marks

Discuss the statement 'any problem that can be described precisely can be solved by a computer program', with reference to the halting problem and the idea of an undecidable problem.

Answer and mark scheme

Mark scheme for Question 11 [9 marks]
Question 11[9 marks]
Answer or workingMarks
A well-structured discussion that explains the general idea of computability, uses the halting problem accurately as a specific example of an undecidable problem, and reaches a supported conclusion about the statement.Level 37-9 marks
Explains relevant ideas about computability and/or the halting problem with some accuracy, but the discussion is less developed, or the link between the example and the general statement is not fully made.Level 24-6 marks
Basic, undeveloped statements about computers, algorithms or problems, with limited or no reference to computability.Level 11-3 marks
No creditable content.0
the statement is false, because not every precisely described problem is decidable; a decidable problem is one for which an algorithm exists that is guaranteed to halt and give a correct answer for every input;
the halting problem is a well known example: given an arbitrary program and its input, decide whether that program will eventually halt or run forever;
it has been proven, by Alan Turing, that no general algorithm can exist that correctly solves the halting problem for every possible program and input, which makes it undecidable;
this shows that a precise, well-defined description of a problem is not enough on its own to guarantee it is solvable by a computer program, since some precisely defined problems are provably undecidable;
a candidate might note that most everyday programming problems are decidable, and undecidability mainly affects certain classes of self-referential or general questions about program behaviour;
judgement: the statement is false as a general claim; computability theory shows there exist precisely defined problems, such as the halting problem, for which no algorithm can ever exist.

Question 9 - Data Representation and Theory of Computation

4 marks

A short message consists of 10 ASCII characters and 2 Chinese characters. Each ASCII character is stored using 1 byte in UTF-8, and each Chinese character requires 3 bytes in UTF-8. Calculate the total number of bytes needed to store this message.

Answer and mark scheme

Mark scheme for Question 9 [4 marks]
Question 9[4 marks]
Answer or workingMarks
Calculates the bytes needed for the ASCII characters: 10 x 1 = 10 bytes.1
Calculates the bytes needed for the Chinese characters: 2 x 3 = 6 bytes.1
Uses the correct method of adding the two parts together.1
Final answer: 16 bytes.1

Method recap - Structure and Function of the Processor

  1. Learn the roles of the control unit (CU), arithmetic logic unit (ALU) and registers (PC, MAR, MDR, CIR, ACC) before trying to trace any cycle.
  2. Write out the fetch stage in register transfer notation: MAR <- [PC], PC <- [PC]+1, MDR <- [[MAR]], CIR <- [MDR].
  3. Apply the decode stage: the CU interprets the opcode held in the CIR and generates the control signals needed for execute.
  4. Work through the execute stage for the specific instruction (e.g. LDD, ADD, STO), updating the ACC or memory as required.

Question 9 - Structure and Function of the Processor

5 marks

Describe what is meant by cache memory, and explain how the principle of temporal locality helps a cache improve processor performance.

Answer and mark scheme

Mark scheme for Question 9 [5 marks]
Question 9[5 marks]
Answer or workingMarks
States that cache is a small block of very fast memory located closer to (or within) the CPU than main memory (RAM).1
States that cache stores copies of frequently or recently used instructions/data so they do not need to be re-fetched from slower RAM.1
Defines temporal locality as the tendency for a recently accessed memory location to be accessed again soon.1
Explains that because of this, keeping a fetched value in cache means later repeat accesses can be served much faster than fetching from RAM again.1
Final answer: this reduces the average time the processor spends waiting for data, improving overall performance.1

Question 7 - Structure and Function of the Processor

3 marks

Explain what is meant by the 'fetch-decode-execute cycle', referring to the role of the Program Counter in your answer.

Answer and mark scheme

Mark scheme for Question 7 [3 marks]
Question 7[3 marks]
Answer or workingMarks
States that the processor repeatedly fetches an instruction from memory, decodes it, then executes it.1
States that the Program Counter (PC) holds the address of the next instruction to be fetched.1
States that the PC is normally incremented after each fetch so it points to the next instruction in sequence.1

More A Level books

A Level Computer Science Topic Workbook 1

97 pp · 102 Qs

Structure and Function of the Processor, Types of Software and Development Methodologies, Exchanging Data: Databases, Networks and Web Technologies and 7 more

A Level Computer Science 10-Minute Tests

56 pp · 18 Qs

Structure and Function of the Processor, Types of Software and Development Methodologies, Exchanging Data: Databases, Networks and Web Technologies and 14 more