answersLogoWhite

0


Best Answer

In modern computer languages, the stack is usually implemented with more operations than just "push" and "pop". The length of a stack can often be returned as a parameter. Another helper operation top (also known as peek and peak) can return the current top element of the stack without removing it from the stack. This section gives pseudocode for adding or removing nodes from a stack, as well as the length and top functions. Throughout we will use null to refer to an end-of-list marker or sentinel value, which may be implemented in a number of ways using pointers. In modern computer languages, the stack is usually implemented with more operations than just "push" and "pop". The length of a stack can often be returned as a parameter. Another helper operation top[1] (also known as peek and peak) can return the current top element of the stack without removing it from the stack. This section gives pseudocode for adding or removing nodes from a stack, as well as the length and top functions. Throughout we will use null to refer to an end-of-list marker or sentinel value, which may be implemented in a number of ways using pointers. record Node {

data // The data being stored in the node

next // A reference to the next node; null for last node

}

record Stack {

Node stackPointer // points to the 'top' node; null for an empty stack

}

function push(Stack stack, Element element) { // push element onto stack

new(newNode) // Allocate memory to hold new node

newNode.data := element

newNode.next := stack.stackPointer

stack.stackPointer := newNode

}

function pop(Stack stack) { // increase the stack pointer and return 'top' node

// You could check if stack.stackPointer is null here.

// If so, you may wish to error, citing the stack underflow.

node := stack.stackPointer

stack.stackPointer := node.next

element := node.data

return element

}

function top(Stack stack) { // return 'top' node

return stack.stackPointer.data

}

function length(Stack stack) { // return the amount of nodes in the stack

length := 0

node := stack.stackPointer

while node not null {

length := length + 1

node := node.next

}

return length

}

As you can see, these functions pass the stack and the data elements as parameters and return values, not the data nodes that, in this implementation, include pointers. A stack may also be implemented as a linear section of memory (i.e. an array), in which case the function headers would not change, just the internals of the functions. Implementation

A typical storage requirement for a stack of n elements is O(n). The typical time requirement of O(1) operations is also easy to satisfy with a dynamic array or (singly) linked list implementation. C++'s Standard Template Library provides a "stack" templated class which is restricted to only push/pop operations. Java's library contains a Stack class that is a specialization of Vector. This could be considered a design flaw because the inherited get() method from Vector ignores the LIFO constraint of the Stack. Here is a simple example of a stack with the operations described above (but no error checking) in Python. class Stack(object):

def __init__(self):

self.stack_pointer = None

def push(self, element):

self.stack_pointer = Node(element, self.stack_pointer)

def pop(self):

e = self.stack_pointer.element

self.stack_pointer = self.stack_pointer.next

return e

def peek(self):

return self.stack_pointer.element

def __len__(self):

i = 0

sp = self.stack_pointer

while sp:

i += 1

sp = sp.next

return i

class Node(object):

def __init__(self, element=None, next=None):

self.element = element

self.next = next

if __name__ == '__main__':

# small use example

s = Stack()

[s.push(i) for i in xrange(10)]

print [s.pop() for i in xrange(len(s))]

The above is admittedly redundant as Python supports the 'pop' and 'append' functions to lists.

User Avatar

Wiki User

16y ago
This answer is:
User Avatar
More answers
User Avatar

Wiki User

15y ago

A stack is one of the basic data structures, implementing a last-in-first-out (LIFO) container. Pretty much like a stack of plates, the item last entered (put on top of the stack) will be the first one removed (pulled off the top of the stack), while the item first entered (put onto the empty stack) will be the last one removed.

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

Stack is a restrictive data structure as it is not meant for complex operation .It is a linear data structure where items/elements to be added or removed follow a natural path(LIFO).

Various operation on stack are

1.PUSH

2.POP

3.PEEP etc

This answer is:
User Avatar

User Avatar

Wiki User

11y ago

The main operations of a stack are:

1. push - To insert the element into the stack

2. pop - To remove an element from the stack


Other additional functions can also be performed:


3. top - To display the element at the top of the stack

4. size - To display the size of the stack

5. isempty - To determine whether the stack if empty or not

This answer is:
User Avatar

User Avatar

Wiki User

15y ago

"Push" adds an element to the top of a stack and "pop" removes the top element.

This answer is:
User Avatar

User Avatar

Wiki User

12y ago

there are two operations you can do with a STACK

one is PUSH operation and

the other is POP operation

This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is stack define the operations of stack?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Related questions

Design an algorithm to show the different operations on a stack?

Design an algorithm to show the different operations on a stack?


Define multinational co-operations?

what does multinational co-operations mean? can u define it for me


What are the stack operation?

there are two operations you can do with a STACK one is PUSH operation and the other is POP operation


What is interface stack?

The Stack class represents a last-in-first-out (LIFO) stack of objects. It extends class Vector with five operations that allow a vector to be treated as a stack. The usual push and pop operations are provided, as well as a method to peek at the top item on the stack, a method to test for whether the stack is empty, and a method to search the stack for an item and discover how far it is from the top.


How do you double the capacity of stack in c?

Something like this: before: #define MAXALLOC 256 after: #define MAXALLOC 512


What is time complexity of stack?

All major queue operations (push, pop and front) are constant time operations.


Different Scopes of application of operations research?

define the scope of operations research


Define the extra segment and stack segment?

The extra segment in the 8086/8088 is a 64kb region of memory that is indexed by the displacement address of the destination of certain string operations, relative to DI. Contrast that with the data segment, which is a 64kb region of memory that is indexed by the displacment address of the displacement of most operand addresses. The stack segment is similar, but it is used for stack oriented data, relative to SP or BP.


Can you use sp as offset address holder with cs?

SP is the stack pointer and can be used in the stack operations. It cannot be used for fetching the instruction


What is the most common method for illustrating the operations of a networking stack?

The OSI Model


What is a stack and how do you represent a stack in computer memory also discuss basic operation performed on a stack?

A stack is an abstraction of First-in-last-out, or the last in first out. The basic operations (may bear different names) Push or Add Pop or Next


Give at least 10 real life examples where you use stack operations?

zoology