Register

UGC NET CSE | June 2014 | Part 3 | Question: 41

• recategorized by
4,557 views

1 Answer

3 votes
3 votes

( ( A + B ) * C + D ) / ( E + F + G )

(  A  B + * C + D ) / ( E + F + G )

(  A  B +  C * + D ) / ( E + F + G )

 A  B +  C *  D +  /  ( E + F + G )

 A  B +  C *  D ) +  /  ( E  F + + G )

  A  B +  C *  D +  /   E  F +  G +

  A  B +  C *  D +    E  F +  G + /

Hence,Option(A)  A  B +  C *  D +    E  F +  G +  /  is the correct choice.

User Avatar
Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
2 answers
1
makhdoom ghaya asked Jul 11, 2016
1,969 views
UGC NET CSE | June 2014 | Part 3 | Question: 64
If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m$, where $n \leq m$, the expected number of collisions involving a particular key $K$ is Less than $1$ Less than $lg n$ Greater than $1$ Greater than $lg n$
If $h$ is chosen from a universal collection of hash functions and is used to hash $n$ keys into a table of size $m$, where $n \leq m$, the expected number of collisions ...
User Avatar
4 votes
4 votes
3 answers
3
Shimpy Goyal asked Jun 26, 2015
7,899 views
UGC NET CSE | June 2014 | Part 2 | Question: 40
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by $( ( ) \; ( ( ) ) \; ( ( ) ) )$ $2$ $3$ $4$ $5$
What is the maximum number of parenthesis that will appear on the stack at any one time for parenthesis expression given by$( ( ) \; ( ( ) ) \; ( ( ) ) ...
User Avatar
54 votes
54 votes
9 answers
4
go_editor asked Sep 28, 2014
24,790 views
GATE CSE 2014 Set 2 | Question: 41
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{POP}$ ... instruction. A queue can be implemented where both $\text{ENQUEUE}$ and $\text{DEQUEUE}$ take a single instruction each.
Suppose a stack implementation supports an instruction $\text{REVERSE}$, which reverses the order of elements on the stack, in addition to the $\text{PUSH}$ and $\text{PO...
User Avatar
Link Copied!