+1 vote
in Data Structures & Algorithms I by (110k points)
How many stacks are required for reversing a word algorithm?

(a) one

(b) two

(c) three

(d) four

My query is from Reverse a Word using Stack in chapter Application of Stacks of Data Structures & Algorithms I

I got this question in homework.

1 Answer

+1 vote
by (408k points)
selected by
Best answer
The correct option is (a) one

Explanation: Only 1 stack is required for reversing a word using stack. In that stack, push and pop operations are carried out.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.