A data structure where the maximum storage needed is already known.

A data structure that is able to change size within set boundaries.

A data structure with a set size when created that cannot be changed.

A data structure where the data stored cannot be.changed

A type of queue where data items of the same priority are served FIFO.

A type of queue where the first data in will be the first out

A type of queue where data will be removed in a set order.

A type of queue where data items of the same priority are served LILO

Pop, Top, Push

Pop, Top, Pull

Drop, Top Pull

Pop, Stop, Pull

Tuples are defined using normal brackets.

Tuples cannot be changed after being created.

Operations like append() and remove() can be used.

Tuples are defined using curly brackets.

Doesn't need to check data structure size

Easy to add and remove data items

Efficient, in terms of storage, as the memory for the data structure has been set aside

Fixed size

Printer queue

Keyboard buffer

Real world simulations

CPU Scheduling

A data structure in which the sequence of data items is determined by the order in which they are inserted.

An immutable, ordered set of values, containing elements of any type.

An abstract data type consisting of a number of sequenced items.

A static data structure used to store an ordered collection of data items.