Skip to content

Bytes of the day

A CS byte per day

  • Home
  • About
  • Operating Systems
  • Algorithms
  • Data Structures
  • Theory of Computation
  • Discrete Mathematics
  • Archives

Prefix Notation

Q103: Equivalent prefix expression

Posted on October 19, 2014October 14, 2014 by bytesoftheday

Question #103: What is the equivalent prefix expression for ((A + B) * (F + G))?

Options:

  1. +*AB+FG
  2. *++ABFG
  3. *AB+FG+
  4. *+AB+FG

Solution: * should be performed as the last operation and both + should be performed before multiplication. Hence, correct option is the 4th one.

Posted in Algorithms, Data StructuresTagged algorithm, GATE, Infix Notation, Postfix notation, Prefix NotationLeave a comment

Enter your email ID to get a CS byte per day!

We are now on facebook!

We are now on facebook!

We post *almost* daily :)

February 2026
M T W T F S S
 1
2345678
9101112131415
16171819202122
232425262728  
« Feb    

Recent Bytes

  • Q171: Solution to Critical Section Problem
  • Q170: Total no. of ways to climb n stairs (one or two at a time)
  • Q169: What is the maximum number of inversions possible?
  • Q168: How many no. of inversions exist in the following sequence?
  • Q167: What happens to shortest paths when we tweak the graph edges
Blog at WordPress.com.
Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use.
To find out more, including how to control cookies, see here: Cookie Policy
  • Subscribe Subscribed
    • Bytes of the day
    • Join 47 other subscribers
    • Already have a WordPress.com account? Log in now.
    • Bytes of the day
    • Subscribe Subscribed
    • Sign up
    • Log in
    • Report this content
    • View site in Reader
    • Manage subscriptions
    • Collapse this bar
Design a site like this with WordPress.com
Get started