Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
Write an algorithm to calculate a postfix expression. Execute your algorithm using the given postfix expression as your input : a b + c d +*f ↑ .
To evaluate a postfix expression by using the given values:
clear the stack
symb = next input character while(not end of input)
{
if (symb is an operand)
push onto the stack;
else
pop two operands from the stack;
result=op1 symb op2;
push result onto the stack;
}
symb = next input character;
return (pop (stack));
The input postfix expression is given as:- ab+cd+*f^
Symb Stack Evaluation a a
b a b
+ pop a and b (a + b) Push (a + b)
c (a + b) c
d (a + b) c d
+ pop c and d (c + d) Push (c + d)
* pop (a + b) and (c + d) (a + b) * (c + d)
f (a + b) * (c + d) f
^ pop (a + b) * (c + d) and f (a + b) * (c + d) ^ f
The result of evaluation is ((a + b) * (c + d)) ^ f
Q. Sort the sequence written below of keys using merge sort. 66, 77, 11, 88, 99, 22, 33, 44, 55 Ans:
Two broad classes of collision resolution techniques are A) open addressing and B) chaining
Q. What do you understand by the tree traversal? Write down the procedure for traversing a binary tree in preorder and execute it on the following tree. Ans: Th
Write an algorithm using pseudocode which takes temperatures input over a 100 day period (once per day) and output the number of days when the temperature was below 20C and the num
Determine in brief the Painter Algorithm a) The farthest polygon, namely the rectangle PQRS, is stored first. (b) The next farthest, the quadrilateral ABCD, is superpo
#why all the 4 operations i.e. insertion n deletion from rear end and front end is valid in input restricted DEQUE
1.Create a flowchart to show the process that will allow the implementation of Stack, Push, and Pop operations. 2.Create a flowchart to show the process that will allow the impleme
Q. By making use of stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not.
Q. Let us consider a queue is housed in an array in circular fashion or trend. It is required to add new items to the queue. Write down a method ENQ to achieve this also check whet
Ruby implementation of the Symbol ADT Ruby implementation of the Symbol ADT, as mentioned, hinges on making Symbol class instances immutable that corresponds to the relative la
Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd