Notations For Arthmatic Expression

 Polish notation (or) prefix notation and expressions Converse

Polish notation are also known as a prefix notation is defined as in this notation system operator is written before the operands, Example of polish and notations or prefix notations is +AB or /CD.

   Based on the operator position ,expressions are divided into three types . They are as follows.

  1. Infix expression 
  2. Postfix expressions 
  3. Prefix expression

Infix expression

In infix expression ,operators is used in between operands. The general structure of an infix expression is as follows .

Operand1 operator Operand2

>>Operators are written in between their operations .

>>This is used in our common mathematical expression .

  The operators forward of evolution are preformed from left to right and it obeys precedence rules i.e multiplication and division are performed before addition and subtraction. 

>>Bracket can be used to change the order of evolution .

Ex :-

a)A + B

b)x*(y+z)

c)(a+b)

Postfix Notation

>>In postfix expression operator is used after operations ,we can say that "operator follows the operands".

The general structure of postfix expression is as follows .

Operand1 operand2 opera ter2

>>Operators are written after their operators .

>>The order of evolution of operator is always from right to left .

>>Bracket cannot be used to changes the order of evaluation .

Ex:-

a)AB+.     b)xyz+*.        c)ab+

Prefix notations( Polish notations)

>>In prefix expression operator is used before operands, we can say that "operate in follows the operator"

>>The general structure of the prefix expression is as follow .

Operator Operand1 Operand2

>>Operators are written before their operands.

>>Order of evolution from left to right.

Ex:- a)+AB.        b)*x+yz.          c)+ab


Comments

Post a Comment

Popular posts from this blog

History of C language

Image
History of C language C Language history is very interesting which knowing it C programming language was developed by Dennis Ritchie at bell laboraties of AT and T(American Telephone & Telegraphi), which located at the U.S.A.     Dennis Richie is know as the founder of C language . It was developed to overcome the problem which were facing in previous language such as B,BCPL,etc.,     Initially ,c language was developed to be used in UNIX operating system . Later on it inherits many features of previous language such as B and BCPL. Year        programe               Introduced by 1960   ALGOL60 (Algorithmic language) international committee 1963 CPL(combined  programing language) Cambridge university 1967 BCPL(basic combined programing language Cambridge university(Martin Richard) 1970 B language  Kenthompson 1972 C language  Deniel ...
Read more

Lab programs of C

Important programs of c language  Cleck here for out puts👉 : Out-puts-of-this programs Note: 1.some program and out puts are not their in blog those will be posted soon. 2.some program not run in phone and some are show different out puts in phone .So, those type programs try in system..                                                                             🙏Please do follow, share and subscribe  ,any mistake in blog comment 🙏                                                                             1.Program on Escape squence. #include<stdio.h> int main() {  ...
Read more

Algorithm Pseudopods Flow-chat

Image
  Algorithm :-      An algorithm is a finite set of instructions (or) logics , written in order to accomplish a certain predefined task it is not the complete code or program which can be expressed either  as an informal high level description as a pseudo code or using a flowchart.   >> From the data structure point of view, following a some important categories of algorithm. >>Search :- algorithm to search an item in a data structure . >>Sort :-algorithm to sort in a certain order >>Insert :-algorithm to insert items in a data structure. >>Update :- algorithm to update an existing items in a data structure. >>Delete :- algorithm to delete an existing item from the data structure. Unambiguous :- Algorithm should be clear and unambiguous. Each of its step (or phase) and their input, output should be e clear must lead to only one meaning. Input :-An algorithm should have 0 or more well-defined inputs >>Output :-An...
Read more