Answer:
attempts are required to find a matching pair if the digital fingerprint is 64 bits long.
attempts are required to find a matching pair if the digital fingerprint is 128 bits long.
Step-by-step explanation:
Each bit has two options. So
How many attempts are required to find a matching pair if the digital fingerprint is 64 bits long?
So for each of the 64 bits, we have the following number of options.
2 - 2 - 2 - 2 -... - 2
So, in all, there are
options.
So, attempts are required to find a matching pair if the digital fingerprint is 64 bits long.
128 bits long?
Using the same logic as the first question.
So, attempts are required to find a matching pair if the digital fingerprint is 128 bits long.
Answer:
VW = 7
Step-by-step explanation:
Because it is a parallelogram, UX = VW
x-4 = 2x - 15
11 = x
VW = 2 x 11 - 15
VW = 7
Answer:
2 positive * 1 negative = negative
2 negative * 1 positive = positive
Step-by-step explanation:
one positive and 2 negative
(+ * -) * - =
positive times negative = negative * negative = positive
(+ * -) * - = +
now if we change the order by putting parenthesis
+ *( - * -)
negative time negative = positive
+ * (+) = positive
the result is positive
The result does not change because of where we put the parentheses.
- * + * + =
negative times positive = negative
negative * positive= negative
- * + * + = negative
The order does not matter
