Can someone help me on this algorithm question?
I don't understand what the problem is asking for...
Suppose a parallel computer system has one thousand processors which are programmed to solve a particular problem in parallel. Derive a reasonable estimate for the largest values of n this computer system can solve in 1 day, 1 month, 1 year, and 10
years, respectively, assuming the algorithms for solving this problem of size n requires O(n), O(n^2), O(n^3) and O(2^n) instructions such that one instruction takes 1 nanoseconds.

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

question is asking u to calculate how many instructions can be executed

\(1 \ day = 24 \times 60 \times 60 \times 10^9 \ ns\)

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.