1.3.1 Compression, Encryption and Hashing Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

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

A

Key pair.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Name the two categories of compression?

A

Lossy and lossless.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

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

A

Lossless.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What is the purpose of encryption?

A

To keep data secure during transmission.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Name some types of lossless compression.

A
  • Run length encoding,

- Dictionary encoding.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

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

A

Symmetric encryption.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

How many keys are used in asymmetric encryption?

A

Two (one public and one private).

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

If person A wants to send a message to person B using asymmetric encryption, which key should they use to encrypt the message?

A

Person B’s public key.

A message encrypted with B’s public key can only be decrypted with B’s private key.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

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

A

A collision.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

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

A

Run length encoding.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

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

A

Hashing.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

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

A

Hash table.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

What is meant by compression?

A

The process of reducing the space required to store a file.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Name some properties that a hashing algorithm should have.

A
  • Low chance of collision,
  • Quick to calculate,
  • Output smaller than input.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly