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. Illustrate the result of running BFS and DFS on the directed graph given below using vertex 3 as source. Show the status of the data structure used at each and every stage.
For the following graph find the adjacency matrix and adjacency list representation of the graph.
Q. Suggest a method of implementing two stacks in one array such that as long as space is there in an array, you should be capable to add an element in either stack. Using proposed
A queue is a, FIFO (First In First Out) list.
Q. By making use of stacks, write an algorithm to determine whether the infix expression has balanced parenthesis or not.
how to draw a 5 inch square on the screen using * symbol
Q. Write down the algorithm to insert an element to a max-heap which is represented sequentially. Ans: The algorithm to insert an element "newkey" to
You have to sort a list L having of a sorted list followed by a few "random" elements. Which sorting methods would be especially suitable for this type of task? Insertion sort
In this example, suppose the statements are simple unless illustrious otherwise. if-then-else statements if (cond) { sequence of statements 1 } else { sequence of st
The best algorithm to solve a given problem is one that requires less space in memory and takes less time to complete its execution. But in practice it is not always possible to
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