Application of Stacks (Infix to Postfix) - Part 8

[@nisharathod2945]

Neso is SOOO underrated, I am able to solve toughest questions by learning crystal clear basics from them! You guys are amazing!

[@subhajitchoudhury9745]

Sir please Continue the course rapidly , because sir we are facing problem on sorting and tree Thank you sir one of the best channel ever ❤️🙏

[@mohdsameer1788]

Me too yrr

[@AzreenRajieveMANANGGOLO]

The genius behind all genius, keep the work going sir!

[@bisalranjanswain2434]

Mind blowing explanation sir. Thank you sir😇🙏

[@shivajichate867]

I have loved this video, thank you so much for making it.

[@ankitxalxotoo5580]

You are a great teacher sir 🙏🙏🙏,,,,One humble request Sir please complete this playlist fast ,

[@485-anuhyajanjam7]

Sir please make the video on python programming sir .I understood the C programming because of your channel.I want to learn python programming sir.

[@saniyamansuri9607]

Thank you for the lecture 👍🏻

[@priyajain4438]

Thank you so much Sir.

[@rajeshprajapati1851]

Thanks ! Noted down every detail. 👍

[@snehazz5284]

Do make videos on prefix also

[@rafiashan8389]

siiiiiirrrrr I can't thank you enoughhhhh

[@mohamedsamir2726]

For entering more than one digit number i made some modifications as: void InToPost() { int i, j=0,x; char symbol, next; for(i=0; i

[@MohammedSamir-w9k]

I am the same person and here is the overall code with some modifications: #include #include #include #include #define max 100 int top = -1; int stack[max]; char infix[max]; short postfix[max]; void push(int data); int pop(); void InToPost(); int precedence(short s); int post_evaluation(); void print(short *s); int main() { int result; printf("Enter an infix expression: "); gets(infix); InToPost(); print(postfix); result = post_evaluation(); printf("Evaluation of postfix = %d ",result); return 0; } void InToPost() { int i, j=0,x; short symbol, next; for(i=0; infix[i]!=NULL; i++) { symbol = infix[i]; switch(symbol) { case ' ': case '\t': break; case '(': push(symbol); break; case ')': while( (next = pop()) != '(') postfix[j++] = next; break; case '^': case '*': case '/': case '+': case '-': while(top!=-1 && precedence(symbol) = '0' && infix[i+1]

[@MDSagor-tu1xw]

Does it work for multi digits infix expressions ? What will happen if I use a multi digit infix expression ?

[@lokendrasinghrao]

Sir please upload all dsa lecturex before 10 january as I have final semester exams from 15 january.

[@galihtanu]

Cool sir. i hope can converted to arduino code.

[@morbidreality4909]

Sir also add queue topic

[@mohdsameer1788]

Please Sir upload lectures early

[@yadavmanuj5893]

1st view 🤭

[@subhajitchoudhury9745]

Ha ha 👍

[@anonyanonymous7018]

Problem: :( The algorithm will not work If the operand is of multiple digits. Example: Infix exp : (31+2)*2/3 Postfix exp: 312+2*3/ Array: |3| |1| |2| |+| |2| |*| |3| |/| Now when we evaluate the above expression we will push 3 1 2 And the moment we encounter an operator (+) we will pop 2 and 1. And will perform 1+2 which yeilds 3 then we will push this into the stack now the stack contains 3 3 Push 2 3 3 2 Encounter * Do 3*2 = 6 Push 6 3 6 Push 3 3 6 3 Encounter / Do 6/3 = 2 Push 2 3 2 Scanning finishes Now pop 2 So as per the algorithm the result of the above expression is 2 and that's obviously wrong. The result must be 22

[@rohithpamidimarri6639]

Yes sir!!

[@wog4299]

Yes obviously it will not work with multiple digits, that's why it is called as infix (a operator between 2 operands : A+B.

[@Dsc_30499]

Sir has already mentioned in the video that is the drawback we can only perform on single digit operands

[@dkdivakar699]

it is single digit evaluation bro😊

[@dkdivakar699]

so you can take single digit

[@kycideas9487]

Sir tell the computer organisation course sir,please

[@nesoacademy]

kzbin.info/aero/PLBlnK6fEyqRgLLlzdgiTUKULKJPYc0A4q