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
ST AC K is explained as follows : A stack is one of the most usually used data structure. A stack is also called a Last-In-First-Out (LIFO) system, is a linear list in

Construct G for α, n, and W given as command line parameters. Throw away edges that have an asymmetric relation between nodes. That is, if A is connected to B, but B is not connect

Explain about the Structured types - Built-In Types Values of the carrier set are not atomic, consisting rather than several atomic values arranged in some way. Common illu


Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

Define the term 'complexity of an algorithm; Complexity of an algorithm is the calculate of analysis of algorithm. Analyzing an algorithm means predicting the resources that th

Z-Buffer Algorithm Also known as the Depth-Buffer algorithm, this image-space method simply selects for  display the polygon or portion of a polygon that is nearest to the view

include int choice, stack[10], top, element; void menu(); void push(); void pop(); void showelements(); void main() { choice=element=1; top=0; menu()

Methods of Collision Resolution 1)  Collision Resolution by separate chaining  2)  Collision Resolution by open addressing

A connected graph is a graph wherein path exists among every pair of vertices. A strongly connected graph is a directed graph wherein every pair of distinct vertices is connecte