STACK APPLICATION : EXAMPLES FOR CONVERTING INFIX TO POSTFIX EXPRESSION - DATA STRUCTURES
HTML-код
- Опубликовано: 20 июн 2019
- EXAMPLES FOR CONVERTING INFIX TO POSTFIX EXPRESSION
ALGORITHM FOR CONVERTING INFIX TO POSTFIX EXPRESSION
• STACK APPLICATION : IN...
Hloo sir; In Our college , faculty of computer science professors are 6 members, but not understood any concept so, computer science were become tough for me. Sir u explais in a very very simple manner for understanding and now iam performing very well in the subject JUST BECAUSE U SIR. DONT KNOW HOW TO THANQ U SIR. U are brilliant professor .and this is the CORRECT way for explaining for a Dull student or average student, for becoming a topper in the subject. A HUGE RESPECT OF U SIR.
Super 💥💥💥 🤩🤩🤩
Its very good to see a man who is very passionate in teaching,I mean I could see the sweat on his forehead and he still continued lecturing .We need more lectures like you. Thank you from the bottom of my heart.
You have explained this so well. Thank you Sir!
The last example that you explained in this video clear my doubt that what should we do when priority is same.I have seen so many videos but it's not cleared but you make me perfect.thank you sir👌👌🤝🤝
sir your videos are excellent,well paced and explained thank you for your efforts.
you are a great teacher i have ever seen sir .keep doing this videos and make knowlegeble students by your videos.jai hind sir.
Best!!! Very easy to understand !! Thanks sir
Thank you so much sir 🙏 , nice explanation
Really ....I learned ...tq sir
Great!!!!!
Helped me a lot
Your videos are awesome 👏
Sir u r very great teacherrrrrr ur methodds of teaching is just unbelievable ❤️❤️❤️
Well explained sir..
Thank you!!
Sir good explanation every point are easy thanks for your help sir by the way I'm viewing from 2020 dec
Super sir..thanks for this video
Superb sir......fantastic class👍
You are simply best sir
Great step by step explanation sir .
Wonderful expression sir
Thankyu sir✨😊
Tq u sir ..🙏 it's very clear and neat
easy way to teach thank you sir
thank you sir..understood
sir you are the best ....
Super explanation sir tq so much
Thank u sir..
Very nice teaching...👍💫
Thank you so much sir 💯
Superb 👏👏
Thank you sir very well explained
thank you sir!
Sir what if same priority operator comes twice should we move one of the operator to postfix expression or should be pushed into stack??
You are good teacher I wish do better and give knowledge to us
You are great sir 🙏
Sir it was awesome.But sir please upload the program also for this. We need it.
Thank you sir ❤
Thank you so much sir😊
Tq so much sir understood very well
Super explanation sir
im watching these lecture for prepration seems better.pl send priority order
Database management system videos have? Sir
Pls let me know
Fabulous!
Nice explanation sir
Superb sir
Brilliant
Thanks❤🌹😊
Sir mujhe ak baat batao ki.(+*^ jab bracket close ho jae toh matlab (+*^) ab yahi expression main hum likheng ^*+ .is it ok?pls reply me
hello sir can u please provide the all lessons pdf of data structure plz it will be very usefull for us in our collage they have not provided anything sir
Great
Sir,can u do a video for infix to prefix expression ,it will be easier for us to understand sir
Superr sir
Sir circular queue explain chesthara ....
THANK YOU sir
Super sir
Hi Sir , where we used above concept ( infix to postfix ) in real world
Excellent Sir thank you so much
nyce
Is stack is limited for three operators
Pls tell priority of operators
Hello sir. Can you do a video for infix to prefix and prefix to postfix expression, it will be easier for us to understand sir.please...........
Sir can you provide conversion of infix to prefix videos
how to wright code in the above example
🙏
Priorities order for operators ???
Thank u sir I have one doubt sir if the last element of the stack is -,* then what u will write first in the postfix
- AND *
*-
It it be two of them already they must be already in presendence so first *and +
Sir how to convert infix to prefix
Sir / and × which is having highest priority
X
Thank you . Sir .
Stack applications .plz tell me Operators priority . Like -=+ , *>-, plz tell all operators ..
^ highest then /* are equal then -+ equal
If the two operators have same prioirty..then what we have to do?
hi
if the operator in stack and reading operator having same priority then
first pop the operator from stack and insert into expression stack and check the priority with next operator in stack.
Hope your doubt has been clarified.
Hi, sir, whare is the parenthesis bracket in postfix expression
Hi
In postfix expression we can ignore the parenthesis as we are converting based on precedence.
@@sundeepsaradhi ok sir tq u.
I want software engineering explanation vedios
Solve this evaluate the expression 436/3*-2+
If in my college they will say like this there will be no failures
Sir can you please tell me the priority order for :+, -, *, /
* and / have higher priority than +,-
@@sachinsenakulk Can we even follow the BODMAS rule this one sir?
Then modulo
Sir, will you please tell me how can we know that which operators have highest priorities and lowest priorities??
sai preeth the same as math “PEMDAS” where * / has priority over + -
Hii sir
For 3rd example am getting ab/c-d*e+a*c
Uncle , explain also in hindi