9 units of measurement for data storage
1. Bit
2. Nibble
3. Byte
4. Kibibye (KiB)
5. Mebibyte (MiB)
6. Gibibyte (GiB)
7. Tebibyte (TiB)
8. Pebibyte (PiB)
9. Exbibyte (EiB)
Description of Bit
• It can be either 0 or 1
Description of Nibble
• It consists of 4 bits (1111, 0101)
Description of Byte
• A collection of 8 bits used to represent a character (01010101)
Description of Kibibyte (KiB)
• It consists of 1024 bytes
• 210 bytes
Description of Mebibyte (MiB)
• It consists of 1024 KiB
• It consists of 10242 bytes
• 220 bytes
Description of Gibibyte (GiB)
• It consists of 1024 MiB
• It consists of 10243 bytes
• 230 bytes
Description of Tebibyte (TiB)
• It consists of 1024 GiB
• It consists of 10244 bytes
• 240 bytes
Description of Pebibyte (PiB)
• It consists of 1024 TiB
• It consists of 10245 bytes
• 250 bytes
Description of Exbibyte (EiB)
• It consists of 1024 PiB
• It consists of 10246 bytes
• 260 bytes
How to calculate the file size of a sound file?
File size= Sampling rate * Sampling resolution * Length of track
2 definitions of compression
1. Reduction of the file size
2. It can be either lossy or lossless compression
4 benefits of compression
1. Smaller file to transmit
2. The file is transmitted quicker (Shorter transmission time)
3. Takes less storage space
4. Requires less bandwidth
2 types of compression
1. Lossy compression
2. Lossless compression
4 definitions of Lossy compression
1. Reduction of file size by permanently removing some redundant information from the file
2. Lossy compression does not allow the original file to be recreated exactly
3. File size reduction is greater than lossless
4. Lossy compression make decision about what parts of the file are important and discard other information
4 examples of lossy compression
1. mp3
2. JPEG
3. mp4
4. OGG
3 advantages of lossy compression
1. File size will be smaller than lossless
2. Takes less storage space
3. Takes less time to transmit
2 disadvantages of lossy compression
1. The original file cannot be recreated
2. The quality of the sound will be reduced
2 ways how an image file can be compressed using lossy
1. Reduces the resolution of the image (Reduces pixels)
2. Reduces the colour depth of the image (Uses fewer bits per pixels; fewer colours)
3 ways how a sound file can be compressed using lossy
1. Reduces the sampling rate
2. Reduces the sampling resolution
3. Discards any unnecessary sounds such as sounds human can't hear
6 ways how a sound file can be compressed
1. Lossy compression is used
2. A compression algorithm is used
3. Discards any unnecessary sounds such as sounds human can't hear
4. Reduces sampling rate
5. Reduces sampling resolution
6. The data is permanently removed
2 definitions of Lossless compression
1. Lossless is designed to lose none of the original detail (Lossless allows the original file to be recreated exactly)
2. Lossless is based on some form of replacement such as RLE (Run Length Encoding)
4 examples of lossless compression
1. FLAC (Free Lossless Audio Codec) [audio]
2. WMA (Windows Media) [audio]
3. MOV, AVI [video]
4. Zip
Advantage of lossless compression
• Allows retaining the quality of the file
3 disadvantages of lossless compression
1. Larger file size compared to lossy
2. Takes more time to transmit
3. Requires more storage space
5 definitions of Run Length Encoding (RLE)
1. Lossless method of compression
2. Reduces physical size of identical pixels
3. The repeating string is encoded into two values
4. One value represents the number of identical character in the run
5. The other value is the code of the character
6 ways how a Bitmap image can be compressed
1. Lossless compression is used
2. It uses a compression algorithm such as RLE (Run Length Encoding)
3. It reduces physical size of identical pixels
4. The repeating string is encoded into 2 values
5. One value represents the number of identical characters in the run
6. The other value is the code of the character
6 ways how a text file can be compressed
1. Lossless compression is used
2. It uses a compression algorithm
3. No data is removed in the process
4. Repeating words are identified and replaced with a value
5. An index of words is created
6. The index will store the words with its value