Question
Which data structure is most suitable for implementing a
priority queue with logarithmic time complexity for insertion and deletion?Solution
A binary heap offers O(log n) insertion and deletion operations, ideal for priority queues. Other options: Stack/Queue don’t maintain priority; AVL Tree offers O(log n) but more overhead; Hash Table doesn’t maintain order.
Under the Hindu Marriage Act, 1955, which of the following is not a valid ground for divorce?
What is the default amount for initiating the CIRP as provided under the IBC?
As per Criminal Procedure (Identification) Act 2022, the record of measurements shall be retained in digital or electronic form for a period of ……�...
The Employees Provident Fund and Miscellaneous Provisions Act, 1952 is applicable in case of any factory / establishment employing
Ab invito means
The Constitutional Validity of Section 309 (Attempt to commit Suicide) has been restored by the Supreme Court of India in which of the following cases?
As per section 4A of the Delhi Special Police Establishment Act no appointment of a Director shall be invalid merely by reason of_______________________
Written communication shall be made by ___________ to the President before a Proclamation is issued by him under Art. 352 (1).
Every suit instituted, appeal preferred, and application made after the prescribed period shall be dismissed-
In chief- examination, leading question________.
