Data Structure Basic Test – 3

1. What is the result of the following operation?
Top (Push (S, X))

2. The process of accessing data stored in a serial access memory is similar to manipulating data on a ________

3. The postfix form of A*B+C/D is?

4. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?

5. The prefix form of A-B/ (C * D ^ E) is?

6. The data structure required to check whether an expression contains a balanced parenthesis is?

7. Which data structure is needed to convert infix notation to postfix notation?

8. Which data structure is used for implementing recursion?

9. The prefix form of an infix expression (p + q) – (r * t) is?

10. What data structure would you most likely see in non recursive implementation of a recursive algorithm?