0
It seems like you may have a typo in your question. If you are referring to the term "operator," in mathematics and computer science, an operator is a symbol that represents a mathematical or logical operation. Operators can be used to perform arithmetic calculations, comparison operations, or logical operations in programming languages. They are essential for manipulating data and controlling the flow of a program.
What else can I help you with?
What are the different types of Operators available in java?
arithmatic operator +,-,*,/,% assigment oprator == logical operator &,|,^,&&,,! bitwise opertor &,|,^ left shift << right shift >> left shift zero fill << assignment operator +=,-=,*=,/=
Write a java program that implements stack ADT converts infix expression to postfix form evaluates the postfix expression?
// made by vijay NITJ #include<iostream.h> #include<string.h> #include<stdio.h> #include<math.h> int precedence(char); void main() { char q[20]; char p[20]; char stack[20]; int tp=-1,ts=0; stack[0]='('; cout<<stack; int i=0, f=1; cout<<"enter the prefix expression "; gets(q); int l=strlen(q); q[l]=')'; while(ts!=-1) { if(q[i]>=47 && q[i]<=58 q[i]<=65 && q[i]<=90 q[i]<=97 && q[i]>=122) { p[++tp]=q[i]; } else if(q[i]=='(') stack[++ts]=q[i]; else if(q[i]=='+' q[i]=='-' q[i]=='*' q[i]=='/') { if(stack[ts]=='(') stack[++ts]=q[i]; else { while(stack[ts]!='(') { int p1=precedence(q[i]); int p2=precedence(stack[ts]); if(p2>=p1) p[++tp]=stack[ts--]; else { f=0; break; } } if(f==0) stack[++ts]=q[i]; } } else if(q[i]==')') { while(stack[ts]!='(') { p[++tp]=stack[ts--]; } ts--; } i++; } for(int j=0; j<=tp;j++) { cout<<p[j]; } //precedence program int precedence(char a) { if(a=='+' a=='-') return 1; else if(a=='*' a=='/') return 2; }
How download tally erp 9 release 1.82 pirated?
I am a data oprator
Why java not support oprator overloading?
Pressumably, the designers of Java thought this would lead to confusing code.
What are the different types of Operators available in java?
arithmatic operator +,-,*,/,% assigment oprator == logical operator &,|,^,&&,,! bitwise opertor &,|,^ left shift << right shift >> left shift zero fill << assignment operator +=,-=,*=,/=
Write a java program that implements stack ADT converts infix expression to postfix form evaluates the postfix expression?
// made by vijay NITJ #include<iostream.h> #include<string.h> #include<stdio.h> #include<math.h> int precedence(char); void main() { char q[20]; char p[20]; char stack[20]; int tp=-1,ts=0; stack[0]='('; cout<<stack; int i=0, f=1; cout<<"enter the prefix expression "; gets(q); int l=strlen(q); q[l]=')'; while(ts!=-1) { if(q[i]>=47 && q[i]<=58 q[i]<=65 && q[i]<=90 q[i]<=97 && q[i]>=122) { p[++tp]=q[i]; } else if(q[i]=='(') stack[++ts]=q[i]; else if(q[i]=='+' q[i]=='-' q[i]=='*' q[i]=='/') { if(stack[ts]=='(') stack[++ts]=q[i]; else { while(stack[ts]!='(') { int p1=precedence(q[i]); int p2=precedence(stack[ts]); if(p2>=p1) p[++tp]=stack[ts--]; else { f=0; break; } } if(f==0) stack[++ts]=q[i]; } } else if(q[i]==')') { while(stack[ts]!='(') { p[++tp]=stack[ts--]; } ts--; } i++; } for(int j=0; j<=tp;j++) { cout<<p[j]; } //precedence program int precedence(char a) { if(a=='+' a=='-') return 1; else if(a=='*' a=='/') return 2; }
