Which data structure is most suitable for implementing recursion?
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.
24% of 150% of 500 + 140 = ? × 8
23 × 20 + ? = 182 + 92 + 82
(180 ÷ 22 ) ÷ (60% of 30) = (? ÷ 2)
1550 ÷ 62 + 54.6 x 36 = (? x 10) + (28.5 x 40)
1672 ÷ 19 = ?% of 220
What should come in place of the question mark (?) in the following question?
2 – [6 – {3 + (–4 + 5 + 1) × 8} + 12] = ?
360 ÷ 4 ÷ 3 = 150 – ?
{5% of (20 × 25) + 6% of (30 ×35)} ÷ 11 = ?
(1/2) – (3/5) + 3(1/3) = ? + (5/6)