Register

MadeEasy Subject Test 2019: Programming & DS - Stack

• edited by
835 views
2 2 votes

 

 

I THING THERE IS MISTAKE BECAUSE BRACKET ARE CLOSING AFTER ELEMENT E  SO ALL OPERATORS HOULD BE POPED AND AND ACCORDING TO ME ANWER SHOLD BE 2…

TRY AND CORRECT IF I M WRONG !!!! THANKS IN ADVANCE!!!

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · finding equivalence ...Next → · grade up
← Previous in category · NIELIT 2018-41Next in category → · Programming logic pr...
Position:
Show:

Related questions

2 2 votes
2 2 answers
3.1k
3.1k views
jatin khachane 1 asked Dec 1, 2018
3,143 views
MadeEasy Test Series: Programming & DS - Stack
My doubt : What should we consider ^ operator as Bitwise XOR ? or Exponentiation
3 3 votes
3 answers 3 answers
5.0k
5.0k views
Tushar Shinde asked Jan 28, 2016
4,962 views
MadeEasy Test Series: Programming & DS - Infix Postfix
Consider the following expression with infix notationA * B - (C + D) * (E / 5) ^ F What is the maximum height of the operator stack during conversion from infix to postfi...
0 0 votes
0 0 answers
644
644 views
pranjalgennext asked Jan 19, 2017
644 views
MadeEasy Subject Test: Programming & DS - Stack
A priority queue is used to implement a stack efficiently. Push(C) is implemented as insert 'C'. Pop is implemented as a delete minimum element. For a sequence of operati...
1 1 vote
1 1 answer
1.3k
1.3k views
shivangi5 asked Dec 12, 2017
1,309 views
MadeEasy Test Series: Programming & DS - Stack
Options areTI==(P/Q*i-1)Ti==(P/Q*i+1)Ti==(P/Q*(i-1)-1)Ti==(P/Q*(i+1)-1)