हिंदी

Convert the following infix notation to postfix form. (P + Q * R - S)/T * U - Computer Science (Theory)

Advertisements
Advertisements

प्रश्न

Convert the following infix notation to postfix form.

(P + Q * R - S)/T * U

संक्षेप में उत्तर

उत्तर

(P + Q * R - S)/T * U
= (P + QR* - S)/TU*
= (P + QR* S-)/TU*
= (PQR*S-+)/TU*
= PQR*S-+TU*/
  1. Order of precedence as per BODMAS rule:
    ()
  2. *, /, % Same precedence, but the order of operation is left to right
  3. +, - Same precedence, but the order of operation is right to left
shaalaa.com
Conversion of Infix to Prefix and Post Fix Notations
  क्या इस प्रश्न या उत्तर में कोई त्रुटि है?
2023-2024 (February) Official
Share
Notifications

Englishहिंदीमराठी


      Forgot password?
Use app×