big-O help

If your computer takes 2 μs (micro-seconds) to calculate 1 primary operation, what time will it take to solve a problem with a number of operations as in Problem 3 where k=n=10? ? (1 μs = 10-6 seconds)
1. kn operations
2. 2n+3k+4k2 operations
3. n x log(n10) + n2operations
Why don't you simply put the numbers in and evaluate the equations?
Topic archived. No new replies allowed.