C program to convert Infix to Prefix using Stack data structure

-

Simple C program to convert Infix to Prefix using Stack data structure

Code:

#include<stdio.h>

#include<string.h>

#include<ctype.h>

#include<conio.h>



char steck[50];

int top=-1;

void push(char ele){

top++;

steck[top]=ele;

}

char pop(){

return (steck[top--]);

}

int isoperator(char ele){

if (ele=='^' ||ele=='#' || ele=='/' || ele=='+' || ele=='-'){

return 1;

}

else{

return 0;

}

}

int pre(char ele)

{

if (ele =='#') {

return 4;

}

else if (ele=='*' || ele=='/'){

return 3;

}

else if (ele=='+' || ele =='-'){

return 2;

}

else return 0;

}







void main(){

char infix[20],postfix[20];

int i,j=0;

char c;

clrscr();

printf("Enter the String: ");

scanf("%s",infix);

strrev(infix);

printf("%s",infix);

// printf("%d",strlen(infix));

for (i=0;i< (strlen(infix)) ;i++){

// c=infix[i];

if(isoperator(infix[i])){

if (top==-1){

push(infix[i]);

}

else{

while (pre(infix[i])<=pre(steck[top])){

postfix[j++]=pop();

}

push(infix[i]);

}

}

else{

postfix[j++]=infix[i];

}

}





while (top!=-1){

postfix[j++]=pop();

}

postfix[j]='\0';

printf("\n%s",strrev(postfix) );

getch();

}

Comments

Post a Comment

Popular posts from this blog

C program to evaluate Prefix Expression using Stack data structure

-
Simple C program to evaluate Prefix Expression using Stack data structure Code: #include<stdio.h> #include<conio.h> #include<string.h> int steck[10]; int top=-1; void push(int value) { steck[top++]=value; } int pop() { return(steck[top--]); } int ope(char c) { if(c=='+'||c=='-'||c=='*'||c=='/') return 1; else return 0; } void main() { char prefix[10]; int len,val,i,opr1,opr2,res; clrscr(); printf("Enter the prefix Expression: "); scanf("%s",prefix); len=strlen(prefix); for(i=len-1;i>=0;i--) { switch(ope(prefix[i])) { case 0: val=prefix[i]; push(val); break; case 1: opr1=pop(); opr2=pop(); switch(prefix[i]) { case '+': res=opr1+opr2; break; case '-': res=opr1-opr2; break; case '*': res=opr1*opr2; break; case '/': res=opr1/opr2; break; } push(res); } } printf("Result is %d",steck[top]); getch(); }
Read more

Java Program to Implement sorting algorithm using TCP on Server application

-
Simple Java program to Implement sorting algorithm using TCP on Server application Input: Give input on client side and client should receive sorted output from server and display sorted list on input(client) side. Note: You can implement any sorting algorithm by changing the sorting algorithm code on server side Code: Server: package aj.pkg7; import java.io.*; import java.net.*; import java.util.*; class Server { public static void main(String args[]) throws Exception { ServerSocket ss=new ServerSocket(1111); Socket s=ss.accept(); DataInputStream din=new DataInputStream(s.getInputStream()); DataOutputStream dout=new DataOutputStream(s.getOutputStream()); int r,i=0; int n=din.readInt(); int a[]=new int[n]; System.out.println("data:"); int count=0; for(i=0;i<n;i++) { a[i]=din.readInt(); } int number = a.length; for (int i1 = 0; i1 < number-1; i1++) for (int j1 = 0; j1 < number-i1-1; j1++) if (a[j1] > a[j1+1]) { int temp = a[j1]; a[j1] = a[j1+1]; a[j1+1] = temp; } ...
Read more

C++ program to perform data transformation Min-max and Z score Normalization

-
Simple C++ program to perform data transformation using min-max normalization, z-score normalization and decimal scaling operation. Code: #include<iostream> #include<math.h> using namespace std; int main() { int n; double sum=0; cout<<"Enter The Number of values:"; cin>>n; int a[n],r1,r2; for(int i=0;i<n;i++) { cin>>a[i]; } cout<<"Enter starting and ending range for normalization:"; cin>>r1>>r2; double max = a[0]; int min = a[0]; for (int i = 0; i <n; i++) { if (a[i] > max) { max = a[i]; } else if (a[i] < min) { min = a[i]; } } float v[n];double temp; for(int i=0;i<n;i++) { temp=double(double(double(a[i]-min)*(r2-r1))/(max-min))+ r1; v[i]=temp; } cout<<"normalization by Min-max"<<endl; cout<<"Values a...
Read more