# InfytQ Algorithms-Quiz 3

Question 1

Time: 00:00:00
Which sorting technique is used by sort() function in python

merge sort

merge sort

tim sort

tim sort

quick sort

quick sort

heap sort

heap sort

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

Start

Question 2

Time: 00:00:00
Assume an array with M elements in it , how many passes will it take by insertion sort

M+1

M+1

M

M

M^2

M^2

M-1

M-1

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

Start

Question 3

Time: 00:00:00
Let arr=[12,9,7,403,5,400,440]

How many passes did arr take if we use insertion sort

6

6

49

49

14

14

3

3

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

Start

Question 4

Time: 00:00:00
Give a real time example of usage of insertion sort

Arranging library books in order

Arranging library books in order

Arranging pack of cards

Arranging pack of cards

Both

Both

none of the above

none of the above

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

Start

Question 5

Time: 00:00:00
What is the worst case complexity of selection sort?

O(n)

O(n)

O(logn)

O(logn)

O(nlogn)

O(nlogn)

O(n^2)

O(n^2)

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

Start

Question 6

Time: 00:00:00
What is the advantage of selection sort over other sorting techniques

It has less time complexity than other sorting algorithms

It has less time complexity than other sorting algorithms

It has less space complexity than other sorting algorithms

It has less space complexity than other sorting algorithms

It does not require any additional storage space

It does not require any additional storage space

It is good to use selection sort if array is almost sorted

It is good to use selection sort if array is almost sorted

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

Start

Question 7

Time: 00:00:00
Best time complexity of selection sort

O(n)

O(n)

O(n^2)

O(n^2)

O(logn)

O(logn)

O(nlogn)

O(nlogn)

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

Start

Question 8

Time: 00:00:00
Euclidean algorithm derives prime factorization

True

True

False

False

Cannot determine

Cannot determine

none of the above

none of the above

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

Start

Question 9

Time: 00:00:00
Consider two numbers n and m (n>m)then according to euclid’s algorithm GCD(n,m)=

GCD(n,m%n)

GCD(n,m%n)

GCD(m,n%m)

GCD(m,n%m)

GCD(m,n)

GCD(m,n)

GCD(n,m//n)

GCD(n,m//n)

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

Start

Question 10

Time: 00:00:00
Average case time complexity of binary search (recursive method)

O(logn)

O(logn)

O(nlogn)

O(nlogn)

O(n)

O(n)

O(2n)

O(2n)

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

Start

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

Personalized Analytics only Availble for Logged in users

Analytics below shows your performance in various Mocks on PrepInsta

Your average Analytics for this Quiz

Rank

-

Percentile

0%

Completed

0/0

Accuracy

0%