1.3.1 COMPRESSION , ENCRYPTION & HASHING 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 one type 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: A’s public key
B: A’s private key
C: B’s public key
D: B’s private key

A

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

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

What is said to have occured when two keys map to

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 two 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