Back to marketplace

1.3.1 Compression, encryption and hashing - Josh O

No description yet. This curated deck is ready for daily study.

Total cards: 20•Content version: v3•Public deck•Updated: 8/1/2026

Card preview (20)

#1
Front (Question)

What is Hashing?

Back (Answer)

One-way transformation of data, which is used to store things like passwords in databases

#2
Front (Question)

What is Compression?

Back (Answer)

A process used to reduce the size of a file

#3
Front (Question)

Why is Encryption needed?

Back (Answer)

It is used to keep data secure when its being stored or transmitted

#4
Front (Question)

What is Lossy Compression?

Back (Answer)

Reduces the size of the file, but also removes some information

#5
Front (Question)

What is Lossless Compression?

Back (Answer)

Reduces the size of a file, without losing any information

#6
Front (Question)

What is Asymmetric Encryption?

Back (Answer)

Encryption with a public encryption key, but private decryption key that only the recipient has

#7
Front (Question)

What could happen with Lossy Compression?

Back (Answer)

Images become pixelated, or audio recordings become less clear

#8
Front (Question)

Why is Compression important?

Back (Answer)

It is important for sharing files over the Internet because the larger a file is the longer it takes to transfer

#9
Front (Question)

What type of Compression is Dictionary Encoding?

Back (Answer)

Dictionary Encoding is a method of Lossless Compression

#10
Front (Question)

What is the difference between lossy and lossless compression?

Back (Answer)

Lossy compression reduces file size by removing some data, while lossless compression reduces file size without losing any data

#11
Front (Question)

Give an example of a lossless compression algorithm.

Back (Answer)

An example of a lossless compression algorithm is Run-Length Encoding

#12
Front (Question)

What is Huffman Coding?

Back (Answer)

Huffman coding is a lossless compression method that uses variable length codes based on frequency of occurrence of each symbol

#13
Front (Question)

How does lossy compression affect multimedia files?

Back (Answer)

Lossy compression reduces file size by removing data, often reducing quality

#14
Front (Question)

What is a common use of hashing?

Back (Answer)

Hashing is commonly used in data structures, and passwords storage

#15
Front (Question)

What is a collision in the context of hashing?

Back (Answer)

A collision occurs when two different inputs produce the same hash output

#16
Front (Question)

Why is lossy compression unsuitable for text files?

Back (Answer)

Lossy compression removes data, which could result in missing or unreadable text files

#17
Front (Question)

Describe one way that encryption helps secure data during transmission.

Back (Answer)

Encryption scrambles the data so that it is unreadable to unauthorised users, ensuring privacy and confidentiality during transmission

#18
Front (Question)

Explain the concept of ‘key size’ in encryption

Back (Answer)

The key size determines the security level of an encryption algorithm

#19
Front (Question)

What is Run-Length Encoding?

Back (Answer)

A type of lossless compression, where repeated data is stored as single values, with their counts

#20
Front (Question)

What is Symmetric Encryption?

Back (Answer)

An encryption technique where the same key is used to encrypt and decrypt data