Show understanding that an ADT is a collection of

data and a set of operations on those data

Show understanding that a stack, queue and linked

list are examples of ADTs

Use a stack, queue and linked list to store data 

Describe how a queue, stack and linked list can be

implemented using arrays

Describe the key features of a stack, queue and

linked list and justify their use for a given situation

Candidates will not be required to write pseudocode

for these structures, but they should be able to add,

edit and delete data from these structures