Q. A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?

View solution

Q. When the topological sort of a graph is unique?

View solution

Q. What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?

View solution

Q. Which of the following is not a stable sorting algorithm?

View solution

Q. If the number of records to be sorted is small, then sorting can be efficient.

View solution

Q. Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.

View solution

Q. Which of the following is not an in-place sorting algorithm?

View solution

Q. The complexity of sorting algorithm measures the as a function of the number n of items to be sorter.

View solution

Q. Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Which statement is correct?

View solution

Q. Consider the situation in which assignment operation is very costly. Which of the following sorting algorithm should be performed so that the number of assignment operations is minimized in general?

View solution