search
Log In
0 votes
42 views

The postfix notation for infix notation $a^*(b+c)+d÷e$ is given by

  1. $abc^*+de ÷ +$
  2. $abc+^*de ÷ +$
  3. $abcde +^*÷ +$
  4. $abc^*+de + ÷$
in Others
recategorized by
42 views
0
Option B

Please log in or register to answer this question.

Related questions

0 votes
1 answer
1
58 views
In relational DBMS, the closure of functional dependencies facilitates To determine the candidate key To determine the foreign key To determine the dependency of an attribute with other attribute/s None of these
asked Aug 4, 2019 in Others gatecse 58 views
0 votes
1 answer
2
63 views
The schema for the entire database is designed using Data definitional language Structured query language Data manipulation language Schema structure language
asked Aug 4, 2019 in Others gatecse 63 views
0 votes
0 answers
3
42 views
The Software Development Life Cycle (SDLC) is used in all Process models Design models Programming models None of these
asked Aug 4, 2019 in Others gatecse 42 views
0 votes
0 answers
4
36 views
The complexity of algorithms is comparatively more accurate in the use of Asymptotic analysis Amortized analysis Both of these Not dependent on the nature of analysis.
asked Aug 4, 2019 in Others gatecse 36 views
...