Bissoy.com
Doctors Medicines MCQs Q&A

Related Questions

Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n number using randomized quicksort?
If altitude bubble is provided both on index frame as well as on telescope of a theodolite, then the instrument is levelled with reference toi) altitude bubble on index frameii) altitude bubble on index frame if it is to be used as a leveliii) altitude bubble on telescopeiv) altitude bubble on telescope if it is to be used as a level The correct answer is
If altitude bubble is provided both on index frame as well as on telescope of a theodolite, then the instrument is levelled with reference to
i) altitude bubble on index frame
ii) altitude bubble on index frame if it is to be used as a level
iii) altitude bubble on telescope
iv) altitude bubble on telescope if it is to be used as a level
The correct answer is
Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for Tim sort implementation?
Statement 1: Shell sort is a stable sorting algorithm. Statement 2: Shell sort is an in-place sorting algorithm.
Randomized quick sort is an extension of quicksort where the pivot is chosen randomly. what is the worst case complexity of sorting a numbers using randomized quick sort?
Why is insertion sort preferred over other sorting algorithms (like selection sort, bubble sort etc.) for introsort implementation?
The question below consists of a set of labelled sentences. These sentences, when properly sequenced form a coherent paragraph. Select the most logical order of sentences from among the options. P: A person is just like a bubble. Q: The air has reclaimed it; the atmosphere has reclaimed it. R: This bubble doesn’t have any substance of its own, just like every other creature. S: But when the bubble bursts, the substance that is inside the bubble, where is it?
Let Xij =I { zi is compared to zj in quick sort algorithm} is an indicator variable, and zi is the ith smallest number. Which of the following sequence of the numbers give the X2,5 = 1? Note: Assume that there is a divide and conquer quick sort algorithm and in partition algorithm the first element of the lists is taken as pivot-element.
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting (? ≥ 2) numbers? In the recurrence equations given in the options below, ? is a constant.