Register

MadeEasy Test Series: Programming & DS - Stack

• recategorized by
3,124 views
2 2 votes

My doubt :
 

What should we consider ^ operator as Bitwise XOR  ? or Exponentiation

 

2 Answers

3 3 votes
|6|2|3|  +
|6|5|  -             (2+3=5)
|1|                   (6-5=1)
|1|3|8|2| /        
|1|3|4|+          (8/2=4)
|1|7|*             (3+4=7)
|7|                 (1*7=7)

|7|3|^           (7^3 = 343)
|343|3|+
|346|

Therefore A=346

Y= 2*346+16 = 708

answer should be 26.60
0 0 votes
in C and most of the programming languages ^ is bitwise xor.
For exponentiation you can use ** in python3, math.pow in C.

But in this question ^ is to be interpreted as a maathematical operator rather than programming construct
Voting & Accepting an answer helps improve the community
← Previous · IEEE 754 Implicit an...Next → · made easy tt2
← Previous in category · Kth Largest element ...Next in category → · nielit
Position:
Show:

Related questions

2 2 votes
0 0 answers
835
835 views
CHïntän ÞäTël asked Dec 7, 2018
835 views
MadeEasy Subject Test 2019: Programming & DS - Stack
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 WRON...
3 3 votes
3 answers 3 answers
5.0k
5.0k views
Tushar Shinde asked Jan 28, 2016
4,958 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...
1 1 vote
2 2 answers
1.5k
1.5k views
smartmeet asked Jan 18, 2017
1,456 views
Virtual Gate Test Series: Programming & DS - Infix Notation
What we can do if the unary operator comes in infix notation while converting it into postfix/prefix notations? For example, this $a = -b+c*d/e+f↑g↑h-i*j$
2 2 votes
1 1 answer
2.7k
2.7k views
Gupta731 asked Dec 7, 2018
2,682 views
MadeEasy Test Series: Programming & DS - Stack
Consider a stack S given below with elements 1,2,3 along with the usual operations push(), pop() and top() as shown.The number of elements that will remain in the stack a...