Start learning 50% faster. Sign in now
A binary heap is the most suitable data structure for implementing a priority queue because it allows for efficient extraction of the highest or lowest priority element. The time complexity for inserting and extracting elements is O(log n), making it highly efficient. Why Other Options are Wrong: a) Stack follows LIFO (Last In First Out) and cannot manage priority efficiently. b) Queue follows FIFO (First In First Out) and doesn’t handle priority. d) Linked list has linear time complexity for extracting elements based on priority. e) Array requires scanning the entire list for priority, leading to inefficient operations.
In what manner will the abettor be punished, if the act committed is different that what abettor intended?
Whoever tries to promote enmity amongst two groups of people in a place of worship he is punishable with?
Offences relating to Public servants is exclusively covered under which Chapter of IPC?
A preference shall be deemed to be given at a relevant time under the IBC a preference is given to a person other than a related party during the period...
Which section of the Indian Evidence Act, 1872 defines Private documents?
All the facts except___________________ may be proved by oral evidence.
Which of the following is incorrect with respect to the information that are required to be incorporated in the Memorandum of Association of a Company?
If a party wants to give secondary evidence of contents of a document which is in possession of another, he :
As per companies Act 2013, which of the following statements are correct?
1. A company shall not issue shares at a discount except sweat shares.<...
Which of the following is not a Fundamental Duty?