Consider the following nine functions for the questions that follow:
1. (n^2)/2 + 3
2. 3n^3
3. 2^n
4. 5n
5. 12n
6. 4^n
7. log_2(n)
8. log_3(n)
9. log_2(2n)
(a) Make a table in which each function is in a column dictated by its big-Θ growth rate. Functions with the same asymptotic growth rate should be in the same column. If functions in one column are little-o (o(n) = O(n) - Θ(n)) of another column, put the slower growing column on the left. If a column is little-ω (ω(n) = Ω(n) - Θ(n)) of another column, put the faster growing column on the right.
(b) If you multiplied every function by a factor of n, and fixed the table so that the functions were again sorted by growth rate, would that change the appearance of the table? If so, how? (If you aren’t sure whether something counts as a changed appearance, just describe what the new table looks like.)
(c) If you added n to every function in the table, would that change the appearance of the table? If so, how?
More info on little omega and little-o : https://www.slideshare.net/rkumardmh/little-o-and-little-omega
Show your steps to each answer
logarithmic |
linear |
quadratic |
Cubic |
exponential |
log_2(n) |
5n |
(n^2)/2 + 3 |
3n^3 |
2^n |
log_3(n) |
12n |
4^n |
||
log_2(2n) |
||||
b)
logarithmic |
linear |
quadratic |
Cubic |
exponential |
N* log_2(n) |
2^n *n |
|||
N* log_3(n) |
5n *n |
(n^2)/2 + 3 |
4^n *n |
|
N*log_2(2n) |
12n *n |
|||
3n^3 *n=3n^4 is polynomial of degree 4 we need 1 more colum for this
c log_2(n)+n=order of n because n is dominating factor
so similar for log3n and for log2(2n)
5n+n=5n
12n+n =12n
Because both are linear hence result is also linear
Quadratic ,exponenatial,cubic do not get affected by adding n hence they remain same
logarithmic |
linear |
quadratic |
Cubic |
exponential |
5n |
(n^2)/2 + 3 +n |
3n^3 +n |
2^n +n |
|
12n |
4^n +n |
|||
log_2(n)+n |
||||
log_3(n)+n |
log_2(2n)+n
Consider the following nine functions for the questions that follow: 1. (n^2)/2 + 3 2. 3n^3...
Order the following functions by asymptotic growth rate: 4n, 2^log(n), 4nlog(n)+2n, 2^10, 3n+100log(n), 2^n, n^2+10n, n^3, nlog(n) You should state the asymptotic growth rate for each function in terms of Big-Oh and also explicitly order those functions that have the same asymptotic growth rate among themselves.
Need help with 1,2,3 thank you. 1. Order of growth (20 points) Order the following functions according to their order of growth from the lowest to the highest. If you think that two functions are of the same order (Le f(n) E Θ(g(n))), put then in the same group. log(n!), n., log log n, logn, n log(n), n2 V, (1)!, 2", n!, 3", 21 2. Asymptotic Notation (20 points) For each pair of functions in the table below, deternme whether...
Prove or disprove the following statements, using the relationship among typical growth-rate functions seen in class. a)n^15log n + n^9 is O(n^9 log n) b) 15^7n^5 + 5n^4 + 8000000n^2 + n is Θ(n^3) c) n^n is Ω (n!) d) 0.01n^9 + 800000n^7 is O(n^9) e) n^14 + 0.0000001n^5 is Ω(n^13) f) n! is O(3n)
3-3 Ordering by asymptotic growth rates a. Rank the following functions by order of growth; that is, find an arrangement 81,82, 830 of the functions satisfying gi = Ω(82), g2 Ω(83), , g29 = Ω(g30). Partition your list into equivalence classes such that functions f(n) and g(n) are in the same class if and only if f(n) = Θ(g(n)) Chaptr3 Growth of Functions 1n In Inn lg* g nn-2" n'ln Ig nIn n 2" nlgn 22+1 b. Give an example...
Let f(n) = 5n^2. Prove that f(n) = O(n^3). Let f(n) = 7n^2. Prove that f(n) = Ω(n). Let f(n) = 3n. Prove that f(n) =ꙍ (√n). Let f(n) = 3n+2. Prove that f(n) = Θ (n). Let k > 0 and c > 0 be any positive constants. Prove that (n + k)c = O(nc). Prove that lg(n!) = O(n lg n). Let g(n) = log10(n). Prove that g(n) = Θ(lg n). (hint: ???? ? = ???? ?)???? ?...
1. a) Let f(n) = 6n2 - 100n + 44 and g(n) = 0.5n3 . Prove that f(n) = O(g(n)) using the definition of Big-O notation. (You need to find constants c and n0). b) Let f(n) = 3n2 + n and g(n) = 2n2 . Use the definition of big-O notation to prove that f(n) = O(g(n)) (you need to find constants c and n0) and g(n) = O(f(n)) (you need to find constants c and n0). Conclude that...
Order the following functions by asymptotic growth rate. 2n log n + 2n, 210, 2 log n, 3n + 100 log n, 4n, 2n, n2 + 10n, n3, n log n2
Arrange the following functions in ascending order of asymptotic growth rate; that is if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) is O(g(n)): 2 Squareroot log n, 2^n, n^4/3, n(log n)^3, n log n, 2 2^n, 2^n^2. Justify your answer.
Arrange the following functions in ascending order of growth rate. That is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) -O(gln) fl (n) = n/i f2 (n)- 3" fs (n)-nIg(n') JA (n)- ()+54 More specifically, match the functions f? through fe to the corresponding positions a through f to illustrate the correct asymptotic order: I Choose ] I Choose ] Choose ] Choose ] I Choose ] I Choose ]
1. Determine the appropriate big-o expression for each of the following functions, and put your answer in the table we have provided in section 2-1 of ps5_parti. We've included the answer for the first function. (Note: We're using the “ symbol to represent exponentiation.) a (n) = 5n + 1 b. b(n) = 5 - 10n - n^2 o c(n) = 4n + 2log (n) d. e. d(n) = 6nlog (n) + n^2 e(n) = 2n^2 + 3n^3 - 7n...