Question on Big O Notation Quiz-1

Question 1

Time: 00:00:00

What is the Big-O notation for the below algorithm given below?

l. N^2

ll.10*N^2+N

O(N) and O(log N^2)

O(N^2) and O(N^2)

O(N) and O(N^2)

O(N^2) and O(N)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 2

Time: 00:00:00

What is the big-O complexity of the following code?

for{int i=n ; i>0 ; i--}

{

for{ int j = i; j < n; j *= 2}

{

for{ int k = 0; k < j; k++}

{

.....

}

}

}

O(log n)

O(n ^ 2)

O(n ^ 3)

O(n)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 3

Time: 00:00:00

What is the best suited Big O notation for merge sorting?

O(n)

O(n^2)

O(n log n)

O(log n)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 4

Time: 00:00:00

The worst case time complexity of native version quicksort is_____.

O(n log n)

O(2^n)

O(n^2)

O(n)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 5

Time: 00:00:00

What is the big-o-notation to find the nth item in a list?

O(n)

O(n!)

O(n^c)

O(log n )

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 6

Time: 00:00:00

Consider the following :

for (int n = 0; n<100; n++)

{

for(int m = 0; m<=n; m++)

{

// search 4th element using binary search

}

}

What is the Big-O Complexity of the above code?

O(100*m*n*log N)

100*m*n*O(log N)

O(100 m log N)

100m*O(log N)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 7

Time: 00:00:00

Express the formula (n-1)*(n-5) in terms of big O notation

O(1)

O(log n)

O(n)

O(n^2)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 8

Time: 00:00:00

The worst-case time complexity of Selection Exchange Sort is________.

O(n^2)

O(log n)

O(n)

O(n log n)

Good Job!

Oops!

Report the answer

PrepInsta Explanation
User Explanation

Once you attempt the question then PrepInsta explanation will be displayed.

Please login to submit your explanation

Question 9

Time: 00:00:00

A list of n strings, each of length n, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

O (n log n)

O (n^2 log n)

O (n^2 + log n)

O (n^2)

Good Job!

Oops!