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. Write an algorithm INSERT which takes a pointer to a sorted list and a pointer to a node and inserts the node into its correct position or place in the list. Ans: /* s
State in brief about assertion Assertion: A statement which should be true at a designated point in a program.
The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in
Write an algorithm in the form of a flowchart that: inputs top speeds (in km/hr.) of 5000 cars Outputs fastest speed and the slowest speed Outputs average (mean) s
Merging 4 sorted files having 50, 10, 25 and 15 records will take time
Suppose you are given the results of 5 games of rock-paper-scissors. The results are given to you on separate pieces of paper; each piece says either 'A' if the first person won, o
Q . Write down the non-recursive algorithm to traverse a tree in preorder. Ans: T he Non- Recursive algorithm for preorder traversal is written below: Initially i
hello, i need help in data mining assignment using sas em and crisp-dm
A company is carrying out a survey by observing traffic at a road junction. Every time a car, bus or lorry passed by road junction it was noted down. 10 000 vehicles were counted d
Q. Write down the recursive function to count the number of the nodes in the binary tree. A n s . R ecursive Function to count no. of Nodes in Binary Tree is writt
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