Question
Which data structure is most suitable for implementing
recursion?Solution
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.
The Chandigarh covers an area of ________
Where is Kandla Port located?
The GST Council, that takes all decisions regarding implementation of GST, is headed by
The Five year plan which recognized human development as the core of all development efforts?
Which of the following pairs (Organization - Headquarters) is incorrectly matched?
A) (UNICEF - New York City, U.S.)
B) (UNEP - Nairob...
Loan repayment by instalment payments is called as -
Who received the Nobel Prize for their work on the Photoelectric Effect?
Which of the following hydropower projects is NOT correctly matched with its respective river?
Malta recently became the 119th country to join the International Solar Alliance (ISA). On which continent is Malta located?
The Sultan Azlan Shah Cup is associated with which sport?
