Score: 20 + 30 11. When the memory to which a pointer variable point is no longer needed, programmer deal locates it by using the a) delete operator parenthesis is? -. b) Not operator 12. The data structure required to check whether an expression contains balanced c) Null operator d) none b) Queue 13. The postfix form of A B+C/D is? a) Stack c) Array d) Tree a) AB/CD+ b) AB CD/+ c)A BC+/D d)ABCD+ 14. The postfix form of x+y z(pq+r)s, is a) xyz*+pq r+s*+ b) xyz*+pq*s c xyz+*pq'r+s+ d) none Which of the following statement(s) about stack data structure is/are NOT correct? a) Stack data structure can be implemented using linked list b) New node can only be added at the top of the stack c) Stack is the FIFO data structure d) The last node at the bottom of the stack has a NULL link 15. 16. Consider the following operation performed on a stack of size 5 Push(1); Pop(l: Push(2); Push(3); Popl; Push(4); Pop): Pop): Push(5); After the completion of all operation, the no of element present on stack are a)4 b) 2 c)3 d) 1 17. The type of expression in which operator succeeds its operands is? b) pre fix Expression c) postfix Expression d) None ts "m2, n, "o and "p"'are placed in a stack and are deleted one at a a) Infix Expression time, in what order will they be removed? c) ponm d) mnop a) mnpo Consider the usual implementation of parentheses balancing program using stack. What is the maximum number of parentheses that will appear on stack at any instance of time during the analysis of (O)) a) 1 b) nmop 19. b) 2 d) 4 20. The result of evaluating the postfix expression 5, 4, 6,+, ,4,9,3,1,+,is? a) 600 b) 350 c) 62 d) 120