Year 8 · Computing · controlled beta

Data representation: text and numbers

This unit view groups 6 original DASKEREL lesson packs for an Oak topic sequence. The older export has 3 source lesson records; 3 have exact matching original packs here. Live source pages may contain additional lessons. This count is not an academic approval or a claim that the full subject course is complete.

Check Oak's current unit sequence

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Explain why digital information needs a representation

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Distinguish an idea from its stored representation
  • Explain why an agreed code and context are necessary

Vocabulary: information · data · symbol · code · context

Retrieve previous learning

What can a binary digit hold?

Check: One of two defined values, conventionally 0 or 1.

Learn the concept

Information has meaning for a person; data are recorded symbols that can be interpreted under a rule. The bits 01000001 can represent the letter A in UTF-8 or the number 65 in unsigned binary. The bits alone do not announce which interpretation is intended. A file format and context tell a program how to decode them.

A representation lets a system store, transmit or process a feature of the world. A temperature sensor reading may use a number and unit; a picture uses pixel or shape data; text uses character codes. Every representation simplifies or selects details, so ask what information may be lost or misinterpreted.

When two systems exchange data, they need agreement on the representation. Sending a number without unit, encoding or field label can produce a plausible but wrong result. Write the rule alongside an original small example and test that a second person decodes it as intended.

Worked model

  1. Write the eight bits 01000001 without claiming a meaning yet.
  2. Interpret them as unsigned binary 65 using place weights.
  3. Interpret the same byte as UTF-8/ASCII capital A under a text encoding.
  4. State which contextual label makes each interpretation correct.

Guided practice

Does the byte 00110000 mean the number 48 or the character '0'?

Hint: Ask which representation rule is in use.

Check the guided answer

It can be unsigned binary 48 or, under ASCII/UTF-8, the character '0'. Context and encoding determine the intended meaning.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“A binary sequence has only one possible meaning.”

Correction: A representation convention and context determine whether the bits mean text, a number, colour or something else.

Extend and reflect

Design a two-field record for a fictional temperature reading.

Guidance: Include numeric value, unit and a time or location field, then explain what still may be uncertain.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Distinguish an idea from its stored representation. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Encode characters as numbers

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Explain why a character encoding maps symbols to numbers
  • Distinguish a character from its encoded bytes

Vocabulary: character · code point · encoding · Unicode · UTF-8

Retrieve previous learning

What is a bit?

Check: A binary digit with one of two values, 0 or 1.

Learn the concept

Digital systems store binary values, so text needs an agreed mapping. Unicode assigns code points to characters across many writing systems. An encoding such as UTF-8 converts those code points to bytes for storage and transmission. The printed letter is not literally a row of ink stored inside the computer.

In UTF-8 the English capital A uses the byte 01000001, equal to decimal 65. Some characters need more than one byte: 'é' is not guaranteed to occupy the same number of bytes as A. Do not use 'one character equals one byte' as a general rule. The font then decides how a decoded character looks on screen.

If sender and receiver interpret bytes with different encodings, text can appear corrupted. Record the encoding when exchanging files and test a sample with accents or other scripts. Encoding does not prove that a displayed message is accurate or safe; it only specifies how symbols are represented.

Worked model

  1. Name the character A and its Unicode code point U+0041.
  2. Represent decimal 65 as binary 01000001 in UTF-8.
  3. Explain that a decoder turns the byte back into a character, which a font renders.
  4. Test a non-ASCII example and state that its byte length may differ.

Guided practice

A file shows 'é' where 'é' was intended. What type of problem should be checked first?

Hint: The displayed symbols may result from interpreting the bytes incorrectly.

Check the guided answer

Check whether the file's bytes were decoded using the intended character encoding. A mismatch can produce mojibake such as é; changing the font alone may not fix the interpretation.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“Changing the font changes the bytes used to encode a text file.”

Correction: Font choice affects visual rendering; the file's character encoding governs how code points are represented as bytes.

Extend and reflect

Investigate why a multi-script class notice needs encoding and font checks.

Guidance: Explain separate risks of mis-decoded bytes and missing glyphs without sharing pupils' personal data.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Explain why a character encoding maps symbols to numbers. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Count possible patterns from binary digits

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Explain a bit as one two-state position
  • Calculate how many patterns a fixed bit width allows

Vocabulary: bit · binary digit · bit width · pattern · state

Retrieve previous learning

Why does a text decoder need an agreed mapping?

Check: The same stored bits need a specified character encoding and context to produce the intended symbols.

Learn the concept

A binary digit has two possible values, 0 or 1. Two independent bit positions allow 00, 01, 10 and 11: four patterns. Three positions allow 2×2×2 = 8 patterns. In general n bits allow 2ⁿ patterns if each position is independently available.

A pattern count is different from the numeric value of a particular pattern. Three unsigned bits allow eight values, 0 through 7, but 111₂ has value 7. If a two-bit code is used for four fictional symbols, the designer must write a one-to-one mapping so the receiver can decode them.

Physical systems may represent two states with different voltage ranges, magnetic states or light levels under a design. The abstract 0 and 1 are not themselves tiny printed digits inside every device. Real signals need thresholds and error handling. A classroom table shows the logic, not a full engineering specification.

Worked model

  1. List 0 and 1 for one bit.
  2. Form all two-bit combinations 00,01,10,11 and count four.
  3. Double once more to count eight three-bit patterns.
  4. Separate eight possible patterns from the highest unsigned three-bit value of seven.

Guided practice

How many different patterns can four bits hold?

Hint: Multiply two choices per position.

Check the guided answer

2⁴ = 16 patterns, from 0000 through 1111 if all patterns are allowed. The greatest unsigned numeric value is 15.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“Three bits have only three possible patterns.”

Correction: Each bit has two choices, giving 2³ = 8 possible three-bit patterns.

Extend and reflect

Find the minimum bit width to represent 20 different symbols.

Guidance: Four bits allow 16, which is insufficient; five allow 32. Some patterns can remain unused.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Explain a bit as one two-state position. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Convert and add small unsigned binary numbers

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Read an unsigned binary number using powers of two
  • Convert a small nonnegative decimal integer to binary
  • Add unsigned binary numbers using carries and check in decimal

Vocabulary: binary · decimal · bit · place value · unsigned · carry

Retrieve previous learning

What two values can one bit represent?

Check: 0 or 1.

Learn the concept

Decimal uses powers of ten; binary uses powers of two. Read 101101₂ by assigning weights 32, 16, 8, 4, 2, 1 from left to right. The 1 bits contribute 32 + 8 + 4 + 1 = 45. The subscript ₂ indicates the numeral's base and is not another digit.

To encode unsigned decimal 13, choose the largest power of two not exceeding it: 8, remainder 5; then 4, remainder 1; then 1. In places 8,4,2,1 the bits are 1101₂. Check by reversing: 8 + 4 + 0 + 1 = 13.

A fixed bit width limits an unsigned range. Four bits represent 0 through 15, because the greatest pattern 1111₂ sums to 8 + 4 + 2 + 1. Signed numbers use a different representation and should not be inferred from this unsigned model.

Add binary columns from right to left, carrying 1 when a column totals two or three. For 1011₂ + 0110₂, the ones column gives 1; the twos gives 1+1 = 10₂, write 0 and carry 1; the fours gives 0+1+1 = 10₂; the eights gives 1+0+1 = 10₂; the final carry occupies the sixteens place. The result is 10001₂, or 17 in decimal, matching 11 + 6. A four-bit register would overflow, so keep the fifth bit.

Worked model

  1. Write weights 32, 16, 8, 4, 2, 1 above 101101₂ and add the 1-bit weights to get 45.
  2. Encode 13 as 8 + 4 + 1 = 1101₂ and reverse-check its value.
  3. Align 1011₂ and 0110₂ at the ones place and add right to left, carrying from twos, fours and eights columns.
  4. Write the final carry as a new fifth bit: 10001₂; check 17 = 11 + 6.

Guided practice

Add 0111₂ + 0011₂, showing carries and a decimal check.

Hint: Work from the ones column; 1+1 makes 10₂.

Check the guided answer

Ones: 1+1 gives 0 carry 1. Twos: 1+1+1 gives 1 carry 1. Fours: 1+0+1 gives 0 carry 1. Eights: 0+0+1 gives 1. Thus 1010₂ = 10, agreeing with 7+3.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“1010₂ is one thousand and ten.”

Correction: Its base is two, so its place weights are 8, 4, 2 and 1; its decimal value is 10.

Extend and reflect

Find the smallest unsigned bit width for decimal 38.

Guidance: Five bits stop at 31; six bits reach 63. Show the range rather than guessing from digit count.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Read an unsigned binary number using powers of two. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Calculate data size with clear units

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Convert bits to bytes
  • Distinguish decimal and binary size prefixes when comparing storage

Vocabulary: bit · byte · kilobyte · kibibyte · bit rate

Retrieve previous learning

How many bit values does an unsigned four-bit number have?

Check: 2⁴ = 16 values, from 0 to 15.

Learn the concept

Eight bits make one byte. If a message is represented by 80 bits, its raw bit count is 10 bytes. A file may also contain metadata or formatting, so the final saved file can be larger than the text payload alone. Keep the units attached to every calculation.

Storage labels use more than one convention. A decimal kilobyte is 1,000 bytes; a kibibyte (KiB) is 1,024 bytes. The difference grows at larger scales. When a device displays 'KB', check its stated convention before comparing advertised capacity or transferring a size into a calculation.

Network speeds are commonly in bits per second while file sizes are commonly in bytes. A theoretical 8 megabits per second corresponds to 1 megabyte per second before protocol overhead and real-world variation. Do not promise an exact download time from a headline speed alone.

Worked model

  1. Convert 80 bits to 80 ÷ 8 = 10 bytes.
  2. Convert 2 KiB to 2 × 1,024 = 2,048 bytes.
  3. Compare 2 KB = 2,000 bytes with 2 KiB = 2,048 bytes.
  4. Explain why a real file or transfer may have additional overhead.

Guided practice

How many bytes are 400 bits?

Hint: Divide by eight.

Check the guided answer

400 ÷ 8 = 50 bytes of raw data. A saved file might contain further metadata.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“A megabit and a megabyte are the same size.”

Correction: A byte contains eight bits; labels and prefix conventions must be checked before comparing rates with file sizes.

Extend and reflect

Estimate a 24 MB file's best-case transfer time at 8 Mb/s.

Guidance: Convert 24 MB to 192 Mb and divide by 8 Mb/s to get 24 seconds before overhead; explain why real time may differ.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Convert bits to bytes. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Year 8 · Data representation · original lesson pack

DASKEREL beta · internal AI review pending

Decode an original binary message and explain its limits

Open this lesson's library record

Official curriculum or provision guidance

DASKEREL wrote this teaching and practice using Oak's sequence as a source. View the source lesson at Oak National Academy. Oak has not endorsed this material. Check Oak's terms and separate rights for third-party works.

Learning outcomes

  • Use a stated binary symbol code to decode a short message
  • Distinguish a public encoding from secret-key encryption

Vocabulary: encoding · decoding · cipher · key · binary pattern

Retrieve previous learning

How many patterns do five bits allow?

Check: 2⁵ = 32 patterns, enough to label 20 different symbols if a mapping is agreed.

Learn the concept

A code can map fixed bit patterns to symbols. In an original classroom puzzle, use three bits to encode eight letters: 000=A, 001=B, 010=C, 011=D, 100=E, 101=F, 110=G, 111=H. The receiver needs the mapping and a way to split the stream into three-bit groups; without the grouping, a long run of bits is ambiguous.

Decode 010 000 001 as C A B, then check every group against the table. This is encoding, not secrecy: anyone with the published mapping can read it. A cipher aims to conceal meaning using a key or transformation. Alan Turing's name in the source lesson title does not make this simple code equivalent to wartime cryptography.

A puzzle can use a secret substitution key, but its security must not be overstated. Simple classroom substitution is easy to break and unsuitable for protecting real messages or passwords. Work only with invented words, state the key and test by re-encoding the decoded result.

Worked model

  1. Write the original eight-letter three-bit mapping and divide the message into equal groups.
  2. Decode 010→C, 000→A, 001→B to obtain CAB.
  3. Re-encode CAB to 010 000 001 to check the work.
  4. Explain why knowing a public mapping is different from holding a secret encryption key.

Guided practice

Using the stated mapping, what is 000 010 100?

Hint: Decode each three-bit group separately.

Check the guided answer

000=A, 010=C and 100=E, so the sequence reads ACE.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Find and correct a misconception

“Binary text is automatically encrypted because it looks unfamiliar.”

Correction: Encoding changes representation; it does not provide secrecy when the mapping is known.

Extend and reflect

Design a parity check for a classroom code without claiming security.

Guidance: Add one bit for simple error detection and explain a limitation; do not call it encryption.

Take the end-of-unit check
Where this lesson could lead · Computer Science GCSE → Daskerel Computing and AI

This lesson practises: Use a stated binary symbol code to decode a short message. Algorithms, digital systems and safe practice support later software and technology work.

  1. Next school subject: Computer Science GCSE. Check the subject and examination board that fit your school.
  2. Later DASKEREL learning: Daskerel Computing and AI. Explore further study and build evidence from practical work.
  3. Later credential exploration: AWS Certified Developer - Associate is an example in this later specialism. Check current awarding-body requirements before planning an exam.
  4. Example career direction: Software Engineer. Explore organisations and local support.

This is an exploratory route, not a promise of admission, a qualification, certification eligibility or employment. Years 7–9 learning is an early foundation; any later credential may require substantial study, experience or local approval.

Original DASKEREL written unit check · controlled beta

Data Representation Text And Numbers: written unit check

Attempt the original DASKEREL transfer questions after the lessons. Written checks assess explanation and reasoning. A teacher must observe learners using approved devices and accessible tools, inspect their saved work and version history, verify copyright and source attribution, and manage any sharing or personal-data risks. Work with fictional or consented data; do not enter real passwords or private details into classroom examples. No written response alone certifies practical competence. Written answers do not establish independently observed digital production, coding or tool use; a teacher must check the actual artefact, process, accessibility and safe use. This is beta editorial practice pending qualified subject review. Attempt each question before opening its model reasoning. This is editorial practice, not a validated school test or a verified attainment result.

Independent practice

Write your own response to every question before viewing the model answers. Your writing stays in this page session; this activity does not submit, store or grade it. Avoid including private information.

Written self-checks are editorial practice. Practical and performance competence needs observation; qualified academic and accessibility review remain pending.