Fundamentals of Data Representation Mindmap 'Fill in the blanks'

if one or more




frequent inputs are 1 the


calculating
: number of ,



else
output is




eachbit
,
kee
can
binary cod bitf saved : it's



How electricity
of
(( is the
(
values
I
storage ASCII =
X Input A

= post




& I1)
outpa B



- +
Impare

of the
HUFFMAN :




each charac
NAME SIZE
OR


Bitribble



i
-




if




(
gives data
each value
output is
always


&
the




=
ope
Byte
-


value to the




-
input




kpi
stores the number kilobyte
of times a NOT
"t finous Megabyte
-
the

Gigabee

--
piece of data ,




& ~ else the
output
is
Input- output XOR
Terabyte




-
-




RUN LENGTH
ENCODING
HUFFMAN
CODING
if both

output
inputs
is
are

else
1

the
,
the
&


-
/



output is




-
PROS
CONS
Wander LO GIC
UNITS CONVERSION
eg
-
-




-
.




-




- -
A B

&
-




Pros
removes data

Input A



I I output
-




Input B



! BINARY
LOSSLESS
eg
--
&
CONS
-




- LOSSY
Data representation
-




~
-
-




-
COMPRESSION
losing data


-
=> advantages
- - -DEC
HEXADECIMAL




↑
STORING

~ SOUND




-/
X file size /in bits(
~ STORING CHARACTERS




ben
X
I MACES
BINARY
bit vare

X
- SAMPLING