java code and algorythem, Data Structure & Algorithms

Suppose that you want to develop a program that accepts a postfix expression and asks values for variables in the expression. Then you need to calculate the answer for the expression according to the given values.

a) Write the pseudo code algorithm for the above problem

b) Implement the algorithm in Java
Posted Date: 5/14/2017 1:47:06 AM | Location :







Related Discussions:- java code and algorythem, Assignment Help, Ask Question on java code and algorythem, Get Answer, Expert's Help, java code and algorythem Discussions

Write discussion on java code and algorythem
Your posts are moderated
Related Questions
#What is the pointer

Method to measure address of any element of a matrix stored in memory. Let us consider 2 dimensional array a of size m*n further consider that the lower bound for the row index

It is a useful tool for indicating the logical properties of data type. It is a collection of values & a set of operations on those values. Methodically, "a TYPE is a set, & elemen

Step-1: For the current node, verify whether it contain a left child. If it has, then go to step-2 or else go to step-3 Step-2: Repeat step-1 for left child Step-3: Visit (th

In the last subsection, we have implemented a stack by using an array. While a stack is implemented by using arrays, it suffers from the basic restriction of an array - i.e., its s

Asymptotic notation Let us describe a few functions in terms of above asymptotic notation. Example: f(n) = 3n 3 + 2n 2 + 4n + 3 = 3n 3 + 2n 2 + O (n), as 4n + 3 is of

Queue is a linear data structure utilized in several applications of computer science. Such as people stand in a queue to get a specific service, several processes will wait in a q

write an algorithm to sort given numbers in ascending order using bubble sort

Define Minimum Spanning Tree A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum

What is the best-case number of comparisons performed by mergesort on an input sequence of 2 k distinct numbers?