# InfytQ Algorithms-Quiz 4

Question 1

Time: 00:00:00
What is the application of binary search

To find the bound of ordered sequence

To find the bound of ordered sequence

intervals union

intervals union

debugging

debugging

all the above

all the above

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

Start

Question 2

Time: 00:00:00
Consider array={11,22,33,44,55} and target=44.how many iterations should be done to find the target.

1

1

2

2

3

3

4

4

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

Start

Question 3

Time: 00:00:00
Consider array={11,22,33,44,55} and target=44.what are the mid values generated until we  find the target.

33,44

33,44

33,22

33,22

44,55

44,55

33,55

33,55

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

Start

Question 4

Time: 00:00:00
Minimum number of moves used to solve tower of hanoi puzzle is

N-1

N-1

2^N

2^N

2^(N-1)

2^(N-1)

(2^N)-1

(2^N)-1

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

Start

Question 5

Time: 00:00:00
What are unstable sorting algorithms

merge sort

merge sort

insertion sort

insertion sort

bubble sort

bubble sort

none of the above

none of the above

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

Start

Question 6

Time: 00:00:00
Identify stable sorting algorithm

quick sort

quick sort

heap sort

heap sort

binary tree sort

binary tree sort

selection sort

selection sort

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

Start

Question 7

Time: 00:00:00
Time complexity of merging two sorted lists of size M and N

O(M*N)

O(M*N)

O(2^M * 2^N)

O(2^M * 2^N)

O(M+N)

O(M+N)

O(LOG(M+N))

O(LOG(M+N))

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

Start

Question 8

Time: 00:00:00
What happens if there is no base condition in recursion

Produces error

Produces error

Must have base condition

Must have base condition

Runs for infinite times

Runs for infinite times

Runs for a particular time

Runs for a particular time

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

Start

Question 9

Time: 00:00:00
Considering the best case , which of the following sorting algorithms is best according to time complexity.

tim sort

tim sort

bubble sort

bubble sort

insertion sort

insertion sort

all the above

all the above

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

Start

Question 10

Time: 00:00:00
________ is the time that depends on input which is already sorted

running

running

compilation

compilation

evaluating time

evaluating time

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%