Which data structure is most suitable for implementing a priority queue?
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.
Calculate P/E Ratio from the following:
Equity share capital @ 10 each : 800000
9% preference share capital: 300000
Profit (afte...
Under which of the following methods is the latest cost of inventories charged to production but the old prices are charged to inventories in hand?
The Reserve Bank of India (RBI) has permitted non-banking finance companies operating as Infrastructure Debt Fund (IDF-NBFCs) to raise money through ext...
Identify the Organisation from the passage given below.
It was created in 1944, as the International Bank for Reconstruction and Development (...
The theory which focusses on consequences of greater good and evil ___________.
Mr. Ankit received 1000 ESOPs at Rs.50 each. The fair value of the shares is Rs.120 at vesting time and Rs.130 at exercise time. What is the value of ES...
What is the primary purpose of financial regulations?
S Ltd. took a loan from the bank for 10,00,000 to be settled within 5 years in 10 equal half yearly instalments with interest. The first instalment is ...
Which organization approved Zurich Insurance's acquisition of a 70% stake in Kotak General?
The rupee denominated bond issued outside India by Indian entities. They are debt instruments help to raise money in local currency from foreign invest...