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.
Mendel chose ………….. pairs of contrasting characters for his study. In a monohybrid cross he obtained a definite phenotypic ratio of ……….. ...
Which part of sugarcane is preferred for sowing?
Auxins as herbicides are supposed to be:
Lichens, the pioneer organisms that initiate ecological succession are actually a symbiotic association of
At field capacity the moisture is held with soil water potential at __ ?
The silk fibres are held together in cocoon by a substance known as
What is the full form of IFOAM?
Among the following options, which weed is categorized as a total root parasite, meaning it relies entirely on its host plant's roots for nutrients and ...
Which technology is used by Beegle agritech and agri products pvt. Ltd for their Precision farming as a Service product?
For manufacturing of packaged drinking water, basic requirement for the food business operators to obtain FSSAI license includes
