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
Describe a string reversal algorithm. Write the difference between a [ ] [ ] and **a.
Write a C program to print all prime no.(1-100).
Write short notes on the following :
a) BFS
b) Tail recursion
Explain two-phase locking protocol.
Write short notes: B tree
