Question
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log
Which data structure supports extraction of both min and max in O(1) time and insertion in O(log
n)?
More Algorithms Questions
- The time complexity of computing the all-pairs shortest paths in a dense graph with V vertices using Floyd–Warshall is:
- In the context of inter-process communication (IPC), which of the following mechanisms is used to ensure that only one process accesses a resource at a tim...
- In networking, what is the key difference between IPv4 and IPv6?
- Which of the following protocols operates at the Transport Layer of the TCP/IP model and is connectionless?
- Which algorithm uses a priority queue to repeatedly pick the next closest vertex?
- Which of the following CPU scheduling algorithms is optimal for minimizing average waiting time but requires knowledge of future process execution times?
- The Bellman-Ford algorithm executes relaxation steps how many times for a graph with V vertices?
- What is the primary role of a hypervisor in a virtual machine (VM) environment?
- Which of the following is substring of “IXAMBEE”?
- A directed acyclic graph (DAG) has 10 vertices and 15 edges. What is the maximum possible number of topological orderings?
Hey! Ask a query
Please enter email id
The email must be a valid email address.
Please enter Mobile Number
Please enter valid Mobile Number
Please enter your Doubt
