Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Assume a machine has a throughput of 70 ops/s. Say we have an algorithm with time complexity
T(n) = 2n^2 + 120
Determine how many hours will it take the machine to execute said algorithm for an input of size n = 8.
Is this correct?
T(n) = 2n^2 + 120
T(8) = 2(8)^2 + 120
= 248 * 70 * 1000
Please help.
A few hints:
If your program does 70 operations, how many seconds does it take?
How many seconds in an hour? (How many seconds in a minute, and how many minutes in an hour?)