Before starting let's have a look at Big-O and Big-Omega and Theta:
a)
6+n+1/n
comparing 6+n+1/n and n^3 we can see that
6+n+1/n <= c * n^3
for c>0,
The inequality holds true.
This means that
6+n+1/n = O(n^3)
The statement is true.
b)
5(n log n + n)
comparing 5(n log n + n) and n^2
we can see that
5(n log n + n) <= c * n^2
for c>0, the inequality holds true
this means that
5(n log n + n)= O(n^2)
The statement is true.
c)
6n^2 + 5n^3 + log n
comparing 6n^2 + 5n^3 + log n and n^3 we can see that
6n^2 + 5n^3 + log n >= c * n^3
for c>0,
The inequality holds true.
This means that
6n^2 + 5n^3 + log n = (n^3)
The statement is true.
d)
(2n-4)^2 can also be written as
4n^2 + 16 - 4n
comparing 4n^2 + 16 - 4n and n^3 we can see that
4n^2 + 16 - 4n <= c * n^3
for c>0,
The inequality holds true.
This means that
4n^2 + 16 - 4n? = O(n^3)
but
the inequlity
4n^2 + 16 - 4n >= c * n^3
doen't hold true for any value of c
this means that 4n^2 + 16 - 4n (n^3)
WHich manes This statement is false.
Can I get some help please :) 8. Determine whether or not the following are true...
4. Determine whether or not the following are true and provide a full derivation explaining your answer for each. The domain of the functions of n below is the positive real numbers. For convenience, you may assume that the logs are in the base of your choice, but you should specify what base you are using in your derivation. 510g(n+is O(n) d. +3 log(log(n))+ Slozat)+ is o 5log(n+1) e. log(n3 n-3) is 0(n2) 4. Determine whether or not the following...
Please help me with question 13(c,f,h,i,k,m) 13. Show that the following equalities are correct: (a) 5n2 - 6n(n2) (b) n! - O(n) (c) 2n22"+ n logn-e(n22) (d) I012(n3) (h) 6n3/(log n+1)O(n3) (i) n1.001 + n logn (n1.001) (j) nkte + nk logn 6(nkte) for all fixed k and e, k 0 and e> 0 (1) 33n3 + 4n2 2(n2) (m) 33n3 + 4n23)
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...
Here are some common orders of growth, ranked from no growth to fastest growth: Θ(1) — constant time takes the same amount of time regardless of input size Θ(log n) — logarithmic time Θ(n) — linear time Θ(n log n) — linearithmic time Θ(n2 ) — quadratic time Θ(n3 ), etc. — polynomial time Θ(2n), Θ(3n), etc. — exponential time (considered “intractable”; these are really, really horrible) In addition, some programs will never terminate if they get stuck in an...
Please Help ASAP. 1Consider the below code which iterates over a linked list of n nodes (assume the list has at least 1 node). How many lines of output will it write? Node *thisNode = headPtr; while (thisNode != null) { cout << thisNode->item << endl; thisNode = thisNode->next; } 1.n 2.1 3.n2 4.n / 2 5.2 * n 2The below algorithm contains nested loops. for (int total = 1; total <= n; total++) { for (int samples = 0;...
PLEASE ANSWER AS MANY AS YOU CAN I NEED THE EXPLANATIONS TO STUDY (((((( [03] Letan = n3"x", then lim lan+1/an] = (A)x/31; (B) 3xl; (C)|3/x]; (D) xl; (E) None of these. [04] The radius R of convergence of n3yn is (A) 1; (B) 72; (C) 3; (D) 1/3 (E) None of these. [05] The interval of convergence of Zn3"x" is (A) [-1/4,44); (B) (-1/4, 14); (C) (-1/4,44]; (D) [-1/4,44]; (E) None of these. [06] The radius of convergence ofx/n3")...
3. (10 pts) For each of the following functions f(n), prove the stated claim by providing constants no C1, and c2 such that for all n2 no, cig(n) S f(n) or f(n) c2g(n), and provide a calculation that shows that this inequality does indeed hold (a) f(n) 2n2 3n3-50nlgn10 0(n3) O(g(n)) (b) f(n)-2n log n + 3n2-10n-10-Ω ( 2)-0(g(n))
4. Big-Oh and Rune time Analysis: describe the worst case running time of the following pseudocode functions in Big-Oh notation in terms of the variable n. howing your work is not required (although showing work may allow some partial t in the case your answer is wrong-don't spend a lot of time showing your work.). You MUST choose your answer from the following (not given in any particular order), each of which could be re-used (could be the answer for...
1. (10 points) Write an efficient iterative (i.e., loop-based) function Fibonnaci(n) that returns the nth Fibonnaci number. By definition Fibonnaci(0) is 1, Fibonnaci(1) is 1, Fibonnaci(2) is 2, Fibonnaci(3) is 3, Fibonnaci(4) is 5, and so on. Your function may only use a constant amount of memory (i.e. no auxiliary array). Argue that the running time of the function is Θ(n), i.e. the function is linear in n. 2. (10 points) Order the following functions by growth rate: N, \N,...
Evaluate the following series by applying Parseval's equation to certain of the Fourier expansions in Table 1 10. Evaluate the following series by applying Parseval's equation to certain of the Fourier expansions in Table 1 n2 (n2)2 C. 1 (coth 4 Answer: 7 TABLE 1. FOURIER SERIES 2-1)*! 1. f(0) = 0 (-n <0 < «) sin ne OC 4 cos(2n - 1)e (2n 1)2 2. | f(0) 3D 1Ө| (-п <0 < п) 2 T sin ne (0 0...