Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged expression-evaluation
1
votes
5
answers
1
UGC NET CSE | December 2004 | Part 2 | Question: 13
What is the value of the arithmetic expression (Written in C) $2*3/4-3/4*2$ $0$ $1$ $1.5$ None of these
What is the value of the arithmetic expression (Written in C)$2*3/4-3/4*2$$0$$1$$1.5$None of these
go_editor
1.4k
views
go_editor
asked
Mar 26, 2020
Programming in C
ugcnetcse-dec2004-paper2
programming-in-c
expression-evaluation
operator-precedence
+
–
0
votes
2
answers
2
AAI JE IT 2018
Suppose x and y are floating-point variables that have been assigned the values x=8.8 and y=3.5. what will be the value of the following expression? 2*x/3*y
Suppose x and y are floating-point variables that have been assigned the values x=8.8 and y=3.5. what will be the value of the following expression?2*x/3*y
aditi19
987
views
aditi19
asked
Dec 18, 2018
Programming in C
aai
expression-evaluation
+
–
5
votes
5
answers
3
NIELIT 2018-54
______ to evaluate an expression without any embedded function calls. Two stacks are required one stack is needed Three stacks are required More than three stacks are required
______ to evaluate an expression without any embedded function calls.Two stacks are requiredone stack is neededThree stacks are requiredMore than three stacks are require...
Arjun
2.1k
views
Arjun
asked
Dec 7, 2018
DS
nielit-2018
data-structures
stack
expression-evaluation
+
–
1
votes
3
answers
4
NIELIT 2018-85
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is $192$ $190$ $110$ $92$
Evaluation of the given postfix expression $10 \: 10 + 60 \: 6/^*8-$ is$192$$190$$110$$92$
Arjun
1.5k
views
Arjun
asked
Dec 7, 2018
DS
nielit-2018
data-structures
expression-evaluation
+
–
0
votes
1
answer
5
TANCET 2017 EXPRESSION EVALUATION
Balaji Jegan
248
views
Balaji Jegan
asked
Oct 23, 2018
Compiler Design
tancet
compiler-design
parsing
expression-evaluation
+
–
0
votes
1
answer
6
Expression Tree Evaluation
While evaluating the expression tree, if the left or right child is not present then the value of that particular missing child is taken as 0? Have a look at this question In my evaluation, I am getting: ( (a-0) - b ) - 0 + e! = a-b+e! Answer is given as option c but by this approach, I am getting option (d) as the answer.
While evaluating the expression tree, if the left or right child is not present then the value of that particular missing child is taken as 0?Have a look at this question...
garvit_vijai
485
views
garvit_vijai
asked
Sep 11, 2018
DS
expression-evaluation
data-structures
+
–
0
votes
1
answer
7
Associvity and precedence
Deepalitrapti
428
views
Deepalitrapti
asked
Aug 24, 2018
Compiler Design
compiler-design
expression-evaluation
operator-precedence
+
–
1
votes
2
answers
8
Ace test series
sm
461
views
sm
asked
Jan 3, 2018
Compiler Design
compiler-design
operator-precedence
expression-evaluation
numerical-answers
ace-test-series
+
–
2
votes
2
answers
9
made-easy
Consider the following productions along with their semantic rules Here ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for expression 3 ∗ 4 __________.
Consider the following productions along with their semantic rulesHere ⋅ i and ⋅ s corresponds to inherited and synthesized attributes respectively. The value for exp...
Jaspreet Kaur Bains
1.1k
views
Jaspreet Kaur Bains
asked
Dec 6, 2017
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
numerical-answers
made-easy-test-series
+
–
1
votes
0
answers
10
Expression evaluation question
To evaluate an expression with any embedded function call at any time how many stacks are needed?
To evaluate an expression with any embedded function call at any time how many stacks are needed?
iarnav
632
views
iarnav
asked
Nov 19, 2017
Compiler Design
stack
expression-evaluation
data-structures
+
–
1
votes
1
answer
11
Compiler Design #2
Consider translation rules : S → S1 * A {S. Val = S1. Val + A. Val} /A {S. Val = A. Val} A → A1 – B {A. Val = A1. Val – B. Val} /B {A. Val = B. Val} B → C | B1 {B. Val = C. Val / B1. Val} /C {B. Val = C. Val} C → id {C. Val = Id. Val} Let say output for input 8/4 * 2 – 6 * 4 is a1 and output for input 6 * 2 / 1 – 2 * 3 is a2, then a1 – a2 is ___________.
Consider translation rules : S → S1 * A{S. Val = S1. Val + A. Val}/A{S. Val = A. Val}A → A1 – B{A. Val = A1. Val – B. Val}/B{A. Val = B. Val}B → C | B1{B. Val =...
vishwa ratna
737
views
vishwa ratna
asked
Jan 18, 2017
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
numerical-answers
+
–
1
votes
1
answer
12
Compiler SDT Evaluation
KISHALAY DAS
1.3k
views
KISHALAY DAS
asked
Nov 14, 2016
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
test-series
+
–
4
votes
2
answers
13
Compiler Parse Tree Evaluation
KISHALAY DAS
476
views
KISHALAY DAS
asked
Nov 14, 2016
Compiler Design
compiler-design
parsing
expression-evaluation
test-series
+
–
0
votes
2
answers
14
MADE EASY TEST SERIES
Assume , -, + and / are operators. Precedences and associativity given for those operators as following: 1. has highest precedence among all operators and it is left associative 2. -, + and / are having equal precedence and they are right associative. Using as ... / is Division. The output of the following expression : 10 10 - 5 + 15 - 5 10 / 5 is ________.
Assume ×, –, + and / are operators. Precedences and associativity given for those operators as following:1. × has highest precedence among all operators and it is lef...
User007
1.2k
views
User007
asked
Oct 6, 2016
Compiler Design
compiler-design
expression-evaluation
operator-precedence
numerical-answersm
made-easy-test-series
+
–
4
votes
1
answer
15
...
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ______
Consider the expression tree shown. Each leaf represents a numerical value, which can either be 0 or 1. Over all possible choices of the values at the leaves, the maximum...
Rohan Mundhey
309
views
Rohan Mundhey
asked
Oct 2, 2016
Compiler Design
compiler-design
normal
expression-evaluation
numerical-answers
+
–
2
votes
1
answer
16
Expression Tree
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with each operator and operand along the way of push and pop operation
If we have to construct the expression tree from this expression (3 + ((5+9)*2)) then what will be the order of push and pop operation on a stack ?Explain what to do with...
shekhar chauhan
1.7k
views
shekhar chauhan
asked
Jul 14, 2016
DS
data-structures
expression-evaluation
stack
+
–
2
votes
1
answer
17
Give all phase output for the Expression
Give all phase output for the expression a=b+c*d/10.
Give all phase output for the expression a=b+c*d/10.
LavTheRawkstar
230
views
LavTheRawkstar
asked
Jun 25, 2016
Compiler Design
compiler-design
parsing
expression-evaluation
+
–
4
votes
3
answers
18
ISRO2009-32
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as $32^{30}$ $162^{30}$ 49152 173458 In original quetion 5 is not given.
The expression $1 * 2 \wedge 3 * 4 \wedge 5 * 6$ will be evaluated as$32^{30}$$162^{30}$49152173458In original quetion 5 is not given.
Desert_Warrior
2.9k
views
Desert_Warrior
asked
Jun 3, 2016
Compiler Design
isro2009
compiler-design
expression-evaluation
+
–
1
votes
1
answer
19
Evaluation of SDT
The way I solved it was : is this correct evaluation order ? Because in the answer they have mentioned different order :
The way I solved it was :is this correct evaluation order ?Because in the answer they have mentioned different order :
worst_engineer
890
views
worst_engineer
asked
Jan 5, 2016
Compiler Design
compiler-design
syntax-directed-translation
expression-evaluation
numerical-answers
test-series
+
–
25
votes
5
answers
20
TIFR CSE 2015 | Part B | Question: 15
Consider the following grammar (the start symbol is $E$) for generating expressions. $E \rightarrow T - E \mid T + E \mid T$ $T \rightarrow T * F \mid F$ $F \rightarrow 0 \mid1\mid 2\mid 3\mid 4\mid 5\mid 6\mid 7\mid 8\mid 9$ With respect to this grammar, which of the following trees is the valid evaluation tree for the expression $2*3*4 - 5*6+7$?
Consider the following grammar (the start symbol is $E$) for generating expressions.$E \rightarrow T - E \mid T + E \mid T$$T \rightarrow T * F \mid F$$F \rightarrow 0 \m...
makhdoom ghaya
3.0k
views
makhdoom ghaya
asked
Dec 8, 2015
Compiler Design
tifr2015
parsing
expression-evaluation
+
–
44
votes
7
answers
21
GATE CSE 2014 Set 2 | Question: 39
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the maximum possible value of the expression represented by the tree is ___.
Consider the expression tree shown. Each leaf represents a numerical value, which can either be $0$ or $1$. Over all possible choices of the values at the leaves, the max...
go_editor
9.3k
views
go_editor
asked
Sep 28, 2014
Compiler Design
gatecse-2014-set2
compiler-design
normal
expression-evaluation
numerical-answers
+
–
28
votes
6
answers
22
GATE CSE 2002 | Question: 2.19
To evaluate an expression without any embedded function calls One stack is enough Two stacks are needed As many stacks as the height of the expression tree are needed A Turing machine is needed in the general case
To evaluate an expression without any embedded function callsOne stack is enoughTwo stacks are neededAs many stacks as the height of the expression tree are neededA Turin...
Kathleen
9.8k
views
Kathleen
asked
Sep 15, 2014
Compiler Design
gatecse-2002
compiler-design
expression-evaluation
easy
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register