Question

Just the correct answer only please please

37. In an ascending sorted List named myVals

the k^th smallest item is found by which of the following?

myVals [ k ]

myVals [ k-1 ]

myVals [ numItems - k ]

myVals [ numItems + k ]

38. What is the Time Complexity of the following snippet of code?

for ( int i = 0; i < n; ++i){

int j = 1;

while(j < n ){

j = 2 * j;                  

}

}

O(1)

O(logn)

O(n)

O(nlogn)

O(n2)

40. Which of the following is a prefix expression?

/ a + b c

a b c + /

a * b + c

a / ( b + c )

Answer 1

37 ans:

The elements are ascending order take example

2,4,6,9,13,17

So if we want find 3rd smaller element so we simple said 6 so

The index start from 0 in languages such as c,java,python,c++

6 is at position at 2 because index stat from 0 so

3-1=2

So answer is

Myvals[k-1]

If the index start from 1 such as like MATLAB .in MATLAB programming index start from 1 so then only answer is myvals[k]

Most languages index start from 0 so the answer is myvals[k-1]

38ans:

O(nlogn)

Because based on i for loop iterates n times and inner while loop iterated logn times based on j value so time complexity is

O(nlogn)

40ans:

/a + bc

Because the infix expression of above prefix is

(a/(b+c))

If you have any doubt comment below...