Homechevron_rightEngineeringchevron_rightComputer Sciencechevron_rightData Structurechevron_rightIn conversion from prefix to postfix using stack data structure, if op...

In conversion from prefix to postfix using stack data-structure, if op...

  • Q. In conversion from prefix to postfix using stack data-structure, if operators and operands are pushed and popped exactly once, then the run-time complexity is
  • filter_dramaExplanation
    Answer is : B
    None.

Discussion

    No one started the discussion yet. Break the ice and start the conversation.
    Please Login to be part of the discussion.

Similar Questions

  • 1. A stack works on the principle of____________.
  • filter_dramaExplanation
    Answer is : A
    None.
  • 2. Inserting an item into the stack when stack is not full is called
  • filter_dramaExplanation
    Answer is : A
    None.
  • 3. Consider these functions:
    push() : push an element into the stack

    pop() : pop the top-of-the-stack element

    top() : returns the item stored in top-of-the-stack-node

    What will be the output after performing these sequence of operations

    push(20);

    push(4);

    top();

    pop();

    pop();

    pop();

    push(5);

    top();
  • filter_dramaExplanation
    Answer is : D
    None.
  • 4. The postfix equivalent of the prefix * + a b - c d is
  • filter_dramaExplanation
    Answer is : A
    None.
  • 5. The postfix form of A*B+C/D is?
  • filter_dramaExplanation
    Answer is : B
    None.

Data StructureTopics

leaderboardLeaderboard
  • Rahul Kumar

    191 Points

  • VIKRAM JEET

    54 Points

  • GEETHIKA CHOWDARY

    53 Points

  • sunita saini

    52 Points

  • Zain

    49 Points