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 are the Dynamic arrays Dynamic arrays are convenient for programmers since they can never be too small-whenever more space is needed in a dynamic array, it can simply be e

Primitive Data Structure These are the basic structure and are directly operated upon by the machine instructions. These in general have dissimilar representations on different

Example: Insertion of a key 33 into a B-Tree (w/split) Step 1: Search first node for key closet to 33. Key 30 was determined. Step 2: Node pointed through key 30, is se

Step 1: Choose a vertex in the graph and make it the source vertex & mark it visited. Step 2: Determine a vertex which is adjacent to the source vertex and begun a new search if

P os t - o r d e r T r av er sal :  This can be done by both iteratively and recursively. The iterative solution would require a modification or alteration of the in-

Insertion & deletion of target key requires splaying of the tree. In case of insertion, the tree is splayed to find the target. If, target key is found out, then we have a duplicat

Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays,

Explain about the String Abstract data type operations Symbol ADT has no concatenation operations, but presuming we have a full-featured String ADT, symbols can be concatenated

Linear search employee an exhaustive method of verified each element in the array against a key value. Whereas a match is found, the search halts. Will sorting the array before uti

Define about the class invariant A class invariant may not be true during execution of a public operation though it should be true between executions of public operations. For