4.5 Fundamentals of data representation Flashcards
What are natural numbers, and symbol for natural numbers
Whole numbers including zero. N
What is a set
a defined collection of objects
What are integers, and symbol for integers
Any positive or negative numbers. Z
what are Rational Numbers
values that can be expressed as fractions including recurring numbers
What are irrational numbers
Numbers that can’t be expressed as a fraction
What are real numbers, and symbol for real numbers
all rational and irrational numbers. Represented by symbol R
What are ordinal numbers
a type of number used to describe the position or order of elements in a sequence or set.
How many numbers can be expressed with n number of bits
2^n
what are the two ways of represting quantities of bytes
binary prefixes (powers of 2) eg. 2^10 bytes
decimal prefixes (powers of 10) eg. 10^2 bytes
What is a bit
fundamental unit of information
What prefixes does binary represnetation take (4)
kibi - 2^10
mebi - 2^20
gibi - 2^30
tebi - 2^40 … bytes
What prefixes are used in decimal prefix (4)
kilo - 10^3
mega - 10^6
giga - 10^9
tera - 10^12
What is fixed point binary and drawbacks
Fixed point binary number have a pre determined number of bits before and after the point.
Easier to process
But they cannot represent the range or accuracy of numbers that may be required.
Difference between signed and unsigned binary
far left bit in signed binary is used to identify if the number is positive or negative
Describe normalisation in the context of binary and floating point numbers
(4)
Normalisation is the process of moving the binary point of a floating point number to:
Provide the maximum level of precision for a given number of bits
ensure there is only one representation of a number.
A positive number has a sign bit of 0 and the next digit is always 1
what are the minimum and
maximum values for a given number of bits, n in unsigned binary
0 and 2^n -1 respectively
How do we use two’s complement to represent negative numbers
the negative of a number is represented by the bitwise complement (flipping all bits) of its positive counterpart, followed by adding 1.
How do we use two’s complement to represent postitve numbers
Represented as normal except leftmost bit is a 0 to indicate it is a positive
how can numbers with at fractional part be represented in fixed point form in binary in a given number of bits
In fixed-point representation, a specific number of bits are allocated for the integer part and a specific number for the fractional part.
The position of the binary point (or decimal point) is fixed
Describe how numbers with/out a fractional part be represented in floating point form (4)
Floating Point Form:
It consists of a sign bit, exponent, and mantissa
Sign bit: Indicates whether the number is positive or negative.
Exponent: Determines the position of the binary point (similar to scientific notation in base 10).
Mantissa: The significant digits of the number.
more flexible and allows for a wider range of numbers and precision.
what are the limitations/rounding erros with representing decimal numbers and why they may be inaccurate
it must be capable of being represented
by a binary fraction in the given number of bits
what is ascii and characteristics
American Standard Code for Information Interchange
composed of a 7 bit character set giving 128 possible binary codes
Why was unicode introuduced
introduced to standardise the encoding of characters from all languages. Unicode can support a larger range of characters
explain how parity bits are used as a way to detect errors in transmissions (4)
Computer use either odd or even parity:
In even parity, the number of 1 bits in the data plus the parity bit is even
In odd parity, the number of 1 bits in the data plus the parity bit is odd.
When the data is transmitted, the receiver can check the parity bit to see if it matches the expected parity.
If it does not match, it indicates that an error has occurred during transmission.
how does majority voting detect transmission errors (3)
Each bit of a message is sent three times
If a bit value is flipped erroneously the recipient computer uses the majority rule
assumes the two bits that have not changed were therefore correct.