Evaluate the following postfix expression:
4, 5, 4, 2, ^, +, *, 2, 2, ^, 9, 3, /, *, -
Write a pseudo code for evaluate postfix expression.
[3+2]
Pseeduo code:
while tokens remain:
read the next token.
if the token is an operator:
pop the top two elements of the stack.
perform the operation on the elements.
push the result of the operation onto the stack.
else:
push the token (which must be a number)onto the stack
Find the postfix notation of
( a + b * x) / ( a ! – d ) s – c * y ( show all steps ).
Write a C program to convert any name in short name.
Write the characteristics of a good user interface.
Write the rules of DBA.
