COMPUTER SCIENCE AND ENGINEERING
THEORY OF COMPUTATION
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Calculate the expression from right to left
|
|
|
Use ‘PUSH’ and ‘PULL’
|
|
|
Uses the principle of LIFO
|
|
|
Uses the principle of FIFO
|
Detailed explanation-1: -Stacks can be used to evaluate postfix notation equations (also known as Reverse Polish notation ). So the algorithm moves along the expression, pushing each operand on the stack while operators cause two items to be popped off the stack, evaluated and the result pushed back on the stacks .
Detailed explanation-2: -The primary difference between Stack and Queue Data Structures is that Stack follows LIFO while Queue follows FIFO data structure type. LIFO refers to Last In First Out. It means that when we put data in a Stack, it processes the last entry first. Conversely, FIFO refers to First In First Out.
Detailed explanation-3: -Last-In-First-Out In a LIFO data structure, the newest element added to the container will be processed first. Sometimes this will be called a stack and is usually pictured as below. The new element is always added at the end of the stack.