A stack is a last in, first out (LIFO) abstract data type and sequential data structure. A stack may have any abstract data type as a component, but is characterized by two fundamental functions, called pop and push. The push operation includes a new item to the top of the stack, or starts the stack if it is empty. If the stack is full and does not have enough space to locate the given item, the stack is then goes to be in an overflow state. The pop operation replaces an item from the top of the stack. A pop either converts previously concealed results, or items in an empty stack, but if the stack is empty then it bond into underflow state. A stack pointer is the register which acquires the value of the stack. The stack pointer usually points to the top value of the stack.

 

A stack is a limited data structure, because only small values of operations are performed on it. The nature of the push and pop operations also seems that stack elements have a sequential order. Components are removed from the stack in the reverse order to the specific order of their addition: therefore, the lower components are those that have been on the stack the longest.

 

 

Posted Date: 7/27/2012 6:52:49 AM | Location : United States

Ask an Expert

Related Discussions:- Define stack lifo, Assignment Help, Ask Question on Define stack lifo, Get Answer, Expert's Help, Define stack lifo Discussions

Write discussion on Define stack lifo
Your posts are moderated

Write your message here..

Related Questions

How to improve my 69 algorithm, How can i decrease my latency for 69 moves How can i decrease my latency for 69 moves

Illustrate trivariate colour models, Illustrate Trivariate Colour Models ... Illustrate Trivariate Colour Models Conventional colour models based on the tristimulus theory all contain three variables and so are called trivariate models. Let us now consi

Procedures, what is far and near procedures in system programming? what is far and near procedures in system programming?

Maximum numbers of nodes a binary tree of depth d, Maximum numbers of nodes... Maximum numbers of nodes a binary tree of depth d The maximum numbers of nodes a binary tree of depth d can have is 2 d+1 -1.

Number of operations possible on ordered lists and arrays, Q. Enumerate num... Q. Enumerate number of operations possible on ordered lists and arrays.  Write procedures to insert and delete an element in to array.

Multiple queue, algorithm for multiple queue with example program algorithm for multiple queue with example program

Data structures, #quCreate a flowchart to show the process that will allow ... #quCreate a flowchart to show the process that will allow the implementation of Queue, Enqueue, and Dequeue operations.estion..

Naïve recursive algorithm for binomial coefficients, How many recursive cal... How many recursive calls are called by the naïve recursive algorithm for binomial coefficients, C(10, 5) and C(21, 12) C(n,k){c(n-1,k)+c(n-1,k-1) if 1 1 if k = n or k = 0

Reverse order of elements on a slack, Q. Reverse the order of the elements ... Q. Reverse the order of the elements on a stack S    (i) by using two additional stacks (ii) by using one additional queue. Ans :      L e t S be the stac

Determine in brief about the boolean, Determine in brief about the Boolean ... Determine in brief about the Boolean Carrier set of the Boolean ADT is the set {true, false}. Operations on these values are negation, conjunction, disjunction, conditional,