Question: Line 1 : A) 0 B) 1 C) 2 D) n E) None A) 2n+2 B) n2+1 C) log(n+1) D) n(n+3)/2 E) None Line 3

 Line 1 : A) 0 B) 1 C) 2 D) n
E) None A) 2n+2 B) n2+1 C) log(n+1) D) n(n+3)/2 E) None
Line 3 : A) n2(n2+1)/2 B) 2n2(n2+2)/2 C) n2+n2(n2+1)/2 D) n(n+1)/2 E)
None Line 4 \& 5: A) n(n2+1) B) n2(n2+1)/2 C) 2n(n21)/2 D)
n(n1)/2 E) None A) nlogn B) n2 C) n3 D) n4 E)
None Question 2 : Choose the most appropriate answer: 1. log(nn)+nn+2n is
O(): A) 2n B) nn C) n ! D) nlogn E) None

Line 1 : A) 0 B) 1 C) 2 D) n E) None A) 2n+2 B) n2+1 C) log(n+1) D) n(n+3)/2 E) None Line 3 : A) n2(n2+1)/2 B) 2n2(n2+2)/2 C) n2+n2(n2+1)/2 D) n(n+1)/2 E) None Line 4 \& 5: A) n(n2+1) B) n2(n2+1)/2 C) 2n(n21)/2 D) n(n1)/2 E) None A) nlogn B) n2 C) n3 D) n4 E) None Question 2 : Choose the most appropriate answer: 1. log(nn)+nn+2n is O(): A) 2n B) nn C) n ! D) nlogn E) None QUESTION 7 2. (n4/2log(n))+nlog(n100) is O( ): A) n2logn B) n2 C) nlogn D) n3 E) None

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!