Quiz-1

June 23, 2019

Hello PrepSter,

If you find any errors in the quiz below kindly comment in the comment section and we will make it our priority to fix it.

Also if you have a better of the solution to the questions, please do comment them below and if we find it better than ours, we will post it in our website.

Question 1

Time: 00:00:00
Which of the following case does not exist in complexity theory?

Best case

Best case

Worst case

Worst case

Average case

Average case

Null case

Null case

Good Job!

Oops!

  • 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
The complexity of linear search algorithm is

O(n)

O(n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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
The complexity of Binary search algorithm is

O(n)

O(n)

O(log )

O(log )

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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 complexity of merge sort algorithm is

O(n)

O(n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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
The complexity of Bubble sort algorithm is

O(n)

O(n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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
The Worst case occur in linear search algorithm when

Item is somewhere in the middle of the array

Item is somewhere in the middle of the array

Item is not in the array at all

Item is not in the array at all

Item is the last element in the array

Item is the last element in the array

Item is the last element in the array or is not there at all

Item is the last element in the array or is not there at all

Good Job!

Oops!

  • 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
The worst case complexity for insertion sort is

O(n)

O(n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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 complexity of Fibonacci series is

O(2n)

O(2n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

  • 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
The worst case occur in quick sort when

Pivot is the median of the array

Pivot is the median of the array

Pivot is the smallest element

Pivot is the smallest element

Pivot is the middle element

Pivot is the middle element

None of the mentioned

None of the mentioned

Good Job!

Oops!

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

Please login to submit your explanation

Question 10

Time: 00:00:00
 The worst case complexity of quick sort is

O(n)

O(n)

O(log n)

O(log n)

O(n2)

O(n2)

O(n log n)

O(n log n)

Good Job!

Oops!

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

Please login to submit your explanation

["0","40","60","80","100"]
["Need more practice!","Keep trying!","Not bad!","Good work!","Perfect!"]
×

Please login to report

Hey ! Follow us on G+