Take a note while surfing.
Give your Note a Colorful Tag.
Stay on same information and in Sync wherever you are.
Organize your information,It may take Shape.
Differ your Content by Color.
Easy to pull up your content from anywhere anytime.
Don't Let information to miss,Because it take shape
Simple an Easy Way to take a note.
Get the same in next visit.
1. The five items: A,B,C,D and E are pushed in stack, one after the other starting from A. The stack is
Is popped four items and each element is inserted in a queue. Then two elements are deleted from the queue and pushed back on the stack . Now one item is popped from the stack.
The popped item is.
2. Convert the infix to postfix for A-(B+C)*(D/E)
3. What is the postfix form of the following prefix expression -A/B*C$DE
4. The minimum number of multiplications and additions required to evaluate the polynomial
P = 4x^3+3x^2-15x+45 is
5. The data structure required to evaluate a postfix expression is
6. The data structure required to check whether an expression contains balanced parenthesis is
7. The process of accessing data stored in a serial access memory is similar to manipulating data on a
8. The postfix form of the expression is (A+B) * (C*D-E)*F/G is
9. The pre-order and post order traversal of a Binary Tree generates the same output. The tree can have maximum
10. What data structure would you mostly likely see in a nonrecursive implementation of a recursive algorithm?