Start learning 50% faster. Sign in now
A stack is the most suitable data structure for implementing recursion. This is because recursive calls need to store the state of the current function execution before jumping into the next function call. Stacks follow the Last In, First Out (LIFO) principle, which perfectly suits the recursive function call structure. Why Other Options are Wrong: b) A queue follows First In, First Out (FIFO), which doesn’t support the nature of recursion. c) Linked lists can be used for dynamic memory but are not suitable for managing function calls in recursion. d) Arrays have a fixed size and do not inherently support LIFO behavior. e) Hash tables are for storing key-value pairs and have no role in recursion.
Which of the following categories of borrowers are eligible for housing loans from Urban Cooperative Banks (UCBs)?
The global smartphone market is dominated by a few major players like Apple, Samsung, and a few Chinese brands. These companies engage in intense compet...
Which of the following bank holds 10% state in Brickwork Ratings?
What do ethics most closely relate to?
This process starts with which of the following?
The country’s retail inflation had crept above the RBI’s tolerance range in January 2022. It remained above the target range for ten months before r...
According to the stipulations for reporting fraud, when is the Statutory Auditor required to forward a report to the Secretary, Ministry of Corporate Af...
Which of the following document gives an aggregation of various types of expenditure and certain other items across demands?
Consider the following statement about Capital Budget:
I. Capital Receipts
II. Capital Payments
III. Capital Spending
Whi...
If Selling Price is 9 per unit, variable cost is 5 per unit and fixed cost is 100000, calculate PV ratio?