Back to marketplace

1.3.1 Compression, Encryption & Hashing

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

Total cards: 14•Content version: v4•Public deck•Updated: 8/1/2026

Card preview (14)

#1
Front (Question)

What name is given to the public and private keys used in asymmetric encryption?

Back (Answer)

Key Pair

#2
Front (Question)

Name the two categories of compression:

Back (Answer)

Lossy and Lossless

#3
Front (Question)

In which type of compression is the quality of a file not degraded?

Back (Answer)

Lossless

#4
Front (Question)

What is the purpose of encryption?

Back (Answer)

To keep data secure during transmission

#5
Front (Question)

Name one type of lossless compression:

Back (Answer)

Either: Run length encoding Dictionary encoding

#6
Front (Question)

In which form of encryption do the sender and receiver share the same private key?

Back (Answer)

Symmetric encryption

#7
Front (Question)

How many keys are used in asymmetric encryption?

Back (Answer)

Two (one public and one private key)

#8
Front (Question)

If person A wants to send a message to person B using asymmetric encryption, which key should they use to encrypt the message? A: A’s public key B: A’s private key C: B’s public key D: B’s private key

Back (Answer)

C: B’s public key A message encrypted with B’s public key can only be decrypted with B’s private key, which only B has access to

#9
Front (Question)

What is said to have occurred when two keys map to the same hash?

Back (Answer)

A collision

#10
Front (Question)

In which kind of lossless compression are repeated characters replaced by one occurs fr and the number of times to repeat the character?

Back (Answer)

Run length encoding

#11
Front (Question)

What name is given to the process of turning an input into a fixed size value?

Back (Answer)

Hashing

#12
Front (Question)

Which data structure uses hashing to store information with constant lookup time?

Back (Answer)

Hash Table

#13
Front (Question)

What is meant by compression?

Back (Answer)

The process of reducing the space required to store a file

#14
Front (Question)

Name two properties that a hashing algorithm should have:

Back (Answer)

Two from: • Low chance of collision • Quick to calculate • Output smaller than input