**DOWNLOAD FREE PDF** **<<CLICK HERE>>**

## Quickselect Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following is an alternative name of the quickselect algorithm?

quick sort | |

hoare's selection algorithm | |

tony's selection algorithm | |

kruskal's algorithm |

Question 1 Explanation:

Quick select is a selection algorithm. It was developed by Tony Hoare, thus it is also known as Hoare's selection algorithm.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Quickselect is an example of .....

sorting algorithm | |

selection algorithm | |

greedy algorithm | |

searching algorithm |

Question 2 Explanation:

Quickselect is an example of a selection algorithm. It finds the kth smallest element from the given list.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What will be the output if quickselect algorithm is applied to the array arr={1, 5, 4, 3, 7} with k given as 4?

1 | |

3 | |

4 | |

5 |

Question 3 Explanation:

Quickselect algorithm finds the kth smallest element from the given list. So as here the given value of k is 4 so we need to find the fourth smallest element which is 5 in the given array.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the auxiliary space requirement of the quickselect algorithm?

O(n ^{2}) | |

O(n) | |

O(n log n) | |

O(1) |

Question 4 Explanation:

Quickselect algorithm requires no extra space in order to calculate the desired result. It performs manipulations in the given array itself so its auxiliary space requirement will be O(1).

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Quickselect is an in-place algorithm?

true | |

false |

Question 5 Explanation:

Quickselect's auxiliary space requirement is O(1). So quickselect qualifies as an in-place algorithm.

There are 5 questions to complete.