Q.1.
The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
Q.2.
The data structure required to check whether an expression contains a balanced parenthesis is?
Q.3.
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm?
Q.4.
The process of accessing data stored in a serial access memory is similar to manipulating data on a ________
Q.5.
The postfix form of A*B+C/D is?
Q.6.
Which data structure is needed to convert infix notation to postfix notation?

Explanation

Q.7.
What is the result of the following operation?
Q.8.
The prefix form of an infix expression (p + q) – (r * t) is?
Q.9.
Which data structure is used for implementing recursion?