Font size
WorksheetsData Representation Unit
Total questions: 43
Worksheet time: 26mins
One binary digit is called
bit (b)
byte (B)
Sound is a pressure wave that causes the air to vibrate.
False
True
A computer cannot interpret an analogue sound wave like this one. It must be digitised, i.e. turned into ............ values.
denary
hexadecimal
binary
The amplitude (height) of the sound wave represents ............
frequency
volume
sample rate
The higher the amplitude, the higher the volume of the sound.
True
False
the process of taking measurement of sound at regular intervals is called .....
Sampling
Sample rate
............ .......... is the number of measurements taken per second.
Frequency
Sample rate
Sampling
To calculate representation size of a sound file, we multiply ...........................
sample size x sample rate x duration
sample size x sample resolution x duration
sample rate x duration
ASCII Stands for:
American System Code for Internal Information
American Standard Code for Information Interchange
ASCII coding system uses ....
127 bits
8 bits
7 bits
Extended ASCII coding system uses
7 bits
8 bits
nibble
ASCII can represent
128 characters
256 characters
16,533 characters
Unicode system was created to represent different character sets (other languages), numbers and symbols. Unicode uses between ...................
8 to 32 bits
7 to 8 bits
8 to 32 bytes
Unicode uses the same codes as ASCII up to 127
True
False
Using 7 bits, the computer can represent .....
16 different values
64 different values
128 different values
Using 5 bits, the computer can represent ...... different values.
128
64
32
What is a byte (B)?
4 bits
8 bits
64 bits
What is a nibble?
8 bits
2 bits
4 bits
What is a kilobyte (KB)?
1000 byte
10000 byte
100 byte
In binary addition, 1 + 1 =
0 and carry 1
2
1 and carry 1
in binary addition, 1+1+1=
0 and carry 2
0 and carry 1
1 and carry 1
In binary addition, 0 + 1 =
0
1
10
In hexadecimal number system, A=
10 in decimal
15 in decimal
9 in decimal
In hexadecimal number system, F=
10 in decimal
12 in decimal
15 in decimal
1A (Hexadecimal) = (a) (Decimal)
2B (Hexadecimal) = (a) (Decimal)
11 (Binary) = ... (Decimal)
2
1
3
10 (decimal) = ... (binary)
00001010
00010100
01000100
101 (hex) = ... (decimal)
(a)
101 (binary) = ... (decimal)
(a)
A bitmap is a way of representing an image using a grid arrangement of pixels
False
True
the number of bits available to store the colour of each pixel is ....
Colour code
Image resolution
Colour depth
(a) is the total number of pixels in the image: width × height
Tick two:
Image representation size =
number of pixels × colour depth
image resolution x colour depth
image width x colour depth
to convert binary into hex we:
- Combine both numbers to get the hexadecimal number
- The left nibble is your left hex number
- Split the binary byte into two nibbles
- The right nibble is your right hex number
Arrange the steps in the correct order
1.Split the binary byte into two nibbles
2. Combine both numbers to get the hexadecimal number
3.The left nibble is your left hex number
4.The right nibble is your right hex number
1.Split the binary byte into two nibbles
2.The left nibble is your left hex number
3.The right nibble is your right hex number
4. Combine both numbers to get the hexadecimal number
1. Combine both numbers to get the hexadecimal number
2. The left nibble is your left hex number
3. Split the binary byte into two nibbles
4. The right nibble is your right hex number
The smallest element of a picture is .........
Each pixel is a ............
Each colour is a ......... ..........
pixel, binary value, colour
colour, pixel, binary value
pixel, colour, binary value
Lossy file compression....
reducing file sizes more than lossless compression.
tries to identify the patterns and decides how much it can throw away without noticeably affecting the quality of the data.
may disregard some of the original information.
is not reversible
Lossless file compression....
it is not reversible.
it is less effective at reducing file sizes than lossy compression.
reduces a file's size with no loss of quality.
Shift 00011100 binary value left by 2 bits (00011100 <<2)
00000111
01110000
00111000
Each time you shift a value to the left, you are doubling the number
False
True
Each time you shift a value to the right, you are dividing the number by 2
True
False
( >> means right shift)
00011010 >> 1 =
00001101
00110100
11010000
( << means left shift)
00101000 << 2 =
00001010
01010000
10100000
