51. What would be the solution to the given prefix notation?
/ / / 16 4 2 1
/ / / 16 4 2 1
52. What is the time complexity of an infix to postfix conversion algorithm?
53. What would be the Prefix notation and Postfix notation for the given equation?
A+B+C
A+B+C
54. Is the given statement ((A+B) + [C-D]] valid with respect to balancing of symbols?
55. What would be the Prefix notation for the given equation?
A+B*C^D
A+B*C^D
56. What would be the Prefix notation for the given equation?
A^B^C^D
A^B^C^D
57. Consider the stack
| 5 |
| 4 |
| 3 |
| 2 |.
At this point, '*' is encountered. What has to be done?
| 5 |
| 4 |
| 3 |
| 2 |.
At this point, '*' is encountered. What has to be done?
58. What would be the solution to the given prefix notation?
- + 1 2 * 3 / 6 2
- + 1 2 * 3 / 6 2
59. Parentheses are simply ignored in the conversion of infix to postfix expression.
60. What is the time complexity for converting decimal to binary numbers?
Read More Section(Stacks in Data Structures)
Each Section contains maximum 100 MCQs question on Stacks in Data Structures. To get more questions visit other sections.