Data Structures

HideShow resource information
  • Created by: timbowry
  • Created on: 16-11-15 11:16
Stack
LIFO Data structure. One pointer to Last item in stack
1 of 5
Queue
FIFO Data structure. Two pointers, One to the first item in the queue and one to the next free space
2 of 5
Binary Tree
A general data structure where the relationship of between data items (nodes) is stored.
3 of 5
Dynamic Data structures
Dynamic - no fixed size (you dont have to know how many elements are needed) but it may not be stored as efficiently
4 of 5
Static Data structures
Static - a fixed size, you have to know how big you want it to be when you declare
5 of 5

Other cards in this set

Card 2

Front

FIFO Data structure. Two pointers, One to the first item in the queue and one to the next free space

Back

Queue

Card 3

Front

A general data structure where the relationship of between data items (nodes) is stored.

Back

Preview of the back of card 3

Card 4

Front

Dynamic - no fixed size (you dont have to know how many elements are needed) but it may not be stored as efficiently

Back

Preview of the back of card 4

Card 5

Front

Static - a fixed size, you have to know how big you want it to be when you declare

Back

Preview of the back of card 5

Comments

No comments have yet been made

Similar Computing resources:

See all Computing resources »See all Data structures resources »