WorksheetsA Level - Data representation Revision quiz
Total questions: 74
Worksheet time: 37mins
A hexadecimal value is much easier to read and remember than a string of binary digits
True
False
Using hex is quicker to write or type, since a hex digit takes up only one character, not four
True
False
Hex is used to define colours, in MAC addresses, in ........ languages and machine code
event driven
alternative
assembly
There is more chance of making an error when typing hex characters than a string of 1s and 0s.
True
False
Why is the answer to 24 significant?
Represents a maximum number of 16 if 1111 are occupied! 4
Represents a maximum number of 16 if 1111 are occupied! 2
Represents a maximum number of 16 if 1111 are occupied! 16
Hexadecimal uses letters for the values 10 to 15
8 to 15
12 to 15
10 to 16
10 to 15
Which numbering system is known as base 8?
Octal
Hex
binary
Decimal numbers are easy to understand but they are not easy to use in electronics. Also
they can store less numbers in binary.
they can store more numbers in binary.
they can store more unlimited numbers in binary.
Rational numbers (Q) include values that can be expressed as fractions or ratios
values that can be expressed as whole numbers or ratios
values that can be expressed as fractions or negative numbers
values that can be expressed as fractions or ratios
Any whole number that can be written as a fraction.
rational number
order number
un ordered number
irrational number
Errors when a datatype used to store data wasn't big enough to hold data.
ultraflow
underflow
overflow
sideflow
ASCII stands for:
American Standard Cover for Information Interchange
American Structural Code for Information Interchange
American Standard Code for Information Interface
American Standard Code for Information Interchange
Is it any good for the variety of symbols in other languages.
Yes
No
Transission errors are when:
errors can cause bits to flip
from 1s to 0s and 0s to 0s
errors can cause bits to flip
from 1s to 1s and 0s to 1s
errors can cause bits to flip
from 1s to 0s and 0s to 1s
Which of the following is not a way of checking for error detection:
Parity bits
Majority voting
Checksums
Party bits
With majority voting:
Each bit of a message is sent twicw
Each bit of a message is sent once
Each bit of a message is sent three times
Each bit of a message is sent 8 times
With a checksum:
The receiving computer recalculates the checksum based on the data it received and compares it with the checksum received or a known, unexpected value.
The receiving computer recalculates the checksum based on the data it received and compares it with the checksum received or a known, expected value.
The receiving computer recalculates the checksum based on the no data it received and compares it with the checksum received or a known, expected value.
With a checksum:
it is given the value 4 in binary and sent with the real data
it is given the value 8 in binary and sent with the real data
it is given the value 16 in binary and sent with the real data
it is given the value 32 in binary and sent with the real data
With a checksum: I send this coded message to you: We agree on a divisor of 16 (Means that ..... possibilities can be wrong)
15
16
16
32
In an odd parity scheme, what would be the correct parity bit for the binary string:
1101 0001
1101 0001 0
0 1101 0001
0101 0001
1 1101 0001
Left shifts:
Divide
Subtract
Multiply
Complete a 2 place right shift on the binary number:
1 1 1 0 1 0 0 1
0 1 1 0 1 0 0 0
1 0 1 0 0 0 0 0
0 0 0 1 1 0 1 0
Which statement is true?
The 1's complement of a binary number is obtained by inverting all its bits. The 2's complement of a binary number is obtained by adding 1 to the 1's complement of the number.
The 1's complement of a binary number is obtained by inverting all its bits. The 2's complement of a binary number is obtained by multiplying 1 to the 1's complement of the number.
Which statement is true?
The two’s complement of a signed binary value is found by flipping all of the bits and adding one.
The two’s complement of a signed binary value is found by flipping all of the signed bits and adding one.
The two’s complement of a signed binary value is found by flipping all of the bits and subtracting one.
The two’s complement of a signed binary value is found by flipping all of the bits and adding two.
I need to find -77 in two’s complement. How?
Find the negative value first:
Find the positive value first:
Find the last value first:
A 16 bit binary allows for 65,536 unique values. If sign is included, then you lose a bit giving 32,768 values. The issue is '0'. If you have a sign bit, then you could have positive and negative 0.
True
False
With floating point, he higher the number/range of fractional bits the less accuracy can be gained.
Lower range leads to reduced accuracy.
True
False
1 0 0 0 0 + 1 0 1 1 0
100110
100000
111011
110110
1 0 0 1 1 1 - 1 0 0 1
1 0 1 1 0
1 1 1 1 0 0
1 1 1 1 1
1 1 1 1 0
Complete a 1 place right shift on the binary number:
1 0 0 0 0 0 1 0
0 0 0 0 0 1 0 0
0 0 0 0 0 0 1 1
0 0 0 0 0 0 1 0
Resolution doesn’t define the actual physical size of an image.
True
False
Using one bit per pixel allows only 2 values, 0 and 1
True
False
3bits per pixel equates to 1, 4, 8, 16 colours per pixel in an image.3bits per pixel equates to ...... colours per pixel in an image.
2
4
8
16
In 32-bit colour what are the last 8 bits for? opacity/transparency.
Varied colours
Less colours.
More colours.
An image is captured on a 2 megapixel camera
Image captured with a 24 bit colour depth
Which is the correct answer for calculating the file size?
6,000,054 bytes
6,000,000 bytes
6,200,000 bytes
A raster graphic is composed of
shapes
colours.
pixels
Vector files are
lousy
lossless
Lossy
Whilst bitmap graphics will often pixelate as you enlarge them, vectors are not mathematically redrawn at whatever size they are set to.
True
False
Which image type is best used for simple shapes or unrealistic images?
Vector
Bitmap
Which image type keeps the same image quality when expanded in size?
Vector
Bitmap
When an analogue signal is measured at regular periods, the amplitude (or voltage of the analogue signal at that point in time) is referred to as the
alternate resolution
perfect resolution
sample resolution
More bits used per sample enables the height of the wave to be more accurately measured but increases file size.
True
alse
Resolution is measured in
Seconds
Megabytes
Bits
Bytes
The frequency or ……. per second affects the level of detail in the digital representation
Sound sample
Bit rate
Sound rate
Sample rate
For calculating a sound file size which of the following is correct?
File size =
sample rate x resolution x length in seconds
Nearly all signal that can be sampled are this. Analogue
File size =
sample rate x resolution x length in bits
File size =
sample rate / resolution x length in seconds
Nearly all signal that can be sampled are this.
Digital
Analogue
In Nyquist Theorem, because sound is made up of many components each at different frequencies, samples must be ……… the highest frequency in order to replicate the original sound wave.
Once
Twice
Eight times
What is the sample rate measured in? Hz BPS
BPS
Hz
What is the standard Sample Rate for recording a song?
44KHz
8Kz
92Kz
Which of these is true?
Increasing the Sample Rate/ Bit Rate increases the ______
Accuracy
Detail
File size
All of the others
What specifically is used to Covert a Binary data to an analogue sound?
ADC
DAC
Microphone
Computer
Which statement best describes lossy.
Lossless: Patterns in the data are spotted and summarised in a shorter format without permanently removing any information.
Non-essential data is permanently removed, for example, different shades of the same colour in an image or frequencies of sound outside the range of human hearing.
Lossless compression tries to reconstruct an image without the missing data
True
False
Lossy compression removes data permanently to reduce file size
True
False
Lossy compression keeps the sounds in the frequency ranges that we can’t so easily hear or that least affect the perceived playback quality
True
False
It’s a bit like having codes like having abbreviations for words. They can later be expanded into the same thing. Another is like having a paragraph to do with types of fruit and having each fruit represent ted by a thumb nail image. Easy to get it back to the original. Lossy good for software files, easy to transfer in short space of time. Large reduction in file size is most useful. Something called dictionaries are used here. More in this video on the next slide.
Is this Lossy?
Lossless?
A basic method of compression that summarises consecutive patterns of the same data. What is the correct answer?
ERL
ELR
RLE
Dictionary compression spots regularly occurring data and stores it separately in a dictionary. Which of the following is incorrect.
The reference to the entry in the dictionary is stored in the main file thereby reducing the original data stored
Even though the dictionary produces additional overheads the space saving negates this problem.
Even though the dictionary does not produce additional overheads the space saving negates this problem.
In a document the word ‘because’ requires 56 bits of data (7 letters x 8 bits). How many occurances of because have we saved?
54
52
50
49
How many bits was it reduced by?
50
54
58
60
Vernam cyphers. Choose the incorrect answer.
Shared with the recipient by hand, independently of the message and stored immediately after use.
A truly random sequence greater or equal in length than the plaintext and only ever used once.
Shared with the recipient by hand, independently of the message and destroyed immediately after use.
With fixed point numbers, if we want to hold larger numbers, the point must be set further to ..
The right
The left
With 4.6 the closest you can get in fixed point is:
4.1
4.4
4.6
4.5
Whats this number in fixed point? 3.7510
11.00
11.01
10.11
11.11
•The number 75,000 can be represented as
0.75 x 10 Exp5
0.75 x 10 Exp5
0.75 x 10 Exp5
0.70 x 10 Exp5
0.1011010 0011
What is this number in floating point?
0.1011010 x 2 Exp3 1
0.1011010 x 2 Exp3 1
0.1011010 x 2 Exp3
0.1011011 x 2 Exp3
For floating point to binary to decimal:
You need to....
Convert 0.1101100 0100 to decimal, assuming an 8-bit mantissa and 4 bit exponent
Write down the mantissa, 0.1101100
Translate the exponent from binary to decimal; 0100 = 4
The binary point of the mantissa has to be moved 4 places right to multiply it by 24
What is the correct answer?
01101.100
01101.101
0110.1100
11101.100
For negative binary to decimal we need to:
1.0010100 0011
Which is incorrect?
The binary point of the mantissa moves 3 places to the right.
Translate the positive exponent to .....
Find the twos complement of the mantissa
Convert the exponent to a negative number.
The twos complement of 1.0010100 is
0.1101101
0.1101110
0.1101100
0.1111100
The number 1.0010100 0011 has a negative mantissa and a positive exponent. What is the number in decimal?
-6.45
6.76
6.75
-6.75
Binary to decimal the point always moves to the...
Right
Left
In floating point if the exponent is negative the point must be moved to the .....
Right
Left
To normalise this number 0.0011010 0100
The binary point needs to move 2 places to the right so that there is a 0 following the binary point
The binary point needs to move 2 places to the left so that there is a 1 following the binary point
The binary point needs to move 2 places to the right so that there is a 1 following the binary point
The binary point needs to move 4 places to the right so that there is a 1 following the binary point
From decimal to normalised binary floating point: 01011000
Move point 7 place left
Move point 7 places right
