discrete structures problems
1.
A program P takes time proportional to logn where n is the input size. If the program takes 1 minute to process input of size 1,000,000, how many seconds does it take to process input of size 100?
2.
When the best possible algorithm to solve a problem is exponential-time, or in general in nonpolynomial (not in O(np) for any p) we call such a problem ___________________.
3. f(x) is O(x 2) and g(x) is O(x 3) then we know f(x) + g(x) is O(x r). What is the smallest integer value of r for which this is true?
Get Answers For Free
Most questions answered within 1 hours.