Four applications or implementation of the stack, Data Structure & Algorithms

Q. Write down any four applications or implementation of the stack.                                    

Ans.

(i)       The Conversion of infix to postfix form

(ii)      The reversing of a line.

(iii)    The removal of recursion

(iv)     The Evaluation of post fix expression

 

 

 

Posted Date: 7/12/2012 8:30:31 AM | Location : United States







Related Discussions:- Four applications or implementation of the stack, Assignment Help, Ask Question on Four applications or implementation of the stack, Get Answer, Expert's Help, Four applications or implementation of the stack Discussions

Write discussion on Four applications or implementation of the stack
Your posts are moderated
Related Questions
Approximating smooth surfaces with Polygon nets Networks of polygons are used to represent smooth surfaces. They are, of course, only an approximation to the true surface, but

Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to

Any Binary search tree has to contain following properties to be called as a red- black tree. 1. Each node of a tree must be either red or black. 2. The root node is always b

Q. A linear array A is given with lower bound as 1. If address of A[25] is 375 and A[30] is 390, then find address of A[16].

What will be depth do , of complete binary tree of n nodes, where nodes are labelled from 1 to n with root as node and last leaf node as node n

How to measure the algorithm's efficiency? It is logical to examine the algorithm's efficiency as a function of some parameter n showing the algorithm's input size. Instance

Q. Write down an algorithm to merge the two sorted arrays into the third array. Do  not perform the sort function in the third array.                           Ans: void m

Addition of new records in a Binary tree structure always occurs as leaf nodes, which are further away from the root node making their access slower. If this new record is to be ac

Explain the Assertions in Ruby Ruby offers no support for assertions whatever. Moreover, because it's weakly typed, Ruby doesn't even enforce rudimentary type checking on opera

implement multiple stacks in an array and write different algorithms to perform operations on it