Reverse Polish Notation - CPU Architecture - Computer Organisation and Architecture

TL;DR

This session discusses the three notations used for arithmetic operations in processors - infix, prefix, and postfix.

Transcript

hello everyone in this session we will understand about various notations that are going to be used in order to perform an arithmetic operation within a processor you know that there are several regis organizations in fact three all together the first one is single accumulator organization second one is general register and the third one is stack o... Read More

Key Insights

• 🔂 Processors have three organizations: single accumulator, general register, and stack.
• 🎭 In the general register organization, arithmetic operations can be performed using either infix or prefix notation.
• 😒 Stack organizations require the use of postfix or reverse polish notation.
• 🫷 In postfix notation, operands are pushed into a stack, and operations are performed on the topmost elements in the stack.
• 👻 Reverse polish notation allows for efficient calculations in stack-based processors.
• ❓ Infix notation has the operator between the operands, while prefix notation has the operator preceding the operands.

Questions & Answers

Q: What are the three different notations used for arithmetic operations in processors?

The three notations used are infix, prefix, and postfix. In infix, the operator is between the operands. In prefix, the operator precedes the operands. In postfix, operations are performed on operands available in a stack.

Q: How do you write an addition operation in infix notation for the general register?

An addition operation in infix notation for the general register can be written as "r1 = r1 + r2" or "r1 + r2", where r1 and r2 are the operands.

Q: What is postfix notation?

Postfix notation, also known as reverse polish notation, is a notation used when the CPU supports only stack operations. It involves performing operations on operands available in a stack. The operator follows the operands.

Q: How is multiplication performed using postfix notation?

In postfix notation, multiplication is performed by pushing the operands into the stack, followed by the multiplication operation. The top two elements in the stack are multiplied, and the result is stored in a lower position in the stack.

Summary & Key Takeaways

• Processors use three different notations for arithmetic operations: infix, prefix, and postfix.

• In infix notation, the operator is placed between the operands.

• In prefix notation, the operator precedes the operands.

• In postfix notation, also known as reverse polish notation, operations are performed using operands available in a stack.