In: Advanced Math
discrete structures problems
1.Find a limit to show that x(In(x2))3 is O(x2). Simplify when possible to avoid doing more work than you have to. You will need to use L'Hôpital's rule at least once.
2.Suppose that f is o(g). What is lim(f(n)/g(n)) as n→ ∞?
3.Suppose that algorithm has run-time proportional to log n and takes 1 millisecond to process an array of size 3,000. How many milliseconds will it take to process an array of size 27,000,000,000 ? Hint: what simple relationship is there between the first number and the second number?