OCR A Level CS 1.3.1 Compression, Encryption and Hashing

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/27

encourage image

There's no tags or description

Looks like no tags are added yet.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

28 Terms

1
New cards

What is compression?

The process of reducing file size to save storage and speed up data transfer.

2
New cards

Why is compression important?

It reduces storage needs, speeds up file transfers, and improves efficiency for networks and the internet.

3
New cards

What is lossy compression?

A method that removes some data permanently to reduce file size (e.g., JPEG, MP3)

4
New cards

What are the advantages of lossy compression?

Smaller file sizes, faster downloads, and efficient for media files.

5
New cards

What are the disadvantages of lossy compression?

Data is lost permanently, reducing quality (e.g., lower image/audio resolution).

6
New cards

What is lossless compression?

A method that retains all original data while reducing file size (e.g., PNG, FLAC).

7
New cards

What are the advantages of lossless compression?

No data loss, retains full quality, and allows file reconstruction.

8
New cards

What are the disadvantages of lossless compression?

Larger file sizes compared to lossy compression.

9
New cards

What is Run-Length Encoding (RLE)?

A lossless compression technique that replaces repeated data with a count (e.g., AAAAAABBBB → A6B4).

10
New cards

When does RLE work best?

When data contains large repeating patterns.

11
New cards

When is RLE inefficient?

When data has little repetition, increasing the file size instead.

12
New cards

What is dictionary encoding?

A lossless compression technique that replaces frequently used words or symbols with shorter references.

13
New cards

How does dictionary encoding work?

Builds a dictionary of common phrases

  • Replaces phrases with an index

  • The dictionary is sent with the compressed data for reconstruction

14
New cards

What is a drawback of dictionary encoding?

The dictionary must be stored or transmitted with the file, increasing storage requirements.

15
New cards

What is encryption?

A method of scrambling data so it can only be read by authorized parties.

16
New cards

Why is encryption used?

To secure sensitive data from unauthorized access during storage or transmission.

17
New cards

What is symmetric encryption?

A method where the same key is used for both encryption and decryption.

18
New cards

What is a key exchange?

The process of sharing a secret key between sender and receiver.

19
New cards

What is a weakness of symmetric encryption?

If the key is intercepted, the data can be decrypted easily.

20
New cards

What is asymmetric encryption?

A method that uses a public key for encryption and a private key for decryption.

21
New cards

What are the benefits of asymmetric encryption?

More secure than symmetric encryption because the private key is never shared.

22
New cards

How do public and private keys work?

The public key encrypts data

  • Only the private key can decrypt it

23
New cards

What is a real-world use of asymmetric encryption?

Digital signatures to verify authenticity and secure web communication (SSL/TLS).

24
New cards

What is hashing?

A process that converts input data into a fixed-length hash value.

25
New cards

How is hashing different from encryption?

Hashing is one-way and cannot be reversed.

26
New cards

What is hashing used for?

Password storage

  • Data integrity checks

  • Efficient data retrieval (hash tables)

27
New cards

What makes a good hash function?

Fast computation

  • Low chance of collisions

  • Produces a unique hash for different inputs

28
New cards

What is a hash collision?

When two different inputs produce the same hash value, reducing security