Spread the word.

Share the link on social media.

Share
  • Facebook
Have an account? Sign In Now

Sign Up

Have an account? Sign In Now

Sign In

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

Sorry, you do not have permission to ask a question, You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here
Sign InSign Up

SIKSHAPATH

SIKSHAPATH Navigation

  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Search
Ask A Question

Mobile menu

Close
Ask A Question
  • Home
  • Questions
  • Blog
    • Computer Science(CSE)
    • NPTEL
    • Startup
  • Shop
    • Internshala Answers
Home/ Questions/Q 5336
Next
In Process

SIKSHAPATH Latest Questions

Harshdalal15
  • 1
  • 1
Harshdalal15
Asked: November 17, 20212021-11-17T23:22:30+05:30 2021-11-17T23:22:30+05:30In: Data Structure

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (A) …

  • 1
  • 1

Explain the terms infix expression, prefix expression, and postfix expression. Convert the following infix expressions to their postfix equivalents: (A) ((A – B) + D / ((E + F) * G)) (B) ( A – 2 * (B + C) / D * E) + F (C) 14 / 7 * 3 – 4 + 9 / 2

and postfix expressionconvert the following infix expressions to their postfix equivalentsexplain the terms infix expressionprefix expression
  • 1 1 Answer
  • 946 Views
  • 0 Followers
  • 0
Answer
Share
  • Facebook

    1 Answer

    • Voted
    • Oldest
    • Recent
    1. I'M ADMIN
      I'M ADMIN
      2021-11-18T00:03:30+05:30Added an answer on November 18, 2021 at 12:03 am

      Infix: The typical mathematical form of expression that we encounter generally is known as infix notation. In infix form, an operator is written in between two operands.

      For example: 

      An expression in the form of A * ( B + C ) / D is in infix form.

       

       

      Prefix: In prefix expression, an operator is written before its operands. This notation is also known as “Polish notation”.

      For example, The above expression can be written in the prefix form as / * A + B C D.

       

      Postfix: In postfix expression, an operator is written after its operands. This notation is also known as “Reverse Polish notation”.

      For example, The above expression can be written in the postfix form as A B C + * D

       

      THE FULL ANSWER IS IN THE ATTACHMENT:

       

      Attachment

        • 1
      • Reply
      • Share
        Share
        • Share on WhatsApp
        • Share on Facebook
        • Share on Twitter
        • Share on LinkedIn

    Leave an answer
    Cancel reply

    You must login to add an answer.

    Forgot Password?

    Need An Account, Sign Up Here

    Sidebar

    store ads

    Stats

    • Questions 1k
    • Answers 1k
    • Posts 141
    • Best Answers 89
    • Cloud Computing Notes 101: Learn Fundamentals, Service Models, and Virtualization!
    • This Free AI Tool Translates Entire Books in Minute !
    • 25 Essential Software Testing Questions: Flashcard Edition!
    • 27 C++ Questions & Answers – Quiz 1 Flashcards
    • Interactive Alphabet Flashcards for Kids: A to Z Learning Fun!

    Explore

    • Recent Questions
    • Questions For You
    • Answers With Time
    • Most Visited
    • New Questions
    • Recent Questions With Time

    Footer

    SIKSHAPATH

    Helpful Links

    • Contact
    • Disclaimer
    • Privacy Policy Notice
    • TERMS OF USE
    • FAQs
    • Refund/Cancellation Policy
    • Delivery Policy for Sikshapath

    Follow Us

    © 2021-24 Sikshapath. All Rights Reserved

    Insert/edit link

    Enter the destination URL

    Or link to existing content

      No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.