0101110? CHAPTER 1.

1
AE73F9?

Number System
Binary System
 Motivation
Why Binary System
• Any form of information needs to be converted into a binary format so that it can be processed
by a computer
• Computer contains millions and millions of tiny switches, which can be turned on and off.

• Therefore, the binary system is chosen as the way for a computer to represent any sort of data.

On = 1 Off = 0
 Explanation
Denary System

Eg. 365
102 =100 101 =10 100 =1

3 6 5
Explanation: Multiply the digit value (eg.3) by the place value (eg. 100)

(3x100) + (6x10) + (5x1) = 365

 Explanation

Binary Denary

Denary Binary
Binary Denary Explanation

22 =4 21 =2 20 =1

1 1 1

(1x4) + (1x2) + (1x1) = 7 in denary

Binary Denary Explanation

Eg. "1011"
23 =8 22 =4 21 =2 20 =1

1 0 1 1
Explanation: Multiply the digit value (eg.1) by the place value (eg. 8).
Then sum it all up!

(1x8) + (0x4) + (1x2) + (1x1) = 11 in denary

Binary Denary DIY

What is the denary form of "11100"?

24 =16 23 =8 22 =4 21 =2 20 =1

1 1 1 0 0
Binary Denary DIY

ANSWER
24 =16 23 =8 22 =4 21 =2 20 =1

1 1 1 0 0
(1x16) + (1x8) + (1x4) + (0x2) + (0x1)
= 28 in denary
Denary Binary Explanation

Convert 5 to binary:

5
2 2 remainder
1 Read the remainder
2 1 remainder
0 from bottom to top

2 0 remainder
1

Answer: 101
Denary Binary Explanation

Convert 39 to binary:

39
2 19 remainder
1
2 9 remainder
1
39 2
2
4
2
remainder

remainder
1
0
Read the remainder
from bottom to top

2 1 remainder
0
2 0 remainder
1

Answer: 100111
Denary Binary DIY

What is the binary form of 42?

25 =32 24 =16 23 =8 22 =4 21 =2 20 =1
Denary Binary DIY

ANSWER
Convert 42 to binary:

42
2 21 remainder
0
2 10 remainder
1
42 2
2 2
5 remainder

remainder
0
1
Read the remainder
from bottom to top

2 1 remainder
0
2 0 remainder
1

Answer: 101010
Denary System RECAP

102 101 100

(7x100) + (6x10)
7 6 5
+ (5x1) = 765
Hundredth Tenth Ones
 RECAP
Denary System
102 101 100

(7x100) + (6x10)
7 6 5
+ (5x1) = 765
Binary System
22 21 20
(1x4) + (1x2)
1 1 1 + (1x1) = 7
Binary Denary DIY

What is the denary form of "1010"?

23 =8 22 =4 21 =2 20 =1

1 0 1 0
Binary Denary DIY

ANSWER
23 =8 22 =4 21 =2 20 =1

1 0 1 0
(1x8) + (1x2) = 10 in denary
Denary Binary DIY

What is the binary form of 38?

25 =32 24 =16 23 =8 22 =4 21 =2 20 =1
Denary Binary (Method 2) DIY

ANSWER
Convert 38 to binary:

38
2 19 remainder
0
2 9 remainder
1
38 2
2
4
2
remainder

remainder
1
0
Read the remainder
from bottom to top

2 1 remainder
0
2 0 remainder
1

Answer: 100110
PA S T Y E A R Q U E S T I O N
ANSWER
Hexadecimal
System
 Motivation
Hexadecimal System

• It is a base 16 system.
• It uses 16 digits to represent each value

Number System Digits used to represent each value

Denary 0, 1, 2, 3, 4, 5, 6, 7, 8, 9

Binary 0, 1

Hexadecimal 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 , A, B, C, D, E, F
 Explanation
Hexadecimal System
Denary System Binary System

102 =100 101 =10 100 =1 22 =4 21 =2 20 =1

3 6 5 1 0 1
(3x100) + (6x10) + (5x1) = 365 (1x4) + (0x2) + (1x1) = 5

Hexadecimal System

?2 =? ?1 =? ?0 =?

3 E 5
 Explanation
Hexadecimal System
Denary System Binary System

102 =100 101 =10 100 =1 22 =4 21 =2 20 =1

3 6 5 1 0 1
(3x100) + (6x10) + (5x1) = 365 (1x4) + (0x2) + (1x1) = 5

Hexadecimal System

162 =256 161 =16 160 =1

3 E 5
Conversion

Binary Hexadecimal

Hexadecimal Binary
Binary Hexadecimal Explanation

• Since 16 = 24 this means that FOUR binary digits are equivalent to each hexadecimal digit.
Binary Hexadecimal Explanation

10 000111111101

00 10 0001 1111 1101

2 1 F D

ANSWER : 21FD
Binary Hexadecimal Explanation

101111100001

101 1 111 0 0 0 01

B E 1

ANSWER : BE1
Binary Hexadecimal DIY

What is the hexadecimal form of

0111010011100?
Binary Hexadecimal DIY

ANSWER

0111010011100

0000 1110 1001 1100

0 E 9 C
Hexadecimal Binary Explanation

F 9 3 5
1111 0011 0101
1001

Answer: 1111 1001 0011 0101

Hexadecimal Binary DIY

What is the binary form of

BF08?
Hexadecimal Binary DIY

B F 0 8
1011 0000 1000
1111

Answer: 1011 1111 0000 1000

Conversion

Hexadecimal Denary

Denary Hexadecimal
Binary Denary RECAP

Eg. "111"
22 =4 21 =2 20 =1

1 1 1

(1x4) + (1x2) + (1x1) = 7 in denary

Hexadecimal Denary Explanation

Eg. "45A"
162 =256 161 =16 160 =1

4 5 A
Note: A=10

(4x256) + (5x16) + (10x1) = 1114 in denary

Hexadecimal Denary Explanation

Eg. "C8F"
162 =256 161 =16 160 =1

C 8 F Note: C=12, F=15

(12x256) + (8x16) + (15x1) = 3215 in denary

Hexadecimal Denary DIY

What is the denary form of BF08?

163 =4096 162 =256 161 =16 160 =1

B F 0 8
Hexadecimal Denary DIY

ANSWER

163 =4096 162 =256 161 =16 160 =1

B F 0 8

(11x4096) + (15x256) + (0x16) + (8x1) = 48904 in denary

Denary Binary (Method 2) RECAP

Convert 5 to binary:

5
2 2 remainder
1 Read the remainder
2 1 remainder
0 from bottom to top

2 0 remainder
1

Answer: 101
Denary Hexadecimal Explanation

Eg. "2004"

2004/16 = 125
remainder = 4 2004
16 125 remainder
4
16 7 remainder
13
125/16 = 7
remainder = 13
16 0 remainder
7
Note: 13=D

Answer: 7D4
Denary Hexadecimal DIY

What is the hexadecimal form of 3179?

3179/16 = ?
3179
16 198 remainder
?
16 ? remainder
?
16 ? remainder
?
Denary Hexadecimal DIY

What is the hexadecimal form of 3179?

3179/16 = 198
remainder = 11 3179
16 198 remainder
11
198/16 = 12 16 12 remainder
6
remainder = 6 0 12
16 remainder

Answer: C6B
PA S T Y E A R Q U E S T I O N
ANSWER
PA S T Y E A R Q U E S T I O N
ANSWER
 Chapter 1.2
Use of hexadecimal system
Use of hexadecimal system Discussion Time

Binary Hexadecimal

110101111110
1AFD3
100111001
9
Brainstorm time: Why is Hexadecimal used?
Use of hexadecimal system Explanation

• One hex digit represents four binary digits

• The hex number is far easier for humans to
remember, copy and work with
• Four uses of the hexadecimal system
Usage 1: Error Code Explanation

• Error codes are often shown as hexadecimal values.

• These numbers refer to the memory location of the
error.
• They are generated by the computer.
• The programmer needs to know how to interpret the
hexadecimal error codes.
Usage 1: Error Code Explanation
Usage 2: MAC address Explanation

• Media Access Control (MAC) address refers to

a number which uniquely identifies a device on a network.
• The MAC address refers to the network interface card (NIC) which is
part of the device
• The MAC address is rarely changed so that a particular device can
always be identified no matter where it is.
Usage 2: MAC address Explanation

00_1C_B3_4F_25_FE

Message 00_1C_C3_4F_23_AE

Mac address uniquely identify a device on a Local Area Network

Usage 2: MAC address Explanation
Form 1
NN-NN-NN-DD-DD-DD

00-1C-B3-4F-25-FE

Form 2
NN:NN:NN:DD:DD:DD
2
00:1C:B3:4F:25:FE

Mac Address comes with 2 forms

 Usage 2: MAC address Explanation

00-1C-B3 4F-25-FE

Identity number of Serial number of

the manufacturer a device
Eg. 00 – 14 – 22 which identifies devices made by Dell
00 – a0 – c9 which identifies devices made by Intel
Usage 3: Internet Protocol
Addresses Explanation

• Each device connected to a network is given an address known as the

Internet Protocol address
• An IPv4 address is a 32-bit number written in denary or hexadecimal
form e.g. 109.108.158.1 (or 77.76.9e.01 in hex)
• IPv4 has recently been improved upon by the adoption of IPv6. An IPv6
address is a 128-bit number broken down into 16-bit chunks, represente
by a hexadecimal number.
Eg. a8f b:7a88:fff0:0fff:3d21:2085:66f b:f0fa
Usage 4: HyperText Markup Language
(HTML) colour code Explanation

• HyperText Mark-up Language (HTML) is used when writing and

developing web pages.
• It is not a programming language, but a markup language.
• A mark-up language is used in the processing, definition and presentation
of text.
 Overview
Explanation

The 4 usages of Hexadecimals - EMIH

1. E - Error Codes
2. M - MAC Address
3. I - Internet Protocol Address
4. H - HTML Colour Code
PA S T Y E A R Q U E S T I O N
ANSWER
PA S T Y E A R Q U E S T I O N
ANSWER
 Chapter 1.3
Addition of
binary number
Addition of binary number
Explanation

How do we perform add and carry in denary?

1
0+0=0 9
0+9=9 +1
9+0=9
10
9 + 1 = 10
Addition of binary number
Explanation

How do we perform add and carry in denary?

1 1
6+9 = 15 (>9)
56
1+5+7 = 13 (>9)
+79
1 35
Addition of binary number
Explanation

How do we perform add and carry in binary?

0+0=0
0+1=1
1+0=1
1 + 1 = 10
Addition of binary number
Explanation

How do we perform add and carry in binary?

1 1 1
00100111
+01001010
0 1110 001
Addition of binary number
DIY

How do we perform add and carry in binary?

Perform

01111110 + 00111110
Addition of binary number
Explanation

The overflow condition

1 11 111
01101110
+11011110
1 01 001 100
Addition of binary number
Explanation
1 11 111
The overflow condition 01101110
+11011110
1 01 001 100
• The maximum denary of an 8-bit binary number (11111111) is (28 -
1 ) = 255
• The generation of a 9th bit is a clear indication that the sum has
exceeded this value.
• This is known as an overflow error. The sum is too big to be stored
using 8 bits.
 Addition of binary number
Explanation
1 11 111
The overflow condition 01101110
01101110 = 110 +11011110
\ 11011110 = 222 1 01 001 100

110 + 222 = 322

322 > 255 (overflow)
The sum is too big to be stored in a 8 bit binary.
 Lesson
Chapter 1.4: Objectives
Binary Shifting
Last lesson on the binary system

BINARY SHIFTING TWO

COMPLEMENTS
Represent
Multiplication
negative
and division of
number in
binary numbers
binary
BINARY SHIFTING

• Binary shift is a process that a CPU uses to perform

multiplication and division.
BINARY SHIFTING -
MULTIPLICATION
• For a CPU to multiply a binary number, the number
needs to be shifted to the left and will fill the remaining
gaps with zeros.
BINARY SHIFTING -
MULTIPLICATION
Examples: 111 (Binary)
64 32 16 8 4 2 1
0 0 0 0 1 1 1
Examples: 1110 (Binary)
64 32 16 8 4 2 1
0 0 0 1 1 1 0

Examples: 11100 (Binary)

64 32 16 8 4 2 1
0 0 1 1 1 0 0
BINARY SHIFTING -
MULTIPLICATION
Examples: 111 (Binary)
64 32 16 8 4 2 1
0 0 0 0 1 1 1

Multiply by 2, shift 1 place to the left 111

Multiply by 4, shift 2 place to the left 11100
0
Multiply by 8, shift 3 place to the left 111000
Multiply by 2^n, shift n place to the left
BINARY SHIFTING - DIVISION

• For a CPU to divide a binary number, the number

needs to be shifted to the right.
BINARY SHIFTING - DIVISION

Examples: 101100 (Binary)

32 16 8 4 2 1
1 0 1 1 0 0
Examples: 10110 (Binary)
32 16 8 4 2 1
0 1 0 1 1 0
Examples: 1011 (Binary)
32 16 8 4 2 1
0 0 1 0 1 1
BINARY SHIFTING - DIVISION

Examples: 101100 (Binary)

32 16 8 4 2 1
1 0 1 1 0 0

Divide by 2, shift 1 place to the right 10110

Divide by 4, shift 2 place to the right 1011
Divide by 8, shift 3 place to the right 10
Divide by 2^n, shift n place to the right 1
BINARY SHIFTING WITH 8-BIT BINARY
NUMBERS
• Registers contained within the CPU often have 8-bits limits
on the amount of data they can hold at any one time.
• The multiplying shifting process can cause bits to be lost at
one end of the register, and zeros added at the opposite end.
• This process is known as losing the most significant bit.
BINARY SHIFTING WITH 8-BIT BINARY
NUMBERS

Examples: 10110101 (181 in denary)

128 64 32 16 8 4 2 1
1 0 1 1 0 1 0 1

10110101 -> 01101010

106 in denary

The bit lost is called the most significant bit, and when it is
shifted beyond the furthest-column the binary data that is
stored loses precision due to overflow.
BINARY SHIFTING WITH 8-BIT BINARY
NUMBERS

The same process can happen when dividing an 8-bit

binary number.
Example: 10111101 (189 in denary)
128 64 32 16 8 4 2 1
1 0 1 1 1 1 0 1
Divide this number by 32 (move 5 places to the right)
128 64 32 16 8 4 2 1
0 0 0 0 0 1 0 1
The division shift produces the 11101
Least
binary number 101 = 5, not 5.9 Significant
that arithmetic suggests. bit
 Lesson
Chapter 1.5: Objectives
Two Complements
Last lesson on the binary system

BINARY SHIFTING TWO

COMPLEMENTS
Represent
Multiplication
negative
and division of
number in
binary numbers
binary
TWO
COMPLEMENTS

• A PROCESSOR CAN ALSO REPRESENT

NEGATIVE NUMBERS.
• ONE OF THE METHOD THAT A PROCESS
REPRESENT NEGATIVE NUMBERS IS
CALLED TWO'S COMPLEMENT.
TWO
COMPLEMENTS
TWO
COMPLEMENTS

• TO REPRESENT NEGATIVE NUMBERS, IT IS IMPORTANT

TO THINK ABOUT THE PLACE VALUE OF THE FURTHEST-
LEFT BIT IN A DIFFERENT WAY.
• PROCESSOR CAN BE SET UP TO SEE THE BIT IN THE
EIGHTH COLUMN AS A SIGN BIT.

0 = POSITIVE
1 = NEGATIVE
CONVERT POSITIVE BINARY INTEGER TO A TWO'S COMPLEMENT 8-
BIT INTEGER

Examples:13
Step 1: Convert 13 into binary.
1101 in binary
Step 2: Put the number into the place value column
-128 64 32 16 8 4 2 1
0 0 0 0 1 1 0 1

Step 3: Ensure that the the leftmost bit is 0 (+).

DI
Y

Convert 19 into a Two's complement

8-bit Integer
CONVERT POSITIVE BINARY INTEGER TO A TWO'S COMPLEMENT 8-
BIT INTEGER

Examples:19
Step 1: Convert 19 into binary.
10011 in binary
Step 2: Put the number into the place value column
-128 64 32 16 8 4 2 1
0 0 0 1 0 0 1 1
Step 3: Ensure that the the leftmost bit is 0 (+).

Answer: 00010011
CONVERT TWO'S COMPLEMENT 8-BIT INTEGER TO A POSITIVE
BINARY INTEGER

Examples: Convert 00010011 (two's complement) to denary

Step 1: Put the number into the place value column
-128 64 32 16 8 4 2 1
0 0 0 1 0 0 1 1
Step 2: This shows that it is a positive number, we can just
convert the binary into denary directly.
Step 3: Calculate the denary value.

(1x16) + (1x2) + (1x1) = 19

DI
Y

Convert 01010011 (two's complement)

to denary
CONVERT TWO'S COMPLEMENT 8-BIT INTEGER TO A POSITIVE
BINARY INTEGER

Examples: Convert 01010011 (two's complement) to denary

Step 1: Put the number into the place value column
-128 64 32 16 8 4 2 1
0 1 0 1 0 0 1 1
Step 2: This shows that it is a positive number, we can just
convert the binary into denary directly.
Step 3: Calculate the denary value.

(1x64) + (1x16) + (1x2) + (1x1) = 83

CONVERT NEGATIVE BINARY NUMBERS IN TWO'S COMPLEMENT
FORMAT AND CONVERT TO DENARY

Examples: 10010011
Step 1: Put the number into the place value column
-128 64 32 16 8 4 2 1
1 0 0 1 0 0 1 1
Step 2: The left-most bit is 1, this means that it is a negative
number.
Step 3: Compute the denary value as usual.
(1x -128) + (1x16) + (1x2) + (1x1)
= -128 + 16 + 2 + 1
= -109
DI
Y

Convert 10110011 (Two's Complement)

to denary
CONVERT NEGATIVE BINARY NUMBERS IN TWO'S COMPLEMENT
FORMAT AND CONVERT TO DENARY

Examples: 10110011
Step 1: Put the number into the place value column
-128 64 32 16 8 4 2 1
1 0 1 1 0 0 1 1
Step 2: The left-most bit is 1, this means that it is a negative
number.
Step 3: Compute the denary value as usual.
(1x -128) (1x32)+ (1x16) + (1x2) + (1x1)
= -128 + 32 + 16 + 2 + 1
= -77
CONVERTING NEGATIVE DENARY NUMBERS INTO BINARY NUMBERS IN
TWO’S COMPLEMENT FORMAT

Examples: -67
Step 1: Convert the number to positive.
67
Step 2: Write the number in binary form (8 bits).
01000011
Step 3: Invert each binary value.
10111100
Step 4: Add 1 to the binary number.
10111100
+ 1
10111101
Step 5: This gives us -67.
-128 64 32 16 8 4 2 1
1 0 1 1 1 1 0 1
-128 + 32 + 16 + 8 + 4 + 1 = -67
Chapter 1.6
The number of bits used to represent sound amplitude in digital sound
recording, as known as bit depth
 Chapter 1.7

Measurement of Data
Storage and Calculation
of file size
Measurement
of Data
Storage

• A bit is the basic unit of all computing memory

storage terms and is either 1 or 0.
• The byte is the smallest unit of memory in a
computer.

8 bits = 1 byte
4 bits = 1 nibble
Memory
Size
System

Based on the SI (base 10) system of units where

1 kilo is equal to 1000.
Memory
Size As memory size is actually measured in terms of powers of 2...
System

Based on the IEC (base 2) system of units where

1 kilo is equal to 1024 (2^10).
Memory
Size
System
Converting Bytes into KiB, MiB and GiB

68719476736 Bytes
= 68719476736 Bytes / 1024 = 67108864 KiB
= 67108864 KiB / 1024 = 65536 MiB
= 65536 MiB / 1024 = 64 GiB
Memory
Size
System
Converting Gib, Mib, Kib into bytes

64 GiB
= 64 x 1024 = 65536 MiB
= 65536 x 1024 = 67108864 KiB
= 67108864 x 1024 = 68719476736 Bytes
DIY

Convert the size of GTA-V to bytes

72 GiB
= 72 x 1024 = 73728 MiB
= 65536 x 1024 = 75497472 KiB
= 75497472 x 1024 = 77309411328 Bytes
Calculation
of file
size

Imag Audi
e o
Calculation
of file
size - Image

Image Resolution - The number of pixels

that make up an image.

The higher the image resolution, the higher

the quality of the image.
Calculation
of file
size - Image

Formula

image resolution (pixels) x colour depths (bits)

Calculation Example 1
of file
size - Image

2px

2px
00 01
10 11
Total pixels = 2 x 2 = 4 Colour depth = 2

Calculation = (2x2) x 2
= 8 bits = 1 byte
Calculation Example 2
of file
size - Image
Formula : image resolution (pixels) x colour depths (bits)

Question:
Image Resolution = 1024 x 1080
Colour depth = 32

Calculate the size of this image in Bytes.

Workings:

1024 x 1080 = 1105920 pixels

1105920 x 32 = 35389440 bits
Answer in byte: 35389440/8 = 4423680 bytes
Calculation Example 2
of file
size - Image
Question:
Image Resolution = 1024 x 1080
Colour depth = 32

Calculate the size of this image in Bytes. How many photograph of

this size would fit onto a memory stick of 64Gib.
Each image = 4423680 bytes
First convert 64 Gib into bytes:
64 x 1024 = 65536 MiB
65536 x 1024 = 67108864 KiB
67108864 x 1024 = 68719476736 bytes
Calculation Example 2
of file
size - Image
Question:
Image Resolution = 1024 x 1080
Colour depth = 32

Calculate the size of this image in Bytes. How many photograph of

this size would fit onto a memory stick of 64Gib.
Each image = 4423680 bytes
First convert 64 Gib into bytes = 68719476736 bytes

68719476736/4423680 = 15534 photos.

 DI
Y
Question:
Image Resolution = 2048 x 2048
Colour depth = 16

Calculate the size of this image in Bytes.

 DANSWER

Question:
Image Resolution = 2048 x 2048
Colour depth = 16

Calculate the size of this image in Bytes.

Answer:

2048 x 2048 x 16 = 67108864 bits

= 67108864/8
= 8388608 bytes
 DIY
Question:
Image Resolution = 2048 x 2048
Colour depth = 16

Calculate the size of this image in Bytes (Answer: 8388608 bytes).

What is the size of the image in MiB.
 DANSWER
Question:
Image Resolution = 2048 x 2048
Colour depth = 16

Calculate the size of this image in Bytes (Answer: 8388608 bytes).

What is the size of the image in MiB.
8388608 / 1024 = 8192 KiB
8192 / 1024 = 8 MiB
Calculation Formula
of file
size - Sound

Sample Rate (in Hz) x Sample Resolution (in bits) x length of sample (in seconds)
Calculation
of file
size - Sound

Mono Sound vs Stereo Sound

Comparison
Calculation Example 1 - Mono Sound
of file
size - Sound
Question:
Sample Rate: 44100
Sample Resolution: 8 bits
Length of the music: 20 seconds

Calculate the size of the audio in KiB.

44100 x 8 x 20 = 7056000 bits
7056000/8 = 882000 bytes
882000 / 1024 = 861.328 KiB
Calculation
of file
Example 1 - Stereo Sound
size - Sound

An audio CD has a sample rate of 44100 and a sample resolution of 16 bits. The
music being sampled uses two channels to allow for stereo recording. Calculate the
file size for a 60-minute recording.

44100 x 16 x 3600 = 2540160000 bits

2540160000 x 2 = 5080320000 bits
5080320000 / 8 = 635040000 bytes

635040000 / 1024 = 620156.25 KiB

620156.25 / 1024 = 605.62 MiB

 DI
Y
An audio CD has a sample rate of 44100 and a sample resolution of 8 bits. The
music being sampled uses two channels to allow for stereo recording. Calculate the
file size for a 25-minute recording.
 DI
Y
An audio CD has a sample rate of 44100 and a sample resolution of 8 bits. The
music being sampled uses two channels to allow for stereo recording. Calculate the
file size for a 25-minute recording in MiB.
44100 x 8 x 1500 = 529200000 bits
529200000 x 2 = 1058400000 bits
1058400000 / 8 = 132300000 bytes

132300000 / 1024 = 129199.218 KiB

129199.218 / 1024 = 126.17 MiB

PA S T Y E A R Q U E S T I O N
ANSWER
 DATA
COM P R E SS
ION
Chapter 1.8
DATA
COMPRESSION
DATA
COMPRESSION
 DATA
COMPRESSI
ON

• FILE SIZE OF IMAGES AND SOUND CAN BE VERY

LARGE.
• THEREFORE, DATA COMPRESSION IS NEEDED TO
REDUCE THE SIZE OF A FILE.
 DATA
COMPRESSI
ON

WHAT ARE SOME BENEFITS OF

REDUCING THE FILE SIZE?
 Benefits of
Data
Compression REDUCE
STREAMIN
REDUCE
G TIME
COST
SAVE
REDUCE
STORAGE
TIME
SPACE
TAKEN TO
UPLOAD
AN D
DOW N L O A
D MEDIA
 DATA
COMPRESSI
ON

LOSSY LOSSLESS
FILE FILE
COMPRESS COMPRESS
ION ION
LOSSY FILE
COMPRESSI
ON• FILE COMPRESSION ALGORITHM ELIMINATES
UNNECESSARY DATA FROM THE FILE.
• ORIGINAL FILE CANNOT BE RECONSTRUCTED
ONCE IT HAS BEEN COMPRESSED.
• IMAGE - REDUCE THE RESOLUTION // COLOUR
DEPTH
• SOUND - REDUCE THE SAMPLING RATE //
SAMPLING RESOLUTION
• SOME
MPEG-3LOSSY FILE COMPRESSION
MPEG-4 ALGORITHMS
JPEG
ARE:
LOSSY FILE • A COMPRESSION TECHNOLOGY
COMPRESSIO
N THAT REDUCES THE SIZE OF A
NORMAL MUSIC FILE BY ABOUT
90%.
SECRET
MPEG-3 • REMOVE
SOUNDS
OUTSIDE THE
HUMAN EAR
RANGE
• ELIMINATE
THE SOFTER
SOUND -
PERCEPTUAL
LOSSY FILE
COMPRESSIO ALLOWS STORAGE OF MULTIMEDIA
N FILES RATHER THAN JUST SOUND.

SECRET
MPEG-4 • MOVIES CAN
BE
STREAMED
USING THE
MP4 FORMAT
WITHOUT
LOSING ANY
REAL
DISCERNIBLE
LOSSY FILE
A LOSSY COMPRESSION ALGORITHM
COMPRESSI
ON USED FOR BITMAP IMAGES. ORIGINAL
FILE CAN NO LONGER BE
CONSTRUCTED
SECRET
JPEG • REMOVE
COLOUR
SHADES
(HUMAN
CAN'T NOTICE
THEM)
LOSSY FILE
COMPRESSIO
N
LOSSY FILE
COMPRESSI
ON
 DATA
COMPRESSIO
N

• ALL THE DATA FROM THE ORIGINAL

UNCOMPRESSED FILE CAN BE
RECONSTRUCTED
LOSSLESS • THIS IS IMPORTANT FOR FILES
FILE WHERE LOSS OF DATA WOULD BE
DISASTROUS (COMPLEX
COMPRESS SPREADSHEET).
ION • LOSSLESS FILE COMPRESSION IS
DESIGNED SO THAT NONE OF THE
ORIGiNAL DETAIL FROM THE FILE IS
LOST.
 LOSSLESS
FILE
COMPRESSIO
N
1. CAN BE USED FOR LOSSLESS COMPRESSION OF A NUMBER
OF DIFFERENT FILE FORMATS.
RUN-
LENGTH 2. IT REDUCES THE SIZE OF A STRING OF ADJACENT,
ENCODIN IDENTICAL DATA.
G
3. A REPEATED STRING IS ENCODED INTO TWO VALUES.

NUMBER DATA ITEM

OF
IDENTICAL
DATA
 LOSSLESS
FILE RUN-
COMPRESSIO LENGTH
N
ENCODIN
G
IN
ACTION

16
 LOSSLESS
FILE RUN-
Does not work well when no repeated data!
COMPRESSIO LENGTH
N
ENCODING
IN
ACTION

Each digit - 1 byte

Total size = 8 bytes (50% reduction in size)
 LOSSLESS
FILE
3,2,5,2,4
COMPRESSIO
2,4,3,4,3
N
1.6.1.6.2
0, 15,1

TO BE
CONTINUE
DIY
DIY

REDUCE REDUCE
COLOUR IMAGE
DEPTH RESOLUTIO
N
LOSSY FILE
A LOSSY COMPRESSION ALGORITHM
COMPRESSI
ON USED FOR BITMAP IMAGES. ORIGINAL
FILE CAN NO LONGER BE
CONSTRUCTED
SECRET
JPEG • REMOVE
COLOUR
SHADES
(HUMAN
CAN'T NOTICE
THEM)
PA S T Y E A R Q U E S T I O N
ANSWER
PA S T Y E A R Q U E S T I O N
ANSWER