How do I convert binary to hexadecimal easily?

Group the binary digits into nibbles (4 bits) starting from the right. Convert each nibble to its hexadecimal equivalent (0-9, A-F). For example, binary 1011 1100 becomes BC in hex. This method is faster than converting to denary first.

What is the difference between ASCII and Unicode?

ASCII uses 7 or 8 bits to represent 128 or 256 characters, mainly English. Unicode uses up to 32 bits and can represent characters from almost all writing systems, including emojis. Unicode is essential for global communication.

Why do we use two's complement for negative numbers?

Two's complement simplifies binary arithmetic because addition and subtraction use the same circuitry. It also avoids having two representations for zero. The most significant bit indicates the sign (0 for positive, 1 for negative).

How do I calculate the file size of a sound file?

File size = sample rate x bit depth x number of channels x duration (in seconds). For example, a 10-second stereo recording at 44.1 kHz with 16-bit depth: 44,100 x 16 x 2 x 10 = 14,112,000 bits, which is about 1.68 MB. Remember to convert bits to bytes by dividing by 8.

What is Big O notation and why is it important?

Big O notation describes how the running time or memory usage of an algorithm grows with input size. It helps compare algorithms; for example, O(n) is more efficient than O(n^2) for large data sets. It is crucial for writing scalable code.

How can I remember Boolean algebra laws?

Use mnemonics and practise with truth tables. For De Morgan's laws, remember 'break the bar and change the sign'. For distributive law, think of it like algebra: A AND (B OR C) = (A AND B) OR (A AND C). Regular practice with simplification problems will build your confidence.

In a binary search algorithm, the list must be sorted. If the list is [2, 5, 8, 12, 16, 23, 38, 56, 72, 91], how many comparisons are needed to find the number 23?

2 — Binary search starts at the middle (index 4, value 16). 23 > 16, so search right half. New middle is index 7 (value 56). 23 16, so left = 5, right = 9. New middle = (5+9) "concept_tag": "Searching Algorithms

What is the result of the expression 5 * (2 + 3) % 4?

1 — Following operator precedence: parentheses first (2+3=5), then multiplication 5*5=25, then modulo 25%4=1 (since 4*6=24, remainder 1).

In COBOL, what is the result of the following statement if `WS-A` is a numeric field with value 15 and `WS-B` is numeric with value 4? `COMPUTE WS-RESULT = WS-A / WS-B`

3 — In COBOL, when you divide two integer numeric fields and store the result in an integer field, the result is truncated (not rounded) to the number of integer digits in the receiving field. If `WS-RESULT` is defined with `PICTURE 9`, it will hold 3. If it were defined with decimal places, it could hold 3.75, but the default is integer division.

What is the result of the expression (15 MOD 4) + (15 DIV 4) in most programming languages?

6 — 15 MOD 4 = 3 (remainder), 15 DIV 4 = 3 (integer division). Sum = 3 + 3 = 6.

A program uses a variable `x` initialized to 5. It then executes: `x = x * 2; x = x - 3; x = x / 2;` What is the final value of `x`?

3.5 — Following the operations: start with 5, multiply by 2 gives 10, subtract 3 gives 7, divide by 2 gives 3.5. Note that if integer division is used, the result would be 3, but the question does not specify integer division, so the exact result is 3.5.

Number and Algebra

OPEN COLLEGE NETWORK NORTHERN IRELAND

Vocational

This subtopic covers fundamental mathematical concepts including number systems, operations, and algebraic manipulation. It provides the essential quantitative skills required for computing, such as binary arithmetic, hexadecimal conversion, and solving equations, which are directly applicable to programming and data representation.

Learning Outcomes

Assessment Guidance

Key Skills

Key Terms

Assessment Criteria

Assessment criteria

Mathematics

Number and Algebra Revision Guide

Quick Revision Summary (Key Takeaway)

Mathematics for Computer Science at OCN Northern Ireland Level 2/3 covers number systems, Boolean algebra, data representation, algorithms, and statistical analysis. It equips students with the quantitative reasoning needed to solve computational problems, interpret data, and design efficient digital systems.

Topic Overview

This topic covers the essential mathematical foundations for computer science, including number systems (binary, denary, hexadecimal), Boolean logic, data representation (integers, characters, images, sound), and basic algorithm analysis. It also introduces statistics for interpreting data and measuring system performance. These concepts are vital for understanding how computers process, store, and communicate information.

In the OCN Northern Ireland Vocationally-Related Qualification, this mathematics component underpins practical tasks such as programming, database design, and network addressing. Mastery of these skills enables students to solve problems systematically, optimise code, and make informed decisions about hardware and software. It also provides a solid basis for further study in computing or IT-related apprenticeships.

Key Concepts

Core ideas you must understand for this topic

→Number bases: binary (base 2), denary (base 10), hexadecimal (base 16) and conversion methods.
→Boolean algebra: AND, OR, NOT, NAND, NOR, XOR gates and simplification using De Morgan's laws.
→Data representation: bits, bytes, two's complement for signed integers, ASCII/Unicode for characters, and sampling for analogue data.
→Algorithm efficiency: Big O notation for time and space complexity, and basic sorting/searching algorithms.
→Statistical measures: mean, median, mode, range, and their use in analysing system performance data.

Learning Objectives

What you need to know and understand

Convert numbers between binary, decimal, and hexadecimal systems
Perform arithmetic operations in binary and hexadecimal
Simplify algebraic expressions using the laws of indices
Solve linear equations and inequalities
Apply algebraic methods to solve real-world computing problems

Assessment Criteria

Key criteria assessors look for in your portfolio

Award credit for correct conversion steps and final answers
Award credit for accurate arithmetic in non-decimal bases
Award credit for correct application of algebraic rules
Award credit for clear and logical working out
Award credit for correct interpretation of results in context

Assessment Guidance

Guidance for achieving higher grades

💡Practice conversions regularly to build speed and accuracy
💡Show all working steps to gain method marks even if the final answer is wrong
💡Double-check arithmetic in non-decimal bases by converting back to decimal
💡Use substitution to verify solutions to equations
💡Always show your working for conversions and calculations; method marks are often available even if the final answer is wrong.
💡When simplifying Boolean expressions, state the law or rule used at each step to gain full marks.
💡For data representation questions, pay attention to the number of bits specified (e.g., 8-bit, 16-bit) as this affects range and accuracy.

Common Mistakes

Common errors to avoid in your coursework

Confusing binary and decimal place values
Misapplying the order of operations (BODMAS)
Errors in carrying/borrowing in binary arithmetic
Incorrectly simplifying expressions with negative indices
Students often think that binary addition follows the same rules as denary, forgetting that 1+1=10 in binary (carry 1). Correction: Always carry when the sum equals or exceeds the base.
Many believe that hexadecimal is just a different way to write binary, but it is a compact representation where each hex digit represents exactly four binary bits. Correction: Hex is base 16, not base 2.
Students frequently assume that all data is stored as text, overlooking that images, sound, and instructions are also represented in binary. Correction: All data types are encoded as binary patterns.

Revision Plan

How to revise this topic in 1–2 weeks

1Week 1: Revise number systems (binary, denary, hex) and practise conversions daily using online quizzes.
2Week 1: Learn Boolean algebra laws and practise simplifying expressions with truth tables.
3Week 2: Study data representation topics (two's complement, ASCII, images, sound) and complete past paper questions.
4Week 2: Review algorithm complexity and statistics, then attempt a full mock exam under timed conditions.
5Ongoing: Create flashcards for key terms and formulas, and review them regularly.

Exam Question Types

How this topic typically appears in the exam

📋Conversion questions: Convert between binary, denary, and hexadecimal. Advice: Show place value columns and check your answer by converting back.
📋Boolean simplification: Simplify a given Boolean expression using laws. Advice: Apply one law at a time and state it clearly.
📋Data representation: Calculate file sizes for images or sound, or convert between two's complement and denary. Advice: Remember formulas (e.g., file size = width x height x colour depth) and units.
📋Algorithm analysis: Describe the efficiency of a given algorithm using Big O notation. Advice: Focus on the dominant term and explain what it means for large inputs.

Command Word Expectations (OPEN COLLEGE NETWORK NORTHERN IRELAND)

What examiners look for when using specific command words in this specification

Convert

Change a value from one number base or representation to another, showing all steps. Full marks require correct method and final answer.

Simplify

Reduce a Boolean expression to its simplest form using Boolean laws. Marks are awarded for each correct step and the final simplified expression.

Calculate

Use given data and formulas to find a numerical answer. Marks are given for correct substitution, working, and units.

How Students Lose Marks (Examiner Pitfalls)

Common mark loss traps and how to write 100% full-mark answers

Pitfall: Students often confuse binary and decimal place values when converting between number bases, leading to errors in addition and subtraction.

❌ Weak Answer (Loses Marks):Converting binary 1011 to decimal as 1+0+1+1 = 3, ignoring place values.

✅ 100% Model Answer (Full Marks):Binary 1011 = (1 x 2^3) + (0 x 2^2) + (1 x 2^1) + (1 x 2^0) = 8 + 0 + 2 + 1 = 11 in decimal.

Examiner Tip: Always write out the place value headings (8,4,2,1 for 4-bit binary) before converting. Show each multiplication step to secure method marks.

Pitfall: In Boolean algebra, students incorrectly apply De Morgan's laws by not changing the operator when negating a expression.

❌ Weak Answer (Loses Marks):NOT (A AND B) = NOT A AND NOT B.

✅ 100% Model Answer (Full Marks):NOT (A AND B) = (NOT A) OR (NOT B) according to De Morgan's first law. Similarly, NOT (A OR B) = (NOT A) AND (NOT B).

Examiner Tip: Remember to 'break the bar and change the sign'. Practise with truth tables to verify your simplification.

Step-by-Step Worked Solutions

Detailed solution breakdown for typical exam problems

Question: Convert the denary number 156 into 8-bit binary and then into hexadecimal.

1.Step 1: Identify place values for 8-bit binary: 128, 64, 32, 16, 8, 4, 2, 1.
2.Step 2: Subtract largest place value: 156 - 128 = 28, so first bit is 1.
3.Step 3: 28 - 64? No, so second bit 0. 28 - 32? No, third bit 0. 28 - 16 = 12, fourth bit 1.
4.Step 4: 12 - 8 = 4, fifth bit 1. 4 - 4 = 0, sixth bit 1. Remaining bits 0.
5.Step 5: Binary = 10011100. Group into nibbles: 1001 1100.
6.Step 6: Convert each nibble: 1001 = 9, 1100 = 12 (C in hex). So hexadecimal = 9C.

Final Answer: Denary 156 = binary 10011100 = hexadecimal 9C.

Question: A program uses a 6-bit binary number to represent integers in two's complement. What is the denary value of the binary pattern 101101?

1.Step 1: Identify it is two's complement with 6 bits, so the most significant bit (MSB) has place value -32.
2.Step 2: Write place values: -32, 16, 8, 4, 2, 1.
3.Step 3: Binary 1 0 1 1 0 1 corresponds to: -32 + 0 + 8 + 4 + 0 + 1.
4.Step 4: Sum: -32 + 13 = -19.

Final Answer: The denary value is -19.

Active Recall Memory Test

Test your memory before revealing the key facts

Frequently Asked Questions

Common questions students ask about this topic

Pass / Merit / Distinction Evidence Checklist

How your portfolio evidence is graded for OPEN COLLEGE NETWORK NORTHERN IRELAND Number and Algebra

Every vocational unit is marked against named criteria rather than an exam percentage. Your tutor's brief lists the exact codes for this unit — here is what each band is asking you to do.

Pass (P)

Demonstrate baseline knowledge, accurate terminology, and core practical application.

Merit (M)

Provide detailed analysis, structured explanations, and clear workplace reasoning.

Distinction (D)

Deliver thorough evaluation, original problem solving, and fully justified recommendations.

Sample Exam Questions

Worked examples for OPEN COLLEGE NETWORK NORTHERN IRELAND Vocational Number and Algebra — try each before revealing the answer

Start free

Number and Algebra

Assessment criteria

Number and Algebra Revision Guide

Quick Revision Summary (Key Takeaway)

Topic Overview

Key Concepts

Learning Objectives

Assessment Criteria

Assessment Guidance

Common Mistakes

Revision Plan

Exam Question Types

Command Word Expectations (OPEN COLLEGE NETWORK NORTHERN IRELAND)

How Students Lose Marks (Examiner Pitfalls)

Step-by-Step Worked Solutions

Active Recall Memory Test

Frequently Asked Questions

Pass / Merit / Distinction Evidence Checklist

Sample Exam Questions

Related Topics in OPEN COLLEGE NETWORK NORTHERN IRELAND Vocational Computer Science

Software Testing

Object Oriented Programming in C#

Databases

Software Programming

Assessment criteria

Number and Algebra Revision Guide

Quick Revision Summary (Key Takeaway)

Topic Overview

Key Concepts

Learning Objectives

Assessment Criteria

Assessment Guidance

Common Mistakes

Revision Plan

Exam Question Types

Command Word Expectations (OPEN COLLEGE NETWORK NORTHERN IRELAND)

How Students Lose Marks (Examiner Pitfalls)

Step-by-Step Worked Solutions

Active Recall Memory Test

What is the denary value of the binary number 1101?

State De Morgan's first law.

What is the range of an 8-bit two's complement integer?

What does Big O notation describe?

Frequently Asked Questions

How do I convert binary to hexadecimal easily?

What is the difference between ASCII and Unicode?

Why do we use two's complement for negative numbers?

How do I calculate the file size of a sound file?

What is Big O notation and why is it important?

How can I remember Boolean algebra laws?

Pass / Merit / Distinction Evidence Checklist

Sample Exam Questions

In a binary search algorithm, the list must be sorted. If the list is [2, 5, 8, 12, 16, 23, 38, 56, 72, 91], how many comparisons are needed to find the number 23?

Simplify the expression: 3(2x - 4) + 5x

What is the result of the expression 5 * (2 + 3) % 4?

In COBOL, what is the result of the following statement if `WS-A` is a numeric field with value 15 and `WS-B` is numeric with value 4? `COMPUTE WS-RESULT = WS-A / WS-B`

What is the result of the expression (15 MOD 4) + (15 DIV 4) in most programming languages?

A program uses a variable `x` initialized to 5. It then executes: `x = x * 2; x = x - 3; x = x / 2;` What is the final value of `x`?

Related Topics in OPEN COLLEGE NETWORK NORTHERN IRELAND Vocational Computer Science

Software Testing

Object Oriented Programming in C#

Databases

Software Programming