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
What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.

Write the non-recursive algorithm to traverse a tree in preorder.    The Non- Recursive algorithm for preorder traversal is as follows: Initially  push NULL onto stack and

Example: Assume the following of code: x = 4y + 3 z = z + 1 p = 1 As we have been seen, x, y, z and p are all scalar variables & the running time is constant irrespective

List areutilized to maintainPOLYNOMIALS in the memory. For example, we have a functionf(x)= 7x 5 + 9x 4   - 6x³ + 3x². Figure depicts the representation of a Polynomial by means o

Ruby implements Range of T Abstract data type Ruby implements Range of T ADT in its Range class. Elements of carrier set are represented in Range instances by recording interna

Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EXAMPLE.

Asymptotic Analysis Asymptotic analysis is depending on the idea that as the problem size grows, the complexity can be defined as a simple proportionality to some known functio

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

If a Dequeue is implemented via arrays, then this will suffer with the similar problems which a linear queue had suffered. Program 8 gives the array implementation of Dequeue.