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
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

c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party

(i)  Consider a system using flooding with hop counter. Suppose that the hop counter is originally set to the "diameter" (number of hops in the longest path without traversing any

Inorder traversal: The left sub tree is visited, then the node and then right sub-tree. Algorithm for inorder traversal is following: traverse left sub-tree visit node

What do you mean by complexity of an algorithm? The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space need of the algorithm i

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

Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Representation of data structure in memory is known as: Abstract data type

Draw trace table and determine output from the following flowchart using following data: Number = 45, -2, 20.5

Using the cohen sutherland. Algorithm. Find the visible portion of the line P(40,80) Q(120,30) inside the window is defined as ABCD A(20,20),B(60,20),C(60,40)and D(20,40)