I think that A could be the correct answer. The others are not as credible as A.
Answer:
29
Explanation:
for n=28:
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 28*28 + 28/2 = 798
Algorithm 2 performs f(n) = 12*28 + 500 = 836
for n=29
--------------
Algorithm 1 performs f(n) = n2 + n/2 = 29*29 + 29/2 = 855.5
Algorithm 2 performs f(n) = 12*29 + 500 = 848
so, for n=29, algorithm 2 will be faster than algorithm 1
Answer:
False
Explanation:
Targeted attacks are usually harder because if someone has a password that is 1234 and you try it on 100 computers, you most likely will get someones password. If you are targetting a select computer with a strong password it is much harder to brute force or guess.
