Answer Posted / hasan ali mirza

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
int preceed(char c);
void push(char c);
char pop();
char stk[30];
int tos=-1;
int main()
{
int i,j=0,n,u,v;
char infix[30],postfix[30],c;
printf("Enter the infix expression:");
scanf("%s",&infix);
n=strlen(infix);
for(i=0;i<n;i++)
{
if((infix[i]>='a'&&infix[i]<='z')||(infix[i]>='A'&&infix[i]<='Z'))
{
postfix[j]=infix[i];
j++;
}
else if(infix[i]=='^'||infix[i]=='*'||infix[i]=='/'||infix[i]=='+'||infix[i]=='-')
{
u=preceed(stk[tos]);
v=preceed(infix[i]);
while(u>=v&&stk[tos]!='(')
{
postfix[j]=pop();
j++;
u=preceed(stk[tos]);
}
push(infix[i]);
}
else if(infix[i]=='(')
{
push(infix[i]);
}
else if(infix[i]==')')
{
c=pop();
while(c!='(')
{
postfix[j]=c;
j++;
c=pop();
}
}
else
{
printf("Equation has error\n");
exit(0);
}
}
while(tos!=-1)
{
postfix[j]=pop();
j++;
}
postfix[j]=='\0';
printf("The equation in postfix:%s",postfix);
}
void push(char c)
{
tos++;
stk[tos]=c;
}
char pop()
{
char val;
val=stk[tos];
tos--;
return(val);
}

int preceed(char c)
{
int v;
switch(c)
{
case '^':v=3;
break;
case '*':
case '/':v=2;
break;
case '+':
case '-':v=1;
break;
default:v=0;
break;
}
return(v);
}

15. What is your Future Plans for the Company if Permanently Employed?

3915

---

please tell me difference between router and cisco router

2149

---

computer is male or female.....???

1930

---

Is printf(?%d?,p); valid?

2114

---

i m doing engg in IT .for getting job which courses i have to do?

2096

---

Explain the memory reference and register reference instructions as micor operation.

4250

---

plz send me interview questions & answers of Data Structure

2095

---

5. Tell me about a time you were able to successfully deal with another person even when that individual may not have personally liked you (or vice versa).

2057

---

Tell me about a time when you had too many things to do and you were required to prioritize your tasks

1939

---

what is the formula/ ratio for hollow block? considering to a 40 kgs of portland cement.

1900

---

I APPLIED SBIPO EXAM PLZ SEND ME THE INTERVIEW QUESTIONS AND GD TOPICS AND WRITTENEXAM QUESTIONS

2180

---

Please help to write testcase for ECG machine

1970

---

Suppose that, even unrealistically, we are to search a list of 700 million items using Binary Search, Recursion (the algorithm given in class). What is the maximum number of comparisons that this algorithm must perform before finding a given item or concluding that it is not in the list?

3682

---

what is mean by tranducer

2222

---

i want to knw about what is lead,survey, oppertuinty , questionary,sales order,quotation,marketng conecpts in deatil and how it works in SAP CRM. Please send to my email- id as soon as possible. Thanks in Advance . :) nimi.nimisha1@gmail.com

2184

---