Mathematics — WJEC A-Level Computer Science
Test yourself on Mathematics with WJEC A-Level practice questions.
7 days Premium · Then free forever · No card, no charge
Mathematics explained
This subtopic covers the fundamental mathematical concepts of number and algebra as applied to computer science, including number systems (binary, hexadecimal), arithmetic operations, and algebraic manipulation.
Read the full explanation
It underpins data representation, logic, and algorithmic problem-solving, providing the essential toolkit for computational thinking and programming.
Your focus
- Convert between decimal, binary, and hexadecimal number systems
- Perform binary arithmetic including addition, subtraction, and multiplication
- Apply algebraic techniques to solve equations and simplify expressions
Show all 5 objectives
- Use Boolean algebra to simplify logic circuits and expressions
- Analyze algorithms using mathematical concepts such as sequences and series
Mathematics exam tips
Quick Revision Summary (Key Takeaway)
Mathematics in Computer Science (WJEC-CBAC A-Level) covers the mathematical foundations required for computational thinking, including Boolean algebra, number systems, graph theory, and algorithms. This topic is essential for understanding how computers process data, optimize solutions, and model real-world problems, and it underpins many aspects of programming and system design.
Topic Overview
Mathematics in Computer Science is a fundamental topic that bridges the gap between abstract mathematical concepts and their practical applications in computing. For WJEC-CBAC A-Level students, this includes number systems (binary, hexadecimal, two's complement), Boolean algebra, graph theory, and the analysis of algorithms. These topics are not just theoretical; they are used daily in programming, data representation, and problem-solving.
Understanding this material is crucial because it forms the basis for many other areas of computer science, such as data structures, cryptography, and machine learning. For example, Boolean algebra is essential for designing logic circuits and writing efficient conditional statements, while graph theory underpins network routing and social media algorithms. Mastery of these concepts will not only help you in exams but also in your future studies and career.
In the WJEC-CBAC A-Level specification, this topic is assessed through a mix of short-answer questions, calculations, and longer structured questions. You will be expected to apply your knowledge to unfamiliar scenarios, so it's important to practice a variety of problem types. The key is to understand the underlying principles rather than memorising procedures, as examiners often test your ability to adapt your knowledge.
Key Concepts
- →Number systems: binary, denary, hexadecimal, and conversions between them, including binary arithmetic and two's complement for negative numbers.
- →Boolean algebra: logic gates, truth tables, and simplification using laws (commutative, associative, distributive, De Morgan's).
- →Graph theory: vertices, edges, weighted graphs, adjacency matrices, and algorithms like Dijkstra's and Prim's.
- →Algorithm complexity: Big O notation, time and space complexity, and comparing algorithm efficiency.
- →Set theory and logic: sets, subsets, Venn diagrams, and logical operators (AND, OR, NOT) as used in programming.
Marking Points
- Award credit for accurate conversion between number bases with clear working
- Award credit for correct binary arithmetic operations and handling of overflow
- Award credit for correct algebraic manipulation and solving of equations
- Award credit for correct application of Boolean algebra laws and simplification
- Award credit for demonstrating mathematical reasoning in algorithm analysis
Examiner Tips
- 💡Practice conversions regularly to build speed and accuracy
- 💡Always show your working for arithmetic and algebra to gain method marks
- 💡Learn Boolean algebra laws (commutative, associative, distributive, De Morgan's) and apply them systematically
- 💡Use substitution to check algebraic solutions
- 💡Familiarize yourself with common exam question formats, such as converting between bases or simplifying logic expressions
- 💡Always show your working for calculations, especially in number conversions and algorithm trace tables. Marks are often awarded for method even if the final answer is wrong.
- 💡When answering questions on graph algorithms, draw the graph and label distances clearly. This helps you avoid mistakes and makes it easier for the examiner to follow your reasoning.
- 💡For Boolean algebra, memorise the laws and practice applying them. In exams, you may be asked to simplify expressions, so be methodical and write down each step.
Common Mistakes
- Confusing binary and hexadecimal place values
- Incorrectly handling binary addition carry bits
- Misapplying algebraic rules, e.g., sign errors
- Forgetting to simplify Boolean expressions fully
- Not showing working in calculations, leading to loss of method marks
- Misconception: Two's complement is just inverting bits. Correction: Two's complement is inverting bits and adding 1. For example, -5 in 4-bit is 1011 (invert 0101 to 1010, add 1 to get 1011).
- Misconception: Dijkstra's algorithm works with negative weights. Correction: Dijkstra's algorithm fails with negative edge weights; use Bellman-Ford instead.
- Misconception: Boolean algebra is the same as arithmetic. Correction: Boolean algebra uses logical operations (AND, OR, NOT) not arithmetic, and follows different laws like idempotent and absorption.
Revision Plan
- 1Week 1: Focus on number systems. Practice converting between binary, denary, and hexadecimal, and perform binary addition and subtraction using two's complement. Use online quizzes to test speed and accuracy.
- 2Week 2: Study Boolean algebra. Learn the laws and practice simplifying expressions. Create truth tables for logic gates and verify your simplifications.
- 3Week 3: Dive into graph theory. Understand the terminology and practice implementing Dijkstra's algorithm on paper. Also, learn about adjacency matrices and how to represent graphs.
- 4Week 4: Review algorithm complexity. Understand Big O notation and analyse simple algorithms. Practice comparing algorithms and determining their efficiency.
- 5Week 5: Consolidate by doing past paper questions. Identify weak areas and revisit those topics. Use active recall to test yourself on key definitions and formulas.
Exam Question Types
- 📋Short-answer questions on number conversions: e.g., 'Convert 10110110 from binary to hexadecimal.' Practice these to ensure speed and accuracy.
- 📋Boolean algebra simplification: e.g., 'Simplify the expression A AND (B OR C) using the laws of Boolean algebra.' Show each step clearly.
- 📋Graph algorithm trace: e.g., 'Apply Dijkstra's algorithm to find the shortest path from A to D. Show your working.' You will be expected to produce a table of distances.
- 📋Complexity analysis: e.g., 'State the time complexity of a linear search and explain why it is O(n).' Be prepared to justify your answer.
Command Word Expectations (WJEC)
In WJEC-CBAC A-Level Computer Science, 'Evaluate' requires you to consider the strengths and weaknesses of a concept or algorithm, and make a judgement. For example, 'Evaluate the use of two's complement for representing negative numbers' – you must discuss advantages (e.g., ease of arithmetic) and limitations (e.g., range), and conclude with a reasoned opinion.
You must provide a clear, detailed account of how or why something works. For instance, 'Explain how Dijkstra's algorithm works' – you should describe the steps, including the use of priority queues and distance updates, and justify why it finds the shortest path.
You must perform a mathematical computation and show your working. For example, 'Calculate the two's complement representation of -27 in 8 bits' – you need to show the binary conversion, inversion, and addition of 1, and present the final binary number.
How Students Lose Marks (Examiner Pitfalls)
Step-by-Step Worked Solutions
Question: A computer system uses 8-bit two's complement to represent integers. Convert the decimal number -45 to 8-bit two's complement and then add it to 23 (also in 8-bit two's complement). Show your working and state the result in decimal.
- 1.Step 1: Convert 45 to binary: 45 = 00101101 (8-bit).
- 2.Step 2: Invert the bits: 11010010.
- 3.Step 3: Add 1: 11010011. So -45 in two's complement is 11010011.
- 4.Step 4: Convert 23 to binary: 23 = 00010111.
- 5.Step 5: Add the two binary numbers: 11010011 + 00010111 = 11101010 (ignore overflow).
- 6.Step 6: Convert the result back to decimal: Since the leftmost bit is 1, it's negative. Invert bits: 00010101, add 1: 00010110 = 22, so result is -22.
Question: Given the graph with vertices A, B, C, D and edges (A-B, weight 4), (A-C, weight 2), (B-C, weight 1), (B-D, weight 5), (C-D, weight 3). Apply Dijkstra's algorithm starting from A to find the shortest path to D. Show the table of distances at each step.
- 1.Step 1: Initialise distances: A=0, B=∞, C=∞, D=∞. Unvisited set: {A,B,C,D}.
- 2.Step 2: Visit A. Update neighbours: B=4, C=2. Mark A visited.
- 3.Step 3: Visit C (smallest unvisited distance). Update neighbours: B=min(4,2+1)=3, D=2+3=5. Mark C visited.
- 4.Step 4: Visit B (distance 3). Update D: min(5,3+5)=5 (no change). Mark B visited.
- 5.Step 5: Visit D (distance 5). No updates. Mark D visited.
- 6.Step 6: Shortest path to D is 5 via A-C-D.