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 an algorithm to test whether a given binary tree is a binary search tree."
What is an Abstract Data Type? What do you mean by a Dynamic Data Structure?
Define the ADT for stack. Show the implementation of the stack data structure using linked list.
Discuss the ACID properties of transaction.
What is the Modularity of a Software System ?
Write a C program to check a number is even or odd.
Write a C program to convert any name in short name.
