They could find you and throw hands.
Answer:
Relational Databases
Explanation:
These are digital databases that are made to recognize relations between previously stored items of info.
Answer:
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
Explanation:
using the direct mapping method
Number of lines = 512
block size = 8 words
word offset =
= 3 bit
index bit =
= 9 bit
Tag = 20 - ( index bit + word offset ) = 20 - ( 3+9) = 8 bit
Given address = 94EA6
tag = 0 * 94 ( 10010100 )
line = 0 * 1 D 4 ( 111010100 )
word position = 0*6 ( 110 )
Assuming the data was encrypted with YOUR public key, you'll need YOUR private key to decrypt it. That's answer e.
a and b are not solutions by themselves, of course you need to use the decryption algorithm, but a key goes with it.
c would be about symmetric encryption, but this is asymmetric, so different keys are used for encryption and decryption
d is possible, but it would mean anyone can decrypt it (after all the key is public), so then there's no point in encrypting it in the first place.
So e is the only logical answer.