Answer:
B. Longer passwords
Explanation:
If the password is longer, it requires more incorrect attempts to find it, so the system could identify a potential hacker attempt. Smaller but more complex passwords could be identified by mistype or forgotten passwords.
Answer:
i) The time taken for 1500 records = 15 seconds.
ii) The time taken for 1500 records = 50 seconds.
Explanation:
A is an O(n) algorithm.
An algorithm with O(n) efficiency is described as a linearly increasing algorithm, this mean that the rate at which the input increases is linear to the time needed to compute that algorithm with n inputs.
From the question, it is given that for 1000 records, the time required is: 10 seconds.
Algorithm time taken is O(n)
Hence,
1) For 1,500 records
=> 10/1000 = x/1500
=> 10x1500/1000 = x
x = 15 seconds
Thus, the time taken for 1500 records = 15 seconds.
2) For 5,000 records
=> 10/1000 = x/5000
=> 10x5000/1000 = x
x = 50 seconds
Thus, the time taken for 1500 records = 50 seconds.
False, Dont take my word but google is your friend
Answer: Browse-wrap contract
Explanation: A browse-wrap contract is the contract in which consumer's review is basic terms of the agreement is not required rather the website provides the agreement through browsing.It is an enforceable agreement which requires the terms and the concept to be the actual in the website and the user's consent is a required after going through that agreement.
Answer:
cells are where you enter data on a eorksheet
