which operation is performed to remove top element in a stack?

What can the area of a parallelogram be used to find?

What is the average number of inversions in an array of N distinct numbers?

What is the most appropriate data structure to implement a priority queue?

Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is

Which of the following is a combination of LSD and MSD radix sorts?

Which of the following sorting algorithms is best suited for the case where the swap operation is expensive?

For the given array arr = {3, 4, 5, 2, 1}, the number of iterations required in bubble sort and selection sort are, respectively:

Which of the following standard algorithms is not dynamic programming based?

Because heap sort is easy to understand, heap sort is preferred over merge sort for introsort implementation.