Class 12 CS Chapter 10 Data Structures – II Stacks And Queues Solutions Sumita Arora New Syllabus

/ Uncategorized / By

Ex 10.1 Solutions

Ex 10.2 Solutions

Back Exercise Part A

Back Exercise Part B

4. Write the equivalent infix expression for
6. Consider the arithmetic expression F, written in postfix notation :
...
click here for answer
5. Write the equivalent infix expression for a, b, AND, a, c, AND, OR.
...
click here for answer
8. Consider each of the following postfix expressions :
(i) (ii) ...
click here for answer
11. Give postfix form of expression for the following :
precedence of ...
click here for answer
12. Evaluate the following postfix notation of expression : True, False, NOT, AND, True, True, AND, OR
...
click here for answer
1. Translate following infix expression into its equivalent postfix expression :
( ( ...
click here for answer
2. Translate following infix expression into its equivalent postfix expression :
( A ...
click here for answer
3. Translate following infix expression into its equivalent postfix expression :
A*(B+D)/E-F-(G+H/K) ...
click here for answer
7. Convert the following infix notation of expression to an equivalent postfix notation of expression (Show status of Stack after execution of each operation) : (A + B ) * C – D / E
...
click here for answer
9. Give postfix form of the following expression :
A*(B + ...
click here for answer
10. Give postfix form for A + [(B + C) + (D + E) * F]/G.
...
click here for answer
13. Evaluate the following postfix expression using a stack and show the contents of the stack after execution of each operation 5, 11, -, 6, 8, +, 12, *, /
...
click here for answer
15. Consider the infix expression
...
click here for answer
16. Write equivalent Postfix expressions for the infix expressions given below :
(i) A ...
click here for answer
17. Evaluate the following postfix notation of expression : 10 20 + 25 15 – * 30 /
...
click here for answer
18. Evaluate the following postfix notation of expression : 20 10 + 5 , 2 ^ – 1 0 /
...
click here for answer
19. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation :
120, 45, ...
click here for answer
20. Evaluate the following postfix expression using a stack and show the contents of stack after execution of each operation :
20, 45, ...
click here for answer
21. Use a stack to evaluate the following postfix expression and show the content of the stack after execution of each operation. Don’t write any code. Assume as if you are using push and pop member functions of the stack AB – CD + E * +
(where A ...
click here for answer
22. Change the following infix expression into postfix expression. (A + B) * C + D / E – F
...
click here for answer
23. Evaluate the following postfix notation of expression :
...
click here for answer
24. Convert the following infix expression to its equivalent postfix expression showing stack contents for the conversion :
...
click here for answer
25. Convert the following infix expression to its equivalent postfix expression showing stack contents for the conversion :
A + ...
click here for answer

Back Exercise Part C