Stack Data Structure

HideShow resource information
  • Created by: mrkhan
  • Created on: 24-09-14 13:22
A stack is a data structure.
It is known as a LIFO data structure (Last In First Out).
1 of 5
It can be described as being a bit like a pile of plates where the last plate is the first one taken off.
Every stack has a pointer, which identifies the top of the stack.
2 of 5
Whenever something is added to the stack it is known as 'PUSHING'.
Whenever anything is removed from the stack this is known as 'POPPING'.
3 of 5
When an item is 'popped' from the stack. The stack pointer is reduced by one (1).
When an item is 'pushed' to the stack. The stack pointer is incremented by one (1).
4 of 5
The Stack data structure helps the computer to continue from where it left off before it got interrupted
When the stack is FULL or EMPTY an appropriate message is delivered to the user of the computer system.
5 of 5

Other cards in this set

Card 2

Front

It can be described as being a bit like a pile of plates where the last plate is the first one taken off.

Back

Every stack has a pointer, which identifies the top of the stack.

Card 3

Front

Whenever something is added to the stack it is known as 'PUSHING'.

Back

Preview of the front of card 3

Card 4

Front

When an item is 'popped' from the stack. The stack pointer is reduced by one (1).

Back

Preview of the front of card 4

Card 5

Front

The Stack data structure helps the computer to continue from where it left off before it got interrupted

Back

Preview of the front of card 5

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Data structures resources »