Please answer the question (d), (e), (f).
Homework Answers
Add Answer to:
Please answer the question (d), (e), (f).
11. (12 points, 2 points each) Find the computational...
find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code...
find complexity Problem 1 Find out the computational complexity (Big-Oh notation) of the code snippet: Code 1: for (int i = n; i > 0; i /= 2) { for (int j = 1; j < n; j *= 2) { for (int k = 0; k < n; k += 2) { // constant number of operations here } } } Code 2: Hint: Lecture Note 5, Page 7-8 void f(int n) { if (n...
Question 1 (25 pts) Find the running time complexity for the following code fragments. Express yo...
Question 1 (25 pts)
Find the running time complexity for the following code
fragments. Express your answers using either the Big-O or Big-Θ
notations, and the tightest bound possible. Justify your
answers.
for(int count O , i -0; i < n* n; i++) for(int i0 ; j <i; j++) count++
for(int count O , i -0; i
why is this wrong for vectors vector<char> decrypt{ {'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',...
why is this wrong for vectors vector<char> decrypt{ {'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A'}, {'C', 'D', 'E', 'F', 'G', 'H', 'I', 'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R', 'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z', '1', '2', '3', '4', '5', '6', '7', '8', '9', 'A', 'B'}, }; for(int...
QUESTION 8 What is the worst-case complexity of line 7 of function bar? A. O(1) B....
QUESTION 8
What is the worst-case complexity of line 7 of function bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I.
O(N^2)
J.
O(i^2)
K.
None of the above
QUESTION 9
What is the worst-case complexity of lines 6-11 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I....
7. (20 points) Assume L is a list, and assume that int n=L length() returns the number of element...
7. (20 points) Assume L is a list, and assume that int n=L length() returns the number of elements in the list, and Bubblsort(L, 0,i) sorts the list from 0 to i usin the g the Bubble sort algorithm. Determine asymtotic running time as function of n, e(T(n), for the average case time for the following code fragments a) for( int i = 1;i < n; i* 2) Bubblsort (L,0,i); for( int i=0;i
7. (20 points) Assume L is a...
QUESTION 5 What is the worst-case complexity of line 10 of function bar? A. O(1) B....
QUESTION 5
What is the worst-case complexity of line 10 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I.
O(N^2)
J.
O(i^2)
K.
None of the above
QUESTION 6
What is the worst-case complexity of lines 8-11 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I....
1). What is the complexity of the following code snippet? { for (int count2 = 0;...
1). What is the complexity of the following code snippet? { for (int count2 = 0; count2<n; count2++) { /*some sequence of O(1) step*/ } } select one: a. O(N^2) b. O(Log N) c. O(1) d. O(N!) 2). What is the complexity of the following code snippet? for (int count = 0; count<n; count++) { printsum(count) } select one: a. We need to know the complexity of the printsum() function. b. O(Log N) c. O(1) d. O(N) e. O(N^2) 3)....
hi show your solution in full details not just the final answer ,cheers mate can you...
hi show your solution in full details not just the final answer ,cheers mate can you help please thanks I am stuck please Answer the following questions: Given the code segments below with n as the problem size, answer the following questions: //Code Segment 1 (Consider n as a power of 3) int sum = 0; for(int i = 1; i <= n; i = i*3) sum++; // statement1 //Code Segment 2: (Consider both possibilities for x) if(x...
1. (25 points) Assume each expression listed below represents the execution time of a program Express...
1. (25 points) Assume each expression listed below represents the execution time of a program Express the order of magnitude for cach time using big O notation. a. T(n) = ns + 100n . log2 n + 5000 b. T(n) = 2" +n” + 7 d. T(n) 1+2+4+2 2 (75 points+5 extra credit) For cach of the code segments below, determine an equation for the worst-case computing time Tn) (expressed as a function of n, ie. 2n+4) and the order...
Using C++ please explain What is the Big-O time complexity of the following code: for (int...
Using C++ please explain
What is the Big-O time complexity of the following code: for (int i=0; i<N; i+=2) { ... constant time operations... Select one: o a. O(n^2) O b. O(log n) c. O(n) O d. 0(1) What is the Big-O time complexity of the following code: for(int i=1; i<N; i*=2) { ... constant time operations... Select one: O O a. O(n^2) b. 0(1) c. O(n) d. O(log n) O What is the Big-O time complexity of the following...
Question 1 (25 pts)
Find the running time complexity for the following code
fragments. Express your answers using either the Big-O or Big-Θ
notations, and the tightest bound possible. Justify your
answers.
for(int count O , i -0; i < n* n; i++) for(int i0 ; j <i; j++) count++
for(int count O , i -0; i
QUESTION 8
What is the worst-case complexity of line 7 of function bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I.
O(N^2)
J.
O(i^2)
K.
None of the above
QUESTION 9
What is the worst-case complexity of lines 6-11 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I....
7. (20 points) Assume L is a list, and assume that int n=L length() returns the number of elements in the list, and Bubblsort(L, 0,i) sorts the list from 0 to i usin the g the Bubble sort algorithm. Determine asymtotic running time as function of n, e(T(n), for the average case time for the following code fragments a) for( int i = 1;i < n; i* 2) Bubblsort (L,0,i); for( int i=0;i
7. (20 points) Assume L is a...
QUESTION 5
What is the worst-case complexity of line 10 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I.
O(N^2)
J.
O(i^2)
K.
None of the above
QUESTION 6
What is the worst-case complexity of lines 8-11 of function
bar?
A.
O(1)
B.
O(N)
C.
O(i)
D.
O(log N)
E.
O(sqrt N)
F.
O(A[i])
G.
O(N sqrt N)
H.
O(N log N)
I....
1. (25 points) Assume each expression listed below represents the execution time of a program Express the order of magnitude for cach time using big O notation. a. T(n) = ns + 100n . log2 n + 5000 b. T(n) = 2" +n” + 7 d. T(n) 1+2+4+2 2 (75 points+5 extra credit) For cach of the code segments below, determine an equation for the worst-case computing time Tn) (expressed as a function of n, ie. 2n+4) and the order...
Using C++ please explain
What is the Big-O time complexity of the following code: for (int i=0; i<N; i+=2) { ... constant time operations... Select one: o a. O(n^2) O b. O(log n) c. O(n) O d. 0(1) What is the Big-O time complexity of the following code: for(int i=1; i<N; i*=2) { ... constant time operations... Select one: O O a. O(n^2) b. 0(1) c. O(n) d. O(log n) O What is the Big-O time complexity of the following...
Most questions answered within 3 hours.
-
Where is the error in this code sequence?
String s1 = "Hello";
String s2 = "ello";...
asked 10 months ago -
Financial data for Joel de Paris, Inc., for last year
follow:
Joel de Paris, Inc.
Balance...
asked 10 months ago -
Consider this reaction:
Al2(SO4)3 (aq)+ BaCl3
(aq) Al2Cl6 (aq)- +
3BaSO4(s) . What is the...
asked 10 months ago -
Suppose that Savneet is considering increasing her
recent random sample from 20 car rentals to 40...
asked 10 months ago -
Trucks arrive at an unloading terminal at an average rate of 120
per hour.
Trucks arrive...
asked 10 months ago -
Why are methanol and ethanol completely soluble in water while
octanol is not very little soluble....
asked 10 months ago -
A facilities manager at a university reads in a research report
that the mean amount of...
asked 10 months ago -
When the CuSO4 is rehydrated by adding water to the anhydrous
compound, is this an endothermic...
asked 10 months ago -
A ray of sunlight is passing from diamond into crown glass; the
angle of incidence is...
asked 10 months ago -
A block of mass 0.249 kg is placed on top of a light, vertical
spring of...
asked 10 months ago -
how do the kidneys compensate in the presences of acidosis
a) trigger hyperventilate
b) reserve acid...
asked 10 months ago -
Question 501 pts
The rental rate of capital to the firm increases. Which of the
following...
asked 10 months ago