ACARA Digital Technologies Years 7–8 Word Scramble: Representing Text, Images and Sound and Binary Number Representation (Modules 173–188)
Name:
Date:
Class:
🔤
Word scramble
Unscramble the letters and write each key term on the line.
1
OZOM NI OT EALSSPM
Zooming far into a waveform in an audio editor like Audacity shows each sample as a dot. A higher project rate gives more dots every second, so the wave is drawn more smoothly.
2
CDIGNENO
______ turns text, images and sound into whole numbers (character codes, RGB pixel values, sound samples), then stores each number as binary 0s and 1s.
3
YTEP -> MUBRNSE -> RNAYIB
Name the data type, say which numbers represent it, then show how they become binary. Give a short example for each, e.g. A is 65 because of ASCII, and 65 is 01000001.
4
EOS-TWTAT YTMSES
A system with only two possible conditions, like a light switch being off or on. We write the two states as 0 and 1, which is the idea behind binary.
5
000 100 100 101 010
Binary counting: when a column is 1 and must go up, it resets to 0 and the next column on the left becomes 1, like carrying from 9 to 10 in decimal.
6
0001 OT 1111
Binary for 8 to 15. Counting past 7 needs a fourth bit, so 8 is 1000 and the numbers keep a leading 1 up to 1111, which is 15, the largest 4-bit number.
7
N^2 - 1
The biggest whole number n bits can hold. Counting starts at 0, so n bits give 2^n values and the largest is one less. Example: 4 bits hold 0 to 15 and 8 bits hold 0 to 255.
8
N^2 - 1 >= RUBMEN
Find the smallest number of bits n whose largest value, 2^n - 1, is at least your number. Example: 20 is too big for 4 bits (max 15), so it needs 5 bits (max 31).
9
OEWSRP FO 2
Binary place values: 1, 2, 4, 8, 16, 32, 64, 128 and so on. Each place is double the one before it, which is why binary is called base 2.
Answer Key
ACARA Digital Technologies Years 7–8 · Modules 173–188
1OZOM NI OT EALSSPM → Zoom in to samples — Zooming far into a waveform in an audio editor like Audacity shows each sample as a dot. A higher project rate gives more dots every second, so the wave is drawn more smoothly.
2CDIGNENO → encoding — Encoding turns text, images and sound into whole numbers (character codes, RGB pixel values, sound samples), then stores each number as binary 0s and 1s.
3YTEP -> MUBRNSE -> RNAYIB → type -> numbers -> binary — Name the data type, say which numbers represent it, then show how they become binary. Give a short example for each, e.g. A is 65 because of ASCII, and 65 is 01000001.
4EOS-TWTAT YTMSES → two-state system — A system with only two possible conditions, like a light switch being off or on. We write the two states as 0 and 1, which is the idea behind binary.
5000 100 100 101 010 → 000 001 010 011 100 — Binary counting: when a column is 1 and must go up, it resets to 0 and the next column on the left becomes 1, like carrying from 9 to 10 in decimal.
60001 OT 1111 → 1000 to 1111 — Binary for 8 to 15. Counting past 7 needs a fourth bit, so 8 is 1000 and the numbers keep a leading 1 up to 1111, which is 15, the largest 4-bit number.
7N^2 - 1 → 2^n - 1 — The biggest whole number n bits can hold. Counting starts at 0, so n bits give 2^n values and the largest is one less. Example: 4 bits hold 0 to 15 and 8 bits hold 0 to 255.
8N^2 - 1 >= RUBMEN → 2^n - 1 >= number — Find the smallest number of bits n whose largest value, 2^n - 1, is at least your number. Example: 20 is too big for 4 bits (max 15), so it needs 5 bits (max 31).
9OEWSRP FO 2 → powers of 2 — Binary place values: 1, 2, 4, 8, 16, 32, 64, 128 and so on. Each place is double the one before it, which is why binary is called base 2.