1. Which data structure is mainly used for implementing the recursive algorithm?

2. Which data structure is required to convert the infix to prefix notation?

3. Which of the following is the infix expression?

4. Which of the following is not the correct statement for a stack data structure?

5. Which of the following is the prefix form of A+B*C?

6. If the elements '1', '2', '3' and '4' are added in a stack, then what would be the order for the removal?

7. What is the outcome of the prefix expression +, -, *, 3, 2, /, 8, 4, 1?

8. The minimum number of stacks required to implement a stack is

9. Which of the following node is considered the top of the stack if the stack is implemented using the linked list?

10. What is another name for the circular queue among the following options?