Country which is pioneer in hybrid rice is :

Which command is used to undo the changes

Which data structure gives amortized O(α(n)) time for union and find operations, where α is inverse Ackermann?

Which algorithm guarantees the shortest path in a graph with negative weights but no negative cycles?

Which of the following operations on a data structure refers to the removal of an element from the front of a queue?

Which of the following sorting algorithms has a worst-case time complexity of O(N log N)?

Which algorithm is used to detect cycles in a directed graph?

Consider a directed acyclic graph (DAG). The problem of finding the longest path in a DAG (with edge weights) can be solved in:

The time complexity of building a heap from an unsorted array of n elements is:

In the context of searching, what is the primary advantage of using hashing?