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
- Which type of firewall operates at the application layer of the OSI model and inspects incoming and outgoing data packets?
- A unique piece of information that is used in encryption.
- What is the worst-case time complexity of Bubble Sort?
- The time complexity of searching in a hash table with chaining is:
- Which of the following is true for the time complexity of binary search?
- In which traversal strategy does the algorithm explore all the neighbor nodes at the present depth prior to moving on to nodes at the next depth level? ...
- Which of the following CPU scheduling algorithms is optimal for minimizing average waiting time but requires knowledge of future process execution times?
- Which of the following is shared by the thread of the same process.
- Which layer of the OSI model is responsible for providing end-to-end communication services and ensures complete data transfer?
- Which cloud service model provides developers with a platform to develop, run, and manage applications without worrying about the underlying infrastructure...
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
Think You're Ready for RBI Grade B?
RBI Grade B 2026 Phase 1 Memory Based Paper
- 200 Questions with Detailed Solutions
- Section-wise Coverage (GA, English, Quant & Reasoning)