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 demonetization of high-value currency notes and the ________ of the goods and services tax regime have triggered a surge in the number of those fili...
Fill the blank with the most appropriate word.
The principal wanted to meet me _____________theft in the school .
- In each question a part is omitted which is then replaced by a blank. Choose the word from the given options that will fit into the blank most appropriatel...
Fill in the blanks with appropriate words from the alternatives given below each sentence.
We have nothing to do but ____ for her.Â
These _______ expectations were not fully realized.
Despite several British attempts to persuade them, the Dutch Republic refused __________ their former allies in the war and remained neutral.
Select the most appropriate option to fill in the blank.
Bengaluru is a beautiful city which ______ the modern with the traditional.
Select the most appropriate option to fill in the blank.
Our school had decided to take us to the Himalayas for excursion. I ________ to convin...
Which conjunction can be used for this sentence?
____________ we have cable, we get a wonderfully crisp picture, even on our old TV.
It’s easy to be ………… , but difficult to ………………
