Q. How many flips does the simplest of pancake sorting techniques require?

View solution

Q. Pancake Sorting appears in which of the following?

View solution

Q. In addition to the pancake sorting problem, there is the case of the burnt pancake problem in which we are dealing with pancakes (discs) that are burnt on one side only. In this case it is taken that the burnt side must always end up _______

View solution

Q. In a computational complexity theory, a problem with decision making is said to be NP-complete when it is both in NP and NP-hard. What does NP mean?

View solution

Q. When we realize a specific implementation of a pancake algorithm, every move when we find the greatest of the sized array and flipping can be modeled through __________

View solution

Q. The Pancake Problems (1975, 1979, 1973) did NOT involve which of the following people?

View solution

Q. Topological sort can be applied to which of the following graphs?

View solution

Q. Most Efficient Time Complexity of Topological Sorting is? (V – number of vertices, E – number of edges)

View solution

Q. Topological sort starts from a node which has?

View solution

Q. What can be the applications of topological sorting?

View solution

Q. Topological sort of a Directed Acyclic graph is?

View solution

Q. Topological sort can be implemented by?

View solution

Q. Topological sort is equivalent to which of the traversals in trees?

View solution

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