1 votes 1 votes Compiler Design compiler-design operator-precedence expression-evaluation numerical-answers ace-test-series + – sm asked Jan 3, 2018 • retagged Jun 23, 2022 by Lakshman Bhaiya sm 502 views answer comment Share Follow See all 4 Comments See all 4 4 Comments reply Hira Thakur commented Jan 3, 2018 reply Follow Share 72?? 0 votes 0 votes Ashwani Kumar 2 commented Jan 3, 2018 i reshown by Ashwani Kumar 2 Jan 3, 2018 reply Follow Share $(((2 \uparrow 3 )\uparrow (2 +1)) * 2) * (3 + 2)$ Solving this we get = $5120$ 0 votes 0 votes Ashwani Kumar 2 commented Jan 3, 2018 reply Follow Share Precedence given $ + > \uparrow > * $ 0 votes 0 votes Hira Thakur commented Jan 3, 2018 reply Follow Share yes,5120 is correct. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes S1. 2↑3↑(2+1=3)∗2∗ (3+2=5) (+ having high precednce) S2. (2↑3=8)↑3*2*5 (↑ more precedence than * and also left associative(first evalute leftmost) S3. (8↑3=512)*2*5 S4. 512*2*5=5120 hs_yadav answered Jan 3, 2018 hs_yadav comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes Given that: $2\uparrow 3\uparrow 2+1*2*(3+2)$ $\implies 2\uparrow 3\uparrow (2+1)*2*5$ $\implies (2\uparrow 3)\uparrow 3*2*5$ $\implies (8\uparrow3)*2*5$ $\implies (512*2)*5$ $\implies (1024*5)=5120$ Hira Thakur answered Sep 14, 2022 Hira Thakur comment Share Follow See all 0 reply Please log in or register to add a comment.